A course in number theory and cryptography
A course in number theory and cryptography
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Improved parity-declustered layouts for disk arrays
Journal of Computer and System Sciences
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering
Proceedings of the 24th annual international symposium on Computer architecture
Declustered disk array architectures with optimal and near-optimal parallelism
Proceedings of the 25th annual international symposium on Computer architecture
Modern computer algebra
Performance Analysis of Disk Arrays under Failure
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
The joint demands of high performance and fault tolerance in a large array of disks can be satisfied by a parity-declustered data layout. Such a data layout is generated by partitioning the data on the disks into stripes and choosing a part of each stripe to hold redundant information. Thus the data layout can be represented as a table of stripes. The data mapping problem is the problem of translating a data address into a disk identifier and an offset on that disk. Recent work has yielded mappings that compute disks and offsets directly from data addresses without the need to store tables. In this paper, we show that parity-declustered data layouts based on commutative rings yield mappings with improved computational efficiency and wider applicability.