Assigning Sites to Redundant Clusters in a Distributed Storage Systems

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1992
Accession Number
ADA251922

Entities

People

  • Antoine N. Mourad
  • Daniel G. Saab
  • W. Kent Fuchs

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Data Storage Systems
  • Distributed Computing
  • Environment
  • Guarantees
  • Heuristic Methods
  • High Performance Computing
  • Hot Spots
  • Image Processing
  • Intervals
  • Local Area Networks
  • Military Research
  • Three Dimensional
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Programming and Software Development.
  • Operations Research
  • Software Engineering.