Improved algorithms for data migration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 164-175

  Khuller, Samir ^a   Kim, Yoo Ah ^b   Malekian, Azarakhsh ^a  

^a Institute of Advanced Computer Science   (United States)

^b University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; PROBLEM SOLVING;

DATA MIGRATION PROBLEM; FULL DUPLEX COMMUNICATION; HALF-DUPLEX COMMUNICATION;

ALGORITHMS;

EID: 33750050812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_17     Document Type: Conference Paper

References (20)

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, London, UK, 2001. Springer-Verlag
2. G. Aggarwal, R. Motwani and A. Zhu. The load rebalancing problem. Symp. on Parallel Algorithms and Architectures, pages 258-265, (2003).
3. I. D. Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. Proc. of ACM-SIAM SODA, pp. 661-670, 2001.
4. S. Khuller, Y.A. Kim and Y.C. Wan. Algorithms for Data Migration with Cloning, Siam J. on Comput., Vol. 33, No. 2, pp. 448-461,Feb. 2004.
5. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. American Elsevier, New York, 1977.
6. R. Gandhi and J. Mestre. Combinatorial algorithms for Data Migration to minimize the average completion time. APPROX (2006) (to appear).
7. 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 661-670, Washington, D.C., USA, 2000. Society of Industrial and Applied Mathematics.
8. L. Golubchik, S. Khuller, Y. Kim, S. Shargorodskaya and Y. C. Wan. Data migration on parallel disks. Proc. of European Symp. on Algorithms (2004). LNCS 3221, pages 689-701. Springer. To appear in Special Issue of Algorithmica from ESA 2004.
9. S. Guha and K. Munagala. Improved algorithms for the data placement problem, 2002. Proc. of ACM-SIAM SODA, pages 106-107, San Fransisco, CA, USA, 2002. Society of Industrial and Applied Mathematics.
10. J. Hall, J. Hartline, A. Karlin, J. Saia and J. Wilkes. On Algorithms for Efficient Data Migration. Proc. of ACM-SIAM SODA, pp. 620-629, 2001.
11. S. Kashyap and S. Khuller. Algorithms for Non-Uniform Size Data Placement on Parallel Disks. Conference on FST&TCS Conference, LNCS 2914, pp. 265-276, 2003. Full version to appear in Journal of Algorithms (2006).
12. S. Kashyap, S. Khuller, Y. C. Wan and L. Golubchik. Fast reconfiguration of data placement in parallel disks. 2006 ALENEX Conference, Jan 2006.
13. S. Khuller, Y. Kim and Y. C. Wan. On Generalized Gossiping and Broadcasting. ESA Conference, pages 373-384, Budapest, Hungary, 2003. Springer.
14. Y. Kim. Data Migration to minimize the average completion time. Proc. of ACM-SIAM SODA, pp. 97-98, 2003.
15. A. Meyerson, K. Munagala, and S. A. Plotkin. Web caching using access statistics. In Symposium on Discrete Algorithms, pages 354-363, 2001.
16. H. Shachnai and T. Tamir. On Two Class-constrained Versions of the Multiple Knapsack Problem. Algorithmica, 29:442-467, 2001.
17. H. Shachnai and T. Tamir. Polynomial Time Approximation Schemes for Class-constrained Packing Problems. Workshop on Approximation Algorithms, LNCS 1913, pp. 238-249, 2000.
18. C.E. Shannon. A Theorem on Colouring Lines of a Network. J. Math. Phys., 28:148-151, 1949.
19. D.B. Shmoys and E. Tardos. An Aproximation Algorithm for the Generalized Assignment Problem. Mathematical Programming, A 62, pp. 461-474, 1993.
20. V. G. Vizing. On an Estimate of the Chromatic Class of a p-graph (Russian). Diskret. Analiz. 3:25-30, 1964.