Assigning Sites to Redundant Clusters in a Distributed Storage Systems

reportActive / Technical Report | Accession Number: ADA251922 | Open PDF

Abstract:

Distributed redundant disk arrays 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 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 and we propose several heuristic algorithms for finding approximate solutions.

Author(s):
Mourad, Antoine N. ; Fuchs, W. K. ; Saab, Daniel G.
Author Organization(s):
ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB
Descriptive Note:
Conference paper
Supplementary Note:
Submitted to Symposium on Reliable Distributed Systems (11th)
Pagination:
0022

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.

RECORD

Collection: TR
Identifying Numbers
Contract/Grant Number(s):
N00014-91-J-1283, NAG-1-613
Monitor Series:
ONR
 Subject Terms
Joint Capability Areas:
JCA_5.3_Planning; JCA_5_Command and Control; JCA_6_Net Centric; JCA_6.1_Information Transport; JCA_5.3.3_Develop Strategy; JCA_1.2.7_Experimentation; JCA_1.2.5_Lessons Learned; JCA_1_Force Support; JCA_6.2.1_Information Sharing; JCA_6.2.2_Computing Services
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*ARRAYS, *REDUNDANT COMPONENTS, *DISTRIBUTED DATA PROCESSING, *DISKS, PROBLEM SOLVING, COSTS, DATA STORAGE SYSTEMS, PARITY, PAPER, CRASHES, FAILURE, SITES, LOCAL AREA NETWORKS, ALGORITHMS, RECOVERY
Field(s)/Group(s):
Computer Hardware
Report Date:
1992 Jan 01