Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems

Abstract We consider the problem of asynchronous execution of parallel programs. We assume that the original program is designed for a synchronous system, whereas the actual system may be asynchronous. We seek an automatic execution scheme , which allows the asynchronous system to execute the synchronous program. Previous execution schemes provide solutions only for the case where the original program is deterministic. Here, we provide the first solution for the more general case where the original program can be nondeterministic (e.g., randomized). Our scheme is based on a novel agreement protocol for the asynchronous parallel setting. Our protocol allows n asynchronous processors to agree on n word-sized values in O ( n  log  n  log log  n ) total work , assuming an oblivious adversary scheduler. Total work is defined to be the summation of the number of steps performed by all processors (including steps from busy waiting).

[1]  Michael A. Bender,et al.  Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler , 1996, ICALP.

[2]  Yonatan Aumann,et al.  Highly efficient asynchronous execution of large-grained parallel programs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[4]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[5]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  James Aspnes,et al.  Time-and space-efficient randomized consensus , 1990, PODC '90.

[7]  Nir Shavit,et al.  Bounded polynomial randomized consensus , 1989, PODC.

[8]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[9]  Paul G. Spirakis,et al.  Efficient robust parallel computations , 2018, STOC '90.

[10]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[11]  Alexander A. Shvartsman,et al.  Efficient Parallel Algorithms Can Be Made Robust , 1989, PODC.

[12]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[13]  Z. M. Kedem,et al.  Combining tentative and definite executions for very fast dependable parallel computing , 1991, STOC '91.

[14]  Tushar Deepak Chandra.  Polylog randomized wait-free consensus , 1996, PODC '96.

[15]  Richard Cole,et al.  The expected advantage of asynchrony , 1990, SPAA '90.

[16]  Alexander A. Shvartsman,et al.  Efficient parallel algorithms on restartable fail-stop processors , 1991, PODC '91.

[17]  Phillip B. Gibbons.  A more practical PRAM model , 1989, SPAA '89.

[18]  Yonatan Aumann,et al.  Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation , 1994, Theor. Comput. Sci..

[19]  James Aspnes,et al.  Randomized consensus in expected O(n log/sup 2/ n) operations per processor , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.