Abstract
The problem of computing a migration plan among the store devices for moving the data from current configuration to the target configuration is called data migration problem. There are some reasons to cause the data migration, the reordering of the data combination, the system’s load balancing, and the change of use mode. In this paper, we ignore the network speed and transfer speed. And only consider the situation that each store device can be used as sender of receiver in the transfer process at the same time. We develop two algorithms based on the multi-graph edge coloring problem: complete decomposition algorithm and the Greedy of maximum degree and weigh match algorithm. They can be used in different circumstances and has better performance, they have better parallelism in the data migration, and consume less time in the process of data migration.
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.
Definition The chromatic index of a graph is the number of colors required to color the edges of the graph in such a way that no two adjacent edges have the same color.
References
Khuller S, Kim Y, Wan Y-C (2003) Algorithms for data migration with cloning. In: 22nd ACM symposium on principles of database systems (PODS), pp 27–36
Anderson E, Hall J, Hartline J, Hobbes M, Karlin A, Saia J, Swaminathan R, Wilkes J An experimental study of data migration algorithms. In: Workshop on algorithm engineering
Zhang C-Q (1997) Integer flows and cycle covers of graphs. Marcel Dekker Inc, New York
Bunke H, Jiang XY, Abegglen K et al (2002) On the weighted mean of a pair of strings. Pattern Anal Appl 5(5):23–30
Golubchik L, Khanna S, Khuller S, Thurimella R, Zhu A (2000) Approximation algorithms for data placement on parallel disks. In: Proceedings of ACM-SIAM SODA, 2000
Miao L, Liu G (2002) Edge covered coloring and fractional edge covered coloring. J Syst Sci Complexing 15(2):187–193
Nakano S-I, Nishizeki T (1994) Edge-coloring problem for graphs. Interdiscip Inf Sci 1(1):19–32
Wu B, Lawless D, Bisbal J, Grimson J, Wade Vincent, Richardson R, O’Sullivan D The mechanisms of DAA and chrysaliser for butterfly methodology. Technical report, Department of Computer Science, Trinity College, Dublin
Liben-Nowell D (2001) Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance. In: Proceedings of ACM-SIAM SODA, pp 177–185
Narayanan D, Thereska E, Donnelly A, Elnikety S, Rowstron A (2009) Migrating server storage to SSDs: analysis of tradeoffs. In: The 4th ACM European conference on computer systems (Eurosys), New York
Verma A, Koller R, Useche L, Rangaswami R (2010) SRC map: energy proportional storage using dynamic consolidation. In: The 8th USENIX conference on File and storage technologies (FAST), San Jose, Feb 2010
Kang S, Park H, Yoo C (2011) Performance enhancement of I/O scheduler for solid state devices.In: IEEE international conference on consumer electronics (ICCE), Jan 2011
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, G., Yang, M., Jing, M. (2013). Two Improved Edge Coloring Algorithms for Data Migration. In: Sun, Z., Deng, Z. (eds) Proceedings of 2013 Chinese Intelligent Automation Conference. Lecture Notes in Electrical Engineering, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38466-0_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-38466-0_86
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38465-3
Online ISBN: 978-3-642-38466-0
eBook Packages: EngineeringEngineering (R0)