We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Complexity of Network Synchronization

Thumbnail Image
Download
Name

MIT-LCS-TM-268.pdf

Size

6.6 MB

Format

Adobe PDF

Checksum (MD5)

3e9b5e56c324872494403573d3ed9749

Author(s)
Awerbuch, Baruch
Date Issued
January 1985
Series/Report no.
MIT-LCS-TM-268
Abstract
In this paper we investigate the problem of simulation of the synchronous network by the asynchronous one. We propose a new simulation technique, referred to as "Synchronizer" which is a new, simple methodology for desiging efficient distributed algorithms in asynchronous networks. Our Synchronizer exhibits a trade-off between its communication and time complexities, which is proved to be within a constant factor of the lower bound.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.