Fast reconfiguration of data placement in parallel disks

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 95-107

  Kashyap, Srinivas ^a   Khuller, Samir ^a,d   Wan, Yung Chun ^b   Golubchik, Leana ^c  

^a Institute of Advanced Computer Science   (United States)

^b GOOGLE INC   (United States)

^c University of Southern California   (United States)

^d UMIACS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646827360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.10     Document Type: Conference Paper

References (13)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
2. Eric Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, and John Wilkes. An experimental study of data migration algorithms. In WAE '01: Proceedings of the 5th International Workshop on Algorithm Engineering, pages 145-158, London, UK, 2001. Springer-Verlag.
3. Ann Louise Chervenak. Tertiary storage: an evaluation of new applications. PhD thesis, Berkeley, CA, USA, 1994.
4. Shahram Ghandeharizadeh and Richard Muntz. Design and implementation of scalable continuous media servers. Parallel Comput., 24(1):91-122, 1998.
5. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 223-232, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics.
6. L. Golubchik, S. Khuller, Y. Kim, S. Shargorodskaya, and Y-C. Wan. Data migration on parallel disks. In Proc. of European Symp. on Algorithms (2004). LNCS 3221, pages 689-701. Springer, 2004.
7. Joseph Hall, Jason Hartline, Anna R. Karlin, Jared Saia, and John Wilkes. On algorithms for efficient data migration. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 620-629, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
8. J. Jung, B. Krishnamurthy, and M. Rabinovich. Flash crowds and denial of service attacks: Characterization and implications for cdns and web sites, 2002.
9. Samir Khuller, Yoo-Ah Kim, and Yung-Chun (Justin) Wan. Algorithms for data migration with cloning. In PODS '09: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 27-36, New York, NY, USA, 2003. ACM Press.
10. How much information? School of Information Management and Systems. University of California at Berkeley. http://www.sims.berkeley.edu/research/ projects/howmuch-info2003/.
11. H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems. In Proceedings of Workshop on Approximation Algorithms (APPROX). LNCS 1913, pages 238-249. Springer-Verlag, 2000.
12. H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, 29(3):442-467, 2001.
13. Introduction to Storage Area Networks. IBM Redbook. http://www.redbooks. ibm.com/.