On Algorithms for Efficient Data Migration. Hall, J., Hartline, J. D., Karlin, A. R., Saia, J., & Wilkes, J. 2001. ![On Algorithms for Efficient Data Migration [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination.
@booklet {Hall01onalgorithms,
title = {On Algorithms for Efficient Data Migration},
year = {2001},
abstract = {The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination.},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365\&rep=rep1\&type=pdf},
author = {Joseph Hall and Jason D. Hartline and Anna R. Karlin and Jared Saia and John Wilkes}
}
Downloads: 0
{"_id":"AT9to6oQXATox5SPP","bibbaseid":"hall-hartline-karlin-saia-wilkes-onalgorithmsforefficientdatamigration-2001","downloads":0,"creationDate":"2018-07-03T04:50:29.667Z","title":"On Algorithms for Efficient Data Migration","author_short":["Hall, J.","Hartline, J. D.","Karlin, A. R.","Saia, J.","Wilkes, J."],"year":2001,"bibtype":"booklet","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"booklet","type":"booklet","title":"On Algorithms for Efficient Data Migration","year":"2001","abstract":"The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination.","url":"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365&rep=rep1&type=pdf","author":[{"firstnames":["Joseph"],"propositions":[],"lastnames":["Hall"],"suffixes":[]},{"firstnames":["Jason","D."],"propositions":[],"lastnames":["Hartline"],"suffixes":[]},{"firstnames":["Anna","R."],"propositions":[],"lastnames":["Karlin"],"suffixes":[]},{"firstnames":["Jared"],"propositions":[],"lastnames":["Saia"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Wilkes"],"suffixes":[]}],"bibtex":"@booklet {Hall01onalgorithms,\n\ttitle = {On Algorithms for Efficient Data Migration},\n\tyear = {2001},\n\tabstract = {The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are fixed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination.},\n\turl = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365\\&rep=rep1\\&type=pdf},\n\tauthor = {Joseph Hall and Jason D. Hartline and Anna R. Karlin and Jared Saia and John Wilkes}\n}\n","author_short":["Hall, J.","Hartline, J. D.","Karlin, A. R.","Saia, J.","Wilkes, J."],"key":"Hall01onalgorithms","id":"Hall01onalgorithms","bibbaseid":"hall-hartline-karlin-saia-wilkes-onalgorithmsforefficientdatamigration-2001","role":"author","urls":{"Paper":"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.1365&rep=rep1&type=pdf"},"downloads":0},"search_terms":["algorithms","efficient","data","migration","hall","hartline","karlin","saia","wilkes"],"keywords":[],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}