Efficient execution of nondeterministic parallel programs on asynchronous systems

Yonatan Aumann; Michael A. Bender; Lisa Zhang

doi:10.1145/237502.237566

Efficient execution of nondeterministic parallel programs on asynchronous systems

Yonatan Aumann
, Michael A. Bender
, Lisa Zhang

Department of Mathematics

Bar-Ilan University

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

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	https://doi.org/10.1145/237502.237566
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.

Funding

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

Funders	Funder number
ARMY	DAAH04-95-1-0607
National Science Foundation	CCR-9313775
Directorate for Computer and Information Science and Engineering	9313775
Advanced Research Projects Agency	N00014-95-1-1246

Access to Document

10.1145/237502.237566

Cite this

@conference{7416c21e15b54c888f1b42882eb0c96b,

title = "Efficient execution of nondeterministic parallel programs on asynchronous systems",

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).",

author = "Yonatan Aumann and Bender, \{Michael A.\} and Lisa Zhang",

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.; Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures ; Conference date: 24-06-1996 Through 26-06-1996",

year = "1996",

doi = "10.1145/237502.237566",

language = "אנגלית",

pages = "270--276",

}

TY - CONF

T1 - Efficient execution of nondeterministic parallel programs on asynchronous systems

AU - Aumann, Yonatan

AU - Bender, Michael A.

AU - Zhang, Lisa

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

PY - 1996

Y1 - 1996

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

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

UR - https://www.scopus.com/pages/publications/0030413602

U2 - 10.1145/237502.237566

DO - 10.1145/237502.237566

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0030413602

SP - 270

EP - 276

T2 - Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures

Y2 - 24 June 1996 through 26 June 1996

ER -

Efficient execution of nondeterministic parallel programs on asynchronous systems

Abstract

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this