An experimental study of data migration algorithms

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

Volumn 2141 LNCS, Issue , 2001, Pages 145-158

  Anderson, Eric ^a   Hall, Joe ^b   Hartline, Jason ^b   Hobbs, Michael ^a   Karlin, Anna R ^b   Saia, Jared ^b   Swaminathan, Ram ^a   Wilkes, John ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MIGRATION; DATA OBJECTS; EXPERIMENTAL STUDIES; LOAD-BALANCING; THEORETICAL BOUNDS; USAGE PATTERNS; FIXED SIZE; THEORETICAL GUARANTEES;

OPERATIONS RESEARCH; NETWORK MANAGEMENT;

ALGORITHMS;

EID: 78650741411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44688-5_12     Document Type: Conference Paper

References (11)

1. E. Anderson, J. Hall, J. Hartline, M. Hobbs, A. Karlin, J. Saia, R. Swaminathan, and J. Wilkes. An Experimental Study of Data Migration Algorithms. Technical report, University of Washington, 2001.
2. E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: running circles around storage administration. Submitted to Symposium on Operating System Principles, 2001.
3. E. Borowsky, R. Golding, A. Merchant, L. Schreier, E. Shriver, M. Spasojevic, and J. Wilkes. Using attribute-managed storage to achieve QoS. In 5th Intl. Workshop on Quality of Service, Columbia Univ., New York, June 1997.
4. Transaction Processing Performance Council. TPC Benchmark D (Decision Support) Standard Specification Revision 2.1. 1996.
5. B. Gavish and O. R. Liu Sheng. Dynamic file migration in distributed computer systems. Communications of the ACM, 33:177-189, 1990.
6. I. Golubchik, S. Khuller S. Khanna, R. Thurimella, and A. Zhu. Approximation Algorithms for Data Placement on Parallel Disks. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete ALgorithms, pages 223-232, 2000.
7. J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes. On algorithms for efficient data migration. In 12th annual ACM-SIAM Symposium on Discrete Algorithms, 2001.
8. S. Micali and V. Vazirani. An O(√|V ||E|) algorithm for finding a maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science, 1980.
9. T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring ofm ultigraphs. In SIAM Journal on Discrete Mathematics, volume 3, pages 391-410, 1990.
10. J. Saia. Data Migration with Edge Capacities and Machine Speeds. Technical report, University of Washington, 2001.
11. J. Wolf. The Placement Optimization Problem: a practical solution to the disk file assignment problem. In Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 1-10, 1989.