Efficient program transformations for resilient parallel computation via randomization (preliminary version)

  • Authors:

  • Z. M. Kedem;K. V. Palem;M. O. Rabin;A. Raghunathan

  • Affiliations:

  • Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer St., New York, NY;IBM Research Division, T. J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY;Aiken Computation Laboratory, Harvard University, Cambridge, MA and Institute of Mathematics, Hebrew University, Jerusalem, Israel;Computer Science Division, University of California, Davis, CA

  • Venue:
  • STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

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; 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.