Evolving toward the perfect schedule: Co-scheduling job assignments and data replication in wide-area systems using a genetic algorithm

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

Volumn 3834 LNCS, Issue , 2006, Pages 173-193

  Phan, Thomas ^a   Ranganathan, Kavitha ^b   Sion, Radu ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REPLICATION; SCHEDULERS; WIDE AREA SYSTEMS;

DATA REDUCTION; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

WIDE AREA NETWORKS;

EID: 33744913008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. L. Adamic. "Zipf, Power-laws, and Pareto - a ranking tutorial, " www.hpl.hp.com/ research/idl/papers/ranking/ranking.html
2. T. Baeck, D. Fogel, and Z. Michalewicz (eds). "Evolutionary Computation 1: Basic Algorithms and Operators," Institute of Physics Publishing, 2000.
3. T. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheswaran, A. Reuther, J. Robertson, M. Theys, B. Yao, D. Hengsen, and R. Freund. "A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems," Journal of Parallel and Distributed Computing, vol. 61, no. 6, June 2001.
4. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman. "Heuristics for Scheduling Parameter Sweep Applications in Grid Environments," In Proceedings of the 9th Heterogeneous Computing Workshop, May 2000.
5. A. Chakrabarti, D. R. A., and S. Sengupta. "Integration of Scheduling and Replication in Data Grids," In Proceedings of the International Conference on High Performance Computing, 2004.
6. L. Davis. "Job Shop Scheduling with Genetic Algorithms," In Proceedings of the International Conference on High Performance Computing, 1985.
7. E. Deelman, T. Kosar, C. Kesselman, and M. Livny. "What Makes Workflows Work in an Opportunistic Environment?" Concurrency and Computation: Practice and Experience, 2004.
8. D. Feitelson. "A Survey of Scheduling in Multiprogrammed Parallel Systems," IBM Research Report RC 19790 (87657), 1994.
9. D. Feitelson, L. Rudolph, and U. Schwiegelshohn. "Parallel Job Scheduling - A Status Report," In Proceedings of the 10th Workshop on Job Scheduling Strategies for Parallel Processing, 2004.
10. The Grid Physics Project, www.griphyn.org
11. K. Holtman. "CMS Requirements for the Grid," In Proceedings of the International Conference on Computing in High Energy and Nuclear Physics, 2001.
12. N. Hu, L. Li, Z. Mao, P. Steenkiste, and J. Wang, "Locating Internet Bottlenecks: Algorithms, Measurements, and Implications," In Proceedings of SIGCOMM, 2004.
13. T. Kosar and M. Livny. "Stork: Making Data Placement a First Class Citizen in the Grid," In Proceedings of IEEE International Conference on Distributed Computing Systems, 2004.
14. D. Lifka. "The ANL/IBM SP Scheduling System," In Job Scheduling Strategies for Parallel Processing, Lecture Notes on Compute Science, Springer-Verlag 1995.
15. Z. Michaelewicz and D. Fogel. How to Solve It: Modern Heuristics, Springer-Verlag, 2000.
16. H. Mohamed and D. Epema. "An Evaluation of the Close-to-Files Processor and Data Co-Allocation Policy in Multiclusters," In Proceedings of the IEEE International Conference on Cluster Computing, 2004.
17. A. Mu'alem and D. Feitelson. "Utilization, Predictability, Workloads,and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling," IEEE Transactions on Parallel and Distributed Systems, June 2001.
18. The Particle Physics Data Grid, www.ppdg.net
19. K. Ranganathan and I. Foster. "Computation Scheduling and Data Replication Algorithms for Data Grids," Grid Resource Management: State of the Art and Future Trends, J. Nabrzyski, J. Schopf, and J. Weglarz, eds. Kluwer Academic Publishers, 2003.
20. V. Ribeiro, R. Riedi, and R. Baraniuk. "Locating Available Bandwidth Bottlenecks," IEEE Internet Computing, September-October 2004.
21. E. Santos-Neto, W. Cirne, F. Brasileiro, and A. Lima. "Exploiting Replication and Data Reuse to Efficiently Schedule Data-Intensive Applications on Grids," In Proceedings of the 10th Workshop on Job Scheduling Strategies for Parallel Processing, 2004.
22. E. Schmueli and D. Feitelson. "Backfilling with Lookahead to Optimize the Packing of Parallel Jobs," Springer-Verlag Lecture Notes in Computer Science, vol. 2862, 2003.
23. H. Stockinger, A. Samar, B. Allcock, I. Foster, K. Holtman, and B. Tierney. "File and Object Replication in Data Grids," In Proceedings of the 10th International Symposium on High Performance Distributed Computing, 2001.
24. D. Thain, J. Bent, A. Arpaci-Dusseau, R. Arpaci-Dusseau, and M. Livny. "Gathering at the Well: Creating Communities for Grid I/O", In Proceedings of Supercomputing, 2001.