Maintaining and checking parity in highly available Scalable Distributed Data Structures

Access to data stored in distributed main memory is much faster than access to local disks. Highly available, Scalable Distributed Data Structures (SDDS) utilize this fast access. They counteract the effects of failed or unavailable nodes by storing data redundantly. Since main memory per node is li...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of systems and software 2010-04, Vol.83 (4), p.529-542
Hauptverfasser:	Cieslicki, Damian, Schaeckeler, Stefan, Schwarz, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Availability Codes Computer programs Data structures Disks Mathematical analysis Parity Parity coherence Replication Scalability Scalable Distributed Data Structures Software Storage Studies Traffic flow
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!