Fault-tolerant computing: theory and techniques; vol. 1
Fault-tolerant computing: theory and techniques; vol. 1
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
High-Availability LH* Schemes with Mirroring
COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
Fault tolerant record placement for decentralized SDDS LH
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
SDDSfL vs. local disk-a comparative study for Linux
Annales UMCS, Informatica
Scalable store of java objects using range partitioning
CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
Scalable Distributed Two-Layer Data Structures SD2DS
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Scalable Distributed Data Structures (SDDS) consists of two components dynamically spread across a multicomputer: records belonging to a file and a mechanism controlling record placement in file space. Record placement in the file is SDDS specific mechanism. It is spread between SDDS servers, their clients and dedicated process called split coordinator. In the paper fault-tolerant protocols for SDDS components are given. The protocols use Job Comparison Technique along with TMR. Basic and extended SDDS architectures are compared with the help of SDDS oriented software fault injector. Time overhead due to redundancy introduced is estimated, too.