A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Multimedia network file servers: multi-channel delay sensitive data retrieval
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
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
Random duplicate storage strategies for load balancing in multimedia servers
Information Processing Letters
Disk Scheduling for Variable-Rate Data Streams
IDMS '97 Proceedings of the 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Information Processing Letters
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On load-balanced semi-matchings for weighted bipartite graphs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hi-index | 0.89 |
Random Duplicated Assignment (RDA) is an approach in which video data is stored by assigning a number of copies of each data block to different, randomly chosen disks. It has been shown that this approach results in smaller response times and lower disk and RAM costs compared to the well-known disk stripping techniques. Based on this storage approach, one has to determine, for each given batch of data blocks, from which disk each of the data blocks is to be retrieved. This is to be done in such a way that the maximum load of the disks is minimized. The problem is called the Retrieval Selection Problem (RSP). In this paper, we propose a new efficient algorithm for RSP. This algorithm is based on the breadth-first search approach and is able to guarantee optimal solutions for RSP in O(n2 + mn), where m and n correspond of the number of data blocks and the number of disks, respectively. We will show that our proposed algorithm has a lower time complexity than an existing algorithm, called the MFS algorithm.