ComputingComputer ScienceComputer SystemsFault ToleranceFault-tolerant ComputingStorage SystemsData RedundancyData Storage SystemsDistributed StorageDistributed Storage SystemsFault-tolerant Storage SystemsScalable Data StorageData-intensive ComputingHigh Availability StorageParity-based StorageReed-solomon CodesScalable Storage SystemsSearch Performance MetricsStorage AvailabilityStorage Performance Optimization
LH*RS is a new high-availability Scalable Distributed Data Structure (SDDS). The data storage scheme and the search performance of LH*RS are basically these of LH*. LH*RS manages in addition the parity information to tolerate the unavailability of k ⪈ 1 server sites. The value of k scales with the file, to prevent the reliability decline. The parity calculus uses the Reed -Solomon Codes. The storage and access performance overheads to provide the high-availability are about the smallest possible. The scheme should prove attractive to data-intensive applications.
14
The Art of Computer Programming
W.J. Worlton · Nuclear Science and Engineering · 1968 · 2.3K citations
A Survey of Matrix Theory and Matrix Inequalities
A. S. H., Marvin Marcus, Henryk Minc · Mathematics of Computation · 1965 · 1.5K citations
The theory of error-correcting codes
Joseph P. S. Kung, Gian‐Carlo Rota · Advances in Mathematics · 1979 · 558 citations