Random redundant storage in disk arrays: complexity of retrieval problems

Random redundant storage in disk arrays: complexity of retrieval problems

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 classi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2003-09, Vol.52 (9), p.1210-1214
Hauptverfasser: Aerts, J., Korst, J., Spieksma, F., Verhaegh, W., Woeginger, G.
Format: Artikel
Sprache:eng
Schlagworte:
Arrays
Complexity
Complexity theory
Data storage
Disks
Multimedia
Redundant
Retrieval
Strategy
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2003.1228515