Eric J. Schwabe, Ian M. Sutherland  Home/Search
Context
Related
| depaul.edu/research/TechR...TR02005.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: depaul.edu/research/technical (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The joint demands of high performance and fault tolerance in a large array of disks can be satisfied by a parity-declustered data layout -- an arrangement of data and redundant information that allows the rapid reconstruction of lost data while the array continues to operate. A data layout is typically generated by partitioning the data units on the disks into stripes and choosing one or more units per stripe to hold redundant information. Such a data layout can be represented as a table of... (Update)
Active bibliography (related documents): More All
0.3: Declustered Disk Array Architectures with Optimal and.. - Alvarez, Burkhard, al. (1998) (Correct)
0.3: Evaluating Approximately Balanced Parity-Declustered.. - Schwabe, Holmer.. (Correct)
0.3: Improved Parity-Declustered Layouts for Disk Arrays - Schwabe, Sutherland (1994) (Correct)
Similar documents based on text: More All
0.4: Configuration Compression for the Xilinx XC6200 FPGA - Hauck, Li (1999) (Correct)
0.4: Flexible Usage of Redundancy in Disk Arrays - Schwabe, Sutherland (1999) (Correct)
0.2: Combining Web Usage and Content Mining for More.. - Mobasher, Dai, Luo.. (2000) (Correct)
BibTeX entry: (Update)
@misc{ schwabe-efficient,
author = "Eric J. Schwabe and Ian M. Sutherland",
title = "Efficient Data Mappings for Parity-Declustered Data Layouts",
url = "citeseer.ist.psu.edu/schwabe02efficient.html" }
Citations (may not include all citations):158 A Case for Redundant Arrays of Inexpensive Disks (RAID (context) - Patterson, Gibson et al. - 1990
78 Performance Analysis of Disk Arrays Under Failure (context) - Muntz, Lui - 1990
77 A Course in Number Theory and Cryptography (context) - Koblitz - 1987
68 Modern Computer Algebra (context) - Gathen, Gerhard - 1999
60 Parity Declustering for Continuous Operation in Redundant Di.. - Holland, Gibson - 1992
37 Balanced Incomplete Block Designs and Related Designs (context) - Hanani - 1975
29 Tolerating Multiple Failures in RAID Architectures with Opti.. - Alvarez, Burkhard et al. - 1997
7 Declustered Disk Array Architectures with Optimal and Near-O.. - Alvarez, Burkhard et al. - 1998
4 Parallelism in Parity-Declustered Layouts for Disk Arrays (context) - Stockmeyer - 1994
1 Algebra (3rd edition (context) - Lang - 1992
1 Improved Parity-Declustered Data Layouts for Disk Arrays (context) - Schwabe, Sutherland - 1996
Documents on the same site (http://www.cs.depaul.edu/research/technical.asp): More
A Note on Parameterized Exponential Time Complexity - Chen, Kanj, Xia (Correct)
Efficient All-to-All Broadcast Schemes in Distributed-Memory.. - Oh, Kanj (Correct)
Integrating Web Usage and Content Mining for More.. - Mobasher, Dai, Luo.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC