Efficient program transformations for resilient parallel computation via randomization

Z. M. Kedem, K. V. Palem, M. O. Rabin, A. Raghunathan

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper, we address the problem of automatically transforming arbitrary programs written for an ideal parallel machine to run on a completely asynchronous machine. We present a transformation which can be applied to an ideal program such that the resulting program's execution on an asynchronous machine is work and space efficient, relative to the ideal program from which it is derived. Above all, the transformation will guarantee that the ideal program will execute in a continually progressive manner on the asynchronous machine: the computation itself will make progress without waiting for slow or failed processors to complete their work. We ensure the above properties by requiring that only read and write instructions be primitives in the asynchronous machine; these instructions are not universal. Furthermore, the individual processors can get delayed for arbitrary amounts of time while executing any instruction. In contrast, previous work relied either on the asynchronous machine having universal read-modify-write instructions as primitives, or on limited asynchrony by restricting the relative speeds of the processors.

Original languageEnglish (US)
Title of host publicationProceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
PublisherAssociation for Computing Machinery
Number of pages12
ISBN (Electronic)0897915119
StatePublished - Jul 1 1992
Event24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada
Duration: May 4 1992May 6 1992

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129722
ISSN (Print)0737-8017


Conference24th Annual ACM Symposium on Theory of Computing, STOC 1992

ASJC Scopus subject areas

  • Software

Cite this