This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A bypass node is a node that is not the target of a move operation, but is used as an intermediate holding point for a data item.
- 2.
The utilization is the total number of clients that can be assigned to a disk that contains the data they want.
Recommended Reading
Anderson E, Hall J, Hartline J, Hobbes M, Karlin A, Saia J, Swaminathan R, Wilkes J (2001) An experimental study of data migration algorithms. In: Workshop on algorithm engineering
Coffman E, Garey M, Jr, Johnson D, Lapaugh A (1985) Scheduling file transfers. SIAM J Comput 14(3):744–780
Golubchik L, Khuller S, Kim Y, Shargorodskaya S, Wan Y (2004) Data migration on parallel disks. In: 12th annual european symposium on algorithms (ESA)
Golubchik L, Khanna S, Khuller S, Thurimella R, Zhu A (2000) Approximation algorithms for data placement on parallel disks. In: Symposium on discrete algorithms. Society for industrial and applied mathematics, Philadelphia, pp 223–232
Hall J, Hartline J, Karlin A, Saia J, Wilkes J (2001) On algorithms for efficient data migration. In: SODA. Society for industrial and applied mathematics, Philadelphia, pp 620–629
Hedetniemi SM, Hedetniemi ST, Liestman A (1988) A survey of gossiping and broadcasting in communication networks. Networks 18:129–134
Hromkovic J, Klasing R, Monien B, Peine R (1996) Dissemination of information in interconnection networks (broadcasting and gossiping). In: Du DZ, Hsu F (eds) Combinatorial network theory. Kluwer Academic, Dordrecht, pp 125–212
Kashyap S, Khuller S (2003) Algorithms for non-uniform size data placement on parallel disks. In: Conference on FST&TCS conference. LNCS, vol 2914. Springer, Heidelberg, pp 265–276
Kashyap S, Khuller S, Wan Y-C, Golubchik L (2006) Fast reconfiguration of data placement in parallel disks. In: Workshop on algorithm engineering and experiments
Khuller S, Kim Y, Malekian A (2006) Improved algorithms for data migration. In: 9th international workshop on approximation algorithms for combinatorial optimization problems
Khuller S, Kim Y, Wan Y-C (2004) Algorithms for data migration with cloning. SIAM J Comput 33(2):448–461
Kim Y-A (2005) Data migration to minimize the average completion time. J Algorithms 55:42–57
Lu C, Alvarez GA, Wilkes J (2002) Aqueduct:online datamigration with performance guarantees. In: Proceedings of the conference on file and storage technologies
Shachnai H, Tamir T (2001) Polynomial time approximation schemes for class-constrained packing problems. J Sched 4(6):313–338
Shachnai H, Tamir T (2001) On two class-constrained versions of the multiple knapsack problem. Algorithmica 29(3):442–467
Shannon CE (1949) A theorem on colouring lines of a network. J Math Phys 28:148–151
Shmoys DB, Tardos E (1993) An approximation algorithm for the generalized assignment problem. Math Program 62(3):461–474
Vizing VG (1964) On an estimate of the chromatic class of a p-graph (Russian). Diskret Analiz 3:25–30
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Kim, YA. (2016). Data Migration. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_98
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_98
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering