Data and computer communications (5th ed.)
Data and computer communications (5th ed.)
Optimal load balancing in distributed computer systems
Optimal load balancing in distributed computer systems
Windows NT cluster server guidebook
Windows NT cluster server guidebook
Foundations of Coding: Theory and Applications of Error-Correcting Codes, with an Introduction to Cryptography and Informat
A Case for Redundant Arrays of Inexpensive Disks (RAID)
A Case for Redundant Arrays of Inexpensive Disks (RAID)
| Hi-index | 0.00 |
A method for ensuring system fault-tolerance and guaranteed data access based on a model of distributed data storage with controlled redundancy is considered. A data file is represented as a set of nparts, each of size 1/kof the source file, so that the source file can be generated from any kparts (kn). The cardinality of the set may vary by constructing new (or by deleting the existing) parts, i.e., without modifying the existing parts, so that the source file can still be generated from any kparts. The file partitioning and assembly algorithms are based on the theory of finite Galois fields GF. A file is represented as a sequence of k-dimensional vectors over a GF. Every fragment is a sequence of projections of these vectors onto a k-dimensional vector (chosen for the given fragment) over the GF. In the paper, several implementations of the model are presented. For each of these implementations, the results of performance on the Celeron-450 processor are obtained and analyzed to determine their range of application.