A. Raghunathan

Learn More
We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a(More)
In this paper, we address the problem of automatically transforming <italic>arbitrary</italic> programs written for an ideal parallel machine to run on a <italic>completely asynchronous</italic> machine. We present a <italic>transformation</italic> which can be applied to an ideal program such that the resulting program's execution on an asynchronous(More)
Except where reference is made to the work of others, the work described in this thesis is my own or was done in collaboration with my advisory committee. This thesis does not include proprietary or classified information. Permission is granted to Auburn University to make copies of this thesis at its discretion, upon the request of individuals or(More)
  • 1