Name
Abstract | ||
|---|---|---|
An important issue in multimedia servers is disk load balancing. In this paper we use randomization and data redundancy to enable good load balancing. We focus on duplicate storage strategies, i.e., each data block is stored twice. This means that a request for a block can be serviced by two disks. A consequence of such a storage strategy is that we have to decide for each block which disk to use for its retrieval. This results in a so-called retrieval selection problem. We describe a graph model for duplicate storage strategies and derive polynomial time optimization algorithms for the retrieval selection problems of several storage strategies. Our model unifies and generalizes chained declustering and random duplicate assignment strategies. Simu- lation results and a probabilistic analysis complete this paper. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0020-0190(00)00115-0 | Inf. Process. Lett. |
Keywords | Field | DocType |
load balancing,information retrieval,combinatorial problems,random duplicate storage strategy,analysis of algorithms,multimedia server,real-time systems,load balance,probabilistic analysis,polynomial time,real time systems | Graph theory,Discrete mathematics,Load balancing (computing),Computer science,Nonlinear programming,Analysis of algorithms,Block (data storage),Probabilistic analysis of algorithms,Theoretical computer science,Data redundancy,Time complexity,Distributed computing | Journal |
Volume | Issue | ISSN |
76 | 1-2 | 0020-0190 |
Citations | PageRank | References |
10 | 0.66 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joep Aerts | 1 | 134 | 17.32 |
| Jan Korst | 2 | 175 | 19.94 |
| Sebastian Egner | 3 | 158 | 132.06 |