The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026 but intermittent service interruptions may occur. Please email dspace-lib@mit.edu
with any questions. Thank you for your patience as we implement this important upgrade.
Complexity of Network Synchronization
| dc.contributor.author | Awerbuch, Baruch | en_US |
| dc.date.accessioned | 2023-03-29T14:25:10Z | |
| dc.date.available | 2023-03-29T14:25:10Z | |
| dc.date.issued | 1985-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149078 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-268 | |
| dc.title | Complexity of Network Synchronization | en_US |
| dc.identifier.oclc | 14694454 |
