Random redundant storage in disk arrays: Complexity of retrieval problems

J. Aerts, J. Korst, F. Spieksma, W. Verhaegh, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.
Original languageEnglish
Pages (from-to)1210-1214
Number of pages15
JournalIEEE transactions on computers
Volume52
Issue number9
DOIs
Publication statusPublished - 2003

Keywords

  • METIS-213312

Fingerprint Dive into the research topics of 'Random redundant storage in disk arrays: Complexity of retrieval problems'. Together they form a unique fingerprint.

Cite this