Accession Number : ADA260458


Title :   Assigning Sites to Redundant Clusters in a Distributed Storage System


Corporate Author : ILLINOIS UNIV AT URBANA CENTER FOR RELIABLE AND HIGH-PERFORMANCE COMPUTING


Personal Author(s) : Mourad, Antoine N ; Fuchs, W K ; Saab, Daniel G


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a260458.pdf


Report Date : Jan 1992


Pagination or Media Count : 23


Abstract : Redundant Arrays of Distributed Disks (RADD) can be used in a distributed computing system or database system to provide recovery in the presence of disk crashes and temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites of a distributed storage system into redundant arrays in such a way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-hard. We then propose and evaluate several heuristic algorithms for finding approximate solutions. Simulation results show that significant reduction in remote parity update costs can be achieved by optimizing the site partitioning scheme.


Descriptors :   *DISTRIBUTED DATA PROCESSING , *DATA STORAGE SYSTEMS , *REDUNDANT COMPONENTS , DATA BASES , ALGORITHMS , COMPUTERIZED SIMULATION , GRAPHS , FAILURE , COMPUTER ARCHITECTURE , DISKS , CRASHES , COSTS , REDUCTION , ARRAYS , SITES , RECOVERY , COMPUTATIONS , DISASTERS


Subject Categories : Computer Systems


Distribution Statement : APPROVED FOR PUBLIC RELEASE