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).
| Original language | English |
|---|---|
| Pages (from-to) | 1-16 |
| Number of pages | 16 |
| Journal | Information and Computation |
| Volume | 139 |
| Issue number | 1 |
| DOIs | |
| State | Published - 25 Nov 1997 |
Bibliographical note
Funding Information:* An initial version of this paper was presented in SPAA 1996. -This work was done while the author was at the MIT Laboratory of Computer Science. Supported in part by a Wolfson postdoctoral fellowship and Darpa Contract N00014-92-J-1799. Supported by NSF Contract CCR-9313775. 9Supported by an NSF graduate fellowship, ARMY Grant DAAH04-95-1-0607, and ARPA Contract N00014-95-1-1246.