English

# Item

ITEM ACTIONSEXPORT

Released

Journal Article

#### Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

##### MPS-Authors

Mestre,  Julián
Max Planck Society;

##### Locator
There are no locators available
##### Fulltext (public)
There are no public fulltexts available
##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Gandhi, R., & Mestre, J. (2009). Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. Algorithmica, 54(1), 54-71. doi:10.1007/s00453-007-9118-2.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-181B-2
##### Abstract
The \textit{data migration} problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, where vertices represent the storage devices, and edges represent data transfers required between pairs of devices. Each vertex has a non-negative weight, and each edge has a processing time. A vertex completes when all the edges incident on it complete; the constraint is that two edges incident on the same vertex cannot be processed simultaneously. The objective is to minimize the sum of weighted completion times of all vertices. Kim (\textit{Journal of Algorithms, 55:42-57, 2005}) gave an LP-rounding $3$-approximation algorithm when edges have unit processing times. We give a more efficient primal-dual algorithm that achieves the same approximation guarantee. When edges have arbitrary processing times we give a primal-dual 5.83-approximation algorithm. We also study a variant of the open shop scheduling problem. This is a special case of the data migration problem in which the transfer graph is bipartite and the objective is to minimize the completion times of edges. We present a simple algorithm that achieves an approximation ratio of \mbox{$\sqrt{2} \approx 1.414$}, thus improving the 1.796-approximation given by Gandhi~\etal\ (\textit{ACM Transaction on Algorithms, 2(1):116-129}, 2006). We show that the analysis of our algorithm is almost tight.