Algorithms for Data Migration with Cloning

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 27-36

  Khuller, Samir ^a,b   Kim, Yoo Ah ^a,c   Wan, Yung Chun ^a,c  

^a UNIVERSITY OF MARYLAND   (United States)

^b Institute for Advanced Computer Studies   (United States)

^c Department of Computer Science ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INFORMATION THEORY; MAGNETIC DISK STORAGE; MULTIMEDIA SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SERVERS; THEOREM PROVING; WORLD WIDE WEB;

DATA MIGRATION;

DATA HANDLING;

EID: 1142299772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773156     Document Type: Conference Paper

References (29)

1. E. Anderson, J. Hall, J. Hartline, M. Hobbes, A. Karlin, J. Saia, R. Swaminathan and J. Wilkes. An Experimental Study of Data Migration Algorithms. Workshop on Algorithm Engineering, pages 145-158, 2001.
2. B. Baker and R. Shostak. Gossips and Telephones. Discrete Mathematics, 2:191-193, 1972.
3. J. Bermond, L. Gargano and S. Perennes. Optimal Sequential Gossiping by Short Messages. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 86:145-155, 1998.
4. J. Bermond, L. Gargano, A. A. Rescigno and U. Vaccaro. Fast gossiping by short messages. International Colloquium on Automata, Languages and Programming, pages 135-146, 1995.
5. J. A. Bondy and U. S. R. Murty. Graph Theory with applications. American Elsevier, New York, 1977.
6. R. T. Bumby. A Problem with Telephones. SIAM Journal on Algebraic and Discrete Methods, 2(1):13-18, March 1981.
7. E. J. Cockayne, A. G. Thomason. Optimal Multi-message Broadcasting in Complete Graphs. Utilitas Mathematica, 18:181-199, 1980.
8. A. M. Farley. Broadcast Time in Communication Networks. SIAM Journal on Applied Mathematics, 39(2):385-390, 1980.
9. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella and A. Zhu. Approximation Algorithms for Data Placement on Parallel Disks. Proc. of ACM-SIAM SODA, pages 223-232, 2000.
10. J. Hall, J. Hartline, A. Karlin, J. Saia and J. Wilkes. On Algorithms for Efficient Data Migration. Proc. of ACM-SIAM SODA, pages 620-629, 2001.
11. A. Hajnal, E. C. Milner and E. Szemeredi. A Cure for the Telephone Disease. Canadian Mathematical Bulletin, 15(3):447-450, 1972.
12. S. M. Hedetniemi, S. T. Hedetniemi and A. Liestman. A Survey of Gossiping and Broadcasting in Communication Networks. Networks, 18:129-134, 1988.
13. I. Holyer. The NP-Completeness of Edge-Coloring. SIAM J. on Computing, 10(4):718-720, 1981.
14. J. Hromkovic and R. Klasing and B. Monien and R. Peine. Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). Combinatorial Network Theory, pages 125-212, D.-Z. Du and D.F. Hsu (Eds.), Kluwer Academic Publishers, Netherlands, 1996.
15. C. A. J. Hurkens. Spreading Gossip Efficiently. Nieuw Archief voor Wiskunde, 5(1):208-210, 2000.
16. S. Kashyap and S. Khuller. Algorithms for Non-Uniform Size Data Placement on Parallel Disks. Technical Report CS-TR-4463, University of Maryland, March 2003.
17. S. Khuller and Y. A. Kim and Y. C. Wan. On Generalized Gossiping and Broadcasting. Manuscript, 2003. http://www.cs.umd.edu/projects/smart/papers/multicast.pdf
18. W. Knodel. New gossips and telephones. Discrete Mathematics, 13:95, 1975.
19. H. M. Lee and G. J. Chang. Set to Set Broadcasting in Communication Networks. Discrete Applied Mathematics, 40:411-421, 1992.
20. D. Liben-Nowell. Gossip is Synteny: Incomplete Gossip and an Exact Algorithm for Syntenic Distance. Proc. of ACM-SIAM SODA, pages 177-185, 2001.
21. T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM J. on Discrete Math., 3:391-410, 1990.
22. D. Richards and A. L. Liestman. Generalizations of Broadcasting and Gossiping. Networks, 18:125-138, 1988.
23. H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, 29:442-467, 2001.
24. H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems. Proc. of Workshop on Approximation Algorithms, pages 238-249, 2000.
25. C.E. Shannon. A theorem on colouring lines of a network. J. Math. Phys., 28:148-151, 1949.
26. S. Shargorodskaya. Implementation of Data Migration Algorithms. http://www.cs.umd.edu/ projects/smart/data-migration/
27. D.B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem Mathematical Programming, A 62, pages 461-474, 1993.
28. R. Tijdeman. On a Telephone Problem. Nieuw Archief voor Wiskunde, 19(3):188-192, 1971.
29. V. G. Vizing. On an estimate of the chromatic class of a p-graph (Russian). Diskret. Analiz. 3:25-30, 1964.