Abstract
This paper studies the usage of broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a broadcast domain: clock synchronization, reliable and ordered broadcast, membership, and file replication. The clock synchronization algorithm shows for the first time how to utilize broadcast communication for synchronization. The master synchronizes any number of slaves while incurring a constant load. The approach taken in the file replication tool uses snooping in order to enhance the availability of file systems, at almost no cost.
Original language | English |
---|---|
Title of host publication | Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings |
Editors | Andrzej Lingas, Rolf Karlsson, Svante Carlsson |
Publisher | Springer Verlag |
Pages | 371-387 |
Number of pages | 17 |
ISBN (Print) | 9783540569398 |
DOIs | |
State | Published - 1993 |
Event | 20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden Duration: 5 Jul 1993 → 9 Jul 1993 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 700 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 20th International Colloquium on Automata, Languages and Programming, ICALP 1993 |
---|---|
Country/Territory | Sweden |
City | Lund |
Period | 5/07/93 → 9/07/93 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1993.