Efficient program transformations for resilient parallel computation via randomization

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

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

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: 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 publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Editors Anon
PublisherPubl by ACM
Pages306-317
Number of pages12
ISBN (Print)0897915119
StatePublished - 1992
EventProceedings of the 24th Annual ACM Symposium on the Theory of Computing - Victoria, BC, Can
Duration: May 4 1992May 6 1992

Other

OtherProceedings of the 24th Annual ACM Symposium on the Theory of Computing
CityVictoria, BC, Can
Period5/4/925/6/92

ASJC Scopus subject areas

  • Software

Cite this

Kedem, Z., Palem, K. V., Rabin, M. O., & Raghunathan, A. (1992). Efficient program transformations for resilient parallel computation via randomization. In Anon (Ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 306-317). Publ by ACM.

Efficient program transformations for resilient parallel computation via randomization. / Kedem, Zvi; Palem, K. V.; Rabin, M. O.; Raghunathan, A.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ed. / Anon. Publ by ACM, 1992. p. 306-317.

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

Kedem, Z, Palem, KV, Rabin, MO & Raghunathan, A 1992, Efficient program transformations for resilient parallel computation via randomization. in Anon (ed.), Conference Proceedings of the Annual ACM Symposium on Theory of Computing. Publ by ACM, pp. 306-317, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, BC, Can, 5/4/92.
Kedem Z, Palem KV, Rabin MO, Raghunathan A. Efficient program transformations for resilient parallel computation via randomization. In Anon, editor, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. Publ by ACM. 1992. p. 306-317
Kedem, Zvi ; Palem, K. V. ; Rabin, M. O. ; Raghunathan, A. / Efficient program transformations for resilient parallel computation via randomization. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. editor / Anon. Publ by ACM, 1992. pp. 306-317
@inproceedings{1a1063a348e74e5e91abe138859c065c,
title = "Efficient program transformations for resilient parallel computation via randomization",
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: 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.",
author = "Zvi Kedem and Palem, {K. V.} and Rabin, {M. O.} and A. Raghunathan",
year = "1992",
language = "English (US)",
isbn = "0897915119",
pages = "306--317",
editor = "Anon",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Efficient program transformations for resilient parallel computation via randomization

AU - Kedem, Zvi

AU - Palem, K. V.

AU - Rabin, M. O.

AU - Raghunathan, A.

PY - 1992

Y1 - 1992

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

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

UR - http://www.scopus.com/inward/record.url?scp=0026981386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026981386&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026981386

SN - 0897915119

SP - 306

EP - 317

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

A2 - Anon, null

PB - Publ by ACM

ER -