Fault tolerant distributed shared memory algorithms

Distributed shared memory (DSM) has received increased attention as a mechanism for interprocess communication in loosely-coupled distributed systems because of its perceived advantages over direct use of message passing or remote procedure calls. One problem with most DSM algorithms proposed to dat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel and Distributed Processing, 2nd IEEE Symposium On S. 719 - 724
Hauptverfasser: Stumm, M., Songnian Zhou
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1990
Schlagworte:
Algorithm design and analysis
Application software
Clustering algorithms
Costs
Fault tolerance
Fault tolerant systems
Message passing
Performance analysis
Read-write memory
Workstations
ISBN:0818620870, 9780818620874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Distributed shared memory (DSM) has received increased attention as a mechanism for interprocess communication in loosely-coupled distributed systems because of its perceived advantages over direct use of message passing or remote procedure calls. One problem with most DSM algorithms proposed to date, however, is that they do not tolerate faults. The paper extends four basic DSM algorithms to tolerate single host failures and argues that this degree of fault tolerance is sufficient for most applications. It analyzes the performance behavior of the fault tolerant DSM algorithms and shows that for some algorithms the additional overhead for fault tolerance is quite small, but that for other algorithms the extra overhead can be substantial and even unpredictable.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143633