Abstract
It is well known that synchronization and communication delays are the major sources of performance degradation of synchronous parallel algorithms. It has been shown that asynchronous implementations have the potential to reduce the overhead to minimum. This paper surveys the existing asynchronous schemes and the sufficient conditions for the convergence of the surveyed schemes. Some comparisons among these schemes are also presented.
Recommended Citation
Lu, Eric Jui-Lin; Hilgers, Michael Gene; and McMillin, Bruce M., "Asynchronous Parallel Schemes: A Survey" (1993). Computer Science Technical Reports. 41.
https://scholarsmine.mst.edu/comsci_techreports/41
Department(s)
Computer Science
Report Number
CSC-93-19
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1993 University of Missouri--Rolla, All rights reserved.
Publication Date
November 1993
