S.-C. Chau and A. W.-C. Fu. A gracefully degradable declustered RAID architecture. Cluster Computing Journal, 5(1):97--105, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Fast Algorithm for Online Placement and Reorganization of.. - Honicky, Miller (2003) (3 citations) (Correct)
....the range and relocating data to rebalance the load. However, this method does not allow for the placement of replicas, an essential feature for modern scalable storage systems. Chau and Fu discuss and propose algorithms for declustered RAID whose performance degrades gracefully with failures [5]. Our algorithm exhibits similarly graceful degradation of performance: the pseudo random distribution of objects (declustering) means that the load on the system is distributed evenly when a disk fails. Peer to peer systems such as CFS [10] PAST [24] Gnutella [23] and FreeNet [7] assume that ....
S.-C. Chau and A. W.-C. Fu. A gracefully degradable declustered RAID architecture. Cluster Computing Journal, 5(1):97--105, 2002.
Replication under Scalable Hashing: A Family of Algorithms.. - Honicky, Miller (2004) (1 citation) (Correct)
No context found.
S.-C. Chau and A. W.-C. Fu. A gracefully degradable declustered RAID architecture. Cluster Computing Journal, 5(1):97--105, 2002.
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