TY - GEN
T1 - Efficient program transformations for resilient parallel computation via randomization
AU - Kedem, Z. M.
AU - Palem, K. V.
AU - Rabin, M. O.
AU - Raghunathan, A.
N1 - Publisher Copyright:
© 1992 ACM.
PY - 1992/7/1
Y1 - 1992/7/1
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
U2 - 10.1145/129712.129742
DO - 10.1145/129712.129742
M3 - Conference contribution
AN - SCOPUS:0026981386
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 306
EP - 317
BT - Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
PB - Association for Computing Machinery
T2 - 24th Annual ACM Symposium on Theory of Computing, STOC 1992
Y2 - 4 May 1992 through 6 May 1992
ER -