On distributed algorithms in a broadcast domain

Danny Dolev, Dalia Malki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

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 languageEnglish
Title of host publicationAutomata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
EditorsAndrzej Lingas, Rolf Karlsson, Svante Carlsson
PublisherSpringer Verlag
Pages371-387
Number of pages17
ISBN (Print)9783540569398
DOIs
StatePublished - 1993
Event20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden
Duration: 5 Jul 19939 Jul 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume700 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Colloquium on Automata, Languages and Programming, ICALP 1993
Country/TerritorySweden
CityLund
Period5/07/939/07/93

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.

Fingerprint

Dive into the research topics of 'On distributed algorithms in a broadcast domain'. Together they form a unique fingerprint.

Cite this