Random redundant storage in disk arrays: Complexity of retrieval problems
Joep Aerts, Jan Korst, Frits C. R. Spieksma, Wfj Wim Verhaegh, Gerhard J. Woeginger · IEEE Transactions on Computers · 2003
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.