Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Disk striping strategies for large video-on-demand servers
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Random duplicated assignment: an alternative to striping in video servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Efficient data layout, scheduling and playout control in MARS
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Performance analysis of the RIO multimedia storage system with heterogeneous disk configurations
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Balanced allocations: the heavily loaded case
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asynchronous scheduling of redundant disk arrays
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Random duplicate storage strategies for load balancing in multimedia servers
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Comparing disk scheduling algorithms for VBR data streams
Computer Communications
Approximation of a retrieval problem for parallel disks
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A (1-1/e)-approximation algorithm for the generalized assignment problem
Operations Research Letters
| Hi-index | 14.98 |
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.