Abstract
We consider the problem of asynchronous execution of parallel programs. The original program is assumed to be designed for a synchronous system, while the actual system may be asynchronous. We seek an automatic execution scheme, which allows the asynchronous system to execute the synchronous program. Previous solutions to this problem provide a solution only for the case where the original program is deterministic. Here, we provide the first solution for the nondeterministic case (e.g. randomized programs). Our scheme is based on a novel agreement protocol for this setting. Our protocol allows n asynchronous processors to agree on n word-sized values in O(n log n log log n) total work. Total work is defined to be the summation of the number of steps performed by all processes (including busy waiting).
| Original language | English |
|---|---|
| Pages | 270-276 |
| Number of pages | 7 |
| DOIs | |
| State | Published - 1996 |
| Event | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy Duration: 24 Jun 1996 → 26 Jun 1996 |
Conference
| Conference | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures |
|---|---|
| City | Padua, Italy |
| Period | 24/06/96 → 26/06/96 |
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.