Abstract
The synchronizer is a simulation methodology introduced by Awerbuch [Al] for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. In this paper we present a novel technique for constructing network synchronizers. This technique is developed from some basic relationships between synchronizers and the structure of a t-spanning subgraph over the network. As a special result, we obtain a synchronizer for the hyper-cube with optimal time and communication complexities.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987 |
| Editors | Fred B. Schneider |
| Publisher | Association for Computing Machinery |
| Pages | 77-85 |
| Number of pages | 9 |
| ISBN (Electronic) | 089791239X |
| DOIs | |
| State | Published - 1 Dec 1987 |
| Externally published | Yes |
| Event | 6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987 - Vancouver, Canada Duration: 10 Aug 1987 → 12 Aug 1987 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| Volume | Part F130235 |
Conference
| Conference | 6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987 |
|---|---|
| Country/Territory | Canada |
| City | Vancouver |
| Period | 10/08/87 → 12/08/87 |
Bibliographical note
Publisher Copyright:© 1987 ACM.