Fault tolerant record placement for decentralized SDDS LH

Authors:
Grzegorz Łukawski;Krzysztof Sapiecha
Affiliations:
Department of Computer Science, Kielce University of Technology, Poland;Department of Computer Science, Kielce University of Technology, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 4
Cited 1

LH*—a scalable, distributed data structure

ACM Transactions on Database Systems (TODS)
High-Availability LH* Schemes with Mirroring

COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
High-Performance Computing: Clusters, Constellations, MPPs, and Future Directions

Computing in Science and Engineering
Fault-Tolerant protocols for scalable distributed data structures

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Scalable Distributed Two-Layer Data Structures SD2DS

International Journal of Distributed Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scalable Distributed Data Structures (SDDS) is a file of records distributed to servers of a multicomputer. Faults of record placement in SDDS file may lead the file to crash. In this paper a fault model for decentralized SDDS LH* (DSDDS LH*) is given and, for such a model, a fault tolerant record placement architecture is presented. Client message forwarding is supplemented with client message backwarding. Split token (used in DSDDS LH* for controlling the file scalability) is supplemented with token tracing protocol and so called token level. These additional mechanisms allow for regeneration of DSDDS LH* file damaged by transient control faults.