Deakin University
Browse

File(s) under permanent embargo

An experimental study of data migration algorithms

conference contribution
posted on 2001-10-01, 00:00 authored by E Anderson, J Hall, J Hartline, Michael HobbsMichael Hobbs, A Karlin, J Saia, R Swaminathan, J Wilkes
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing usage patterns might necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. We introduce two new data migration algorithms, one of which has provably good bounds. We empirically compare the performance of these new algorithms against similar algorithms from Hall et al. [7] which have better theoretical guarantees and find that in almost all cases, the new algorithms perform better. We also find that both the new algorithms and the ones from Hall et al. perform much better in practice than the theoretical bounds suggest.

History

Event

International Workshop on Algorithm Engineering

Publisher

Springer-Verlag Berlin Heidelberg

Location

Aarhus, Denmark

Place of publication

Berlin, Heidelberg

Start date

2001-08-28

End date

2001-08-31

Publication classification

EN.1 Other conference paper

Editor/Contributor(s)

G Brodal, D Frigioni, A Marchetti-Spaccamela

Title of proceedings

Proceedings of the 5th International Workshop on Algorithm Engineering

Usage metrics

    Research Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC