#### DMCA

## Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems

### Citations

431 | Tarjan, “Self-adjusting binary search trees
- Sleator, E
- 1985
(Show Context)
Citation Context ...ounded situation. All the algorithms use the memoization technique to reduce the computation time. We use a splay tree data structure to minimize the number of access operations over a period of time =-=[9]-=-. The binary search algorithm in LMIN was implemented as follows. First, compute the costs of the two end points and the mid point. Discard the one point out of the three with the highest cost and use... |

90 |
et al.: Introduction to Algorithms
- Cormen
- 2009
(Show Context)
Citation Context ...nd valid edges becomes directed and acyclic. The running time of finding the single-pair shortest path in a given Direct Acyclic Graph (DAG) – based on topological sort – is known to be O(V + E) (see =-=[7]-=-). Given the initial source v0(n0, d0, a0, c), the maximum number of possible vertices is O((a0 + 1)(d0 + 1)) = O(a0d0). Thus, the running time is bounded by O(a0 2 d0 2 ) because O(V +E) = O(V +V 2 )... |

69 | Comparing random data allocation and data striping in multimedia servers
- Santos, Muntz
- 2000
(Show Context)
Citation Context ...orage devices, an efficient directory service is necessary to locate individual blocks. It has been shown that random data placement can achieve similar performance to traditional striping techniques =-=[2]-=-. On–line scalability is also closely related to a problem referred to as data migration. The general problem that a data migration algorithm addresses is to re-balance a storage system after it has b... |

48 | An Experimental Study of Data Migration Algorithms. Workshop on Algorithm Engineering,
- Anderson, Hall, et al.
- 2001
(Show Context)
Citation Context ...tems (or blocks) in the system, and (b) efficiently move all the data blocks from their previous placement to their new locations. A number of studies have investigated data migration algorithms [3], =-=[4]-=-, [5], [6]. Finding a migration plan can be mapped to a multi-graph edge-coloring problem to compute the minimum number of colors needed. Unfortunately, finding the optimal solution is either N Pcompl... |

45 | On Algorithms for Efficient Data Migration.
- Hall, Hartline, et al.
- 2001
(Show Context)
Citation Context ...ata items (or blocks) in the system, and (b) efficiently move all the data blocks from their previous placement to their new locations. A number of studies have investigated data migration algorithms =-=[3]-=-, [4], [5], [6]. Finding a migration plan can be mapped to a multi-graph edge-coloring problem to compute the minimum number of colors needed. Unfortunately, finding the optimal solution is either N P... |

34 | Algorithms for Data Migration with Cloning.
- Khuller, Kim, et al.
- 2003
(Show Context)
Citation Context ...locks) in the system, and (b) efficiently move all the data blocks from their previous placement to their new locations. A number of studies have investigated data migration algorithms [3], [4], [5], =-=[6]-=-. Finding a migration plan can be mapped to a multi-graph edge-coloring problem to compute the minimum number of colors needed. Unfortunately, finding the optimal solution is either N Pcomplete [3] or... |

8 | Efficient disk replacement and data migration algorithms for large disk subsystems.
- Seo, Zimmermann
- 2005
(Show Context)
Citation Context ...uding re-balancing the data) and then remove all the old disks to be deleted (including first rebalancing the data). We present the Lemmas 1 to 8 to outline our argument (detailed proofs are shown in =-=[8]-=-). Lemma 1: ωs(A i+j n ) ≤ ωs(A i nA j n+i ). Lemma 2: ωs(D i+j n ) ≤ ωs(D i nD j n−i ). Lemma 3: ωs(A i nD j n+i ) ≤ ωs(D j nA i n−j ). Lemma 4: The shortest path of ωs(r(n, d, a)) is A a nD d n+a. L... |

3 |
RIO: A Real-time Multimedia Object
- Muntz, Santos, et al.
- 1997
(Show Context)
Citation Context ..., resulting in a new random distribution after the reorganization. For example, the RIO multimedia object server demonstrated the applicability of random data placement for media-rich storage systems =-=[1]-=-. Next to flexibility and reliability, performance is often of paramount importance with storage systems. When data blocks are randomly distributed This research has been funded in part by equipment g... |

2 |
Spence Mustafa Uysal, and Alistair Veitch, Hippodrome: Running Circles around Storage Administration
- Anderson, Hobbs, et al.
(Show Context)
Citation Context ...(or blocks) in the system, and (b) efficiently move all the data blocks from their previous placement to their new locations. A number of studies have investigated data migration algorithms [3], [4], =-=[5]-=-, [6]. Finding a migration plan can be mapped to a multi-graph edge-coloring problem to compute the minimum number of colors needed. Unfortunately, finding the optimal solution is either N Pcomplete [... |