Scheduling grid tasks under uncertain demands

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2008, Pages 2041-2045

  Batista, Daniel M ^a   Drummond, André C ^a   Da Fonseca, Nelson L S ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Fuzzy optimization; Grid networks; Linear programming; Task scheduling; Uncertainty

Indexed keywords

DYNAMIC PROGRAMMING; GRID COMPUTING; LINEARIZATION; MULTITASKING; OPTIMIZATION; PARTICLE SIZE ANALYSIS; SCHEDULING ALGORITHMS;

APPLICATIONS.; DEMAND VALUES; FUZZY OPTIMIZATION; GRID APPLICATIONS; GRID NETWORKS; NUMERICAL RESULTS; TASK SCHEDULING; UNCERTAIN DEMANDS; UNCERTAINTY;

SCHEDULING;

EID: 56749186249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1363686.1364181     Document Type: Conference Paper

References (13)

1. I. Foster. What is the Grid? A Three Point Checklist. GRID Today, 1(6), Jul 2002.
2. Daniel M. Batista, Nelson L. S. da Fonseca, Fabrizio Granelli, and Dzmitry Kliazovich. Self-Adjusting Grid Networks. In Proceedings of the IEEE International Conference on Communications - ICC 2007, Jun 2007.
3. Su-Hui Chiang, Rajesh K. Mansharamani, and Mary K. Vernon. Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies. In SIGMETRICS '94: Proceedings of the 1994 ACM SIGMETRICS Conference on measurement and Modeling of Computer Systems, pages 33-44, New York, NY, USA, 1994. ACM Press.
4. Su-Hui Chiang, Andrea Arpaci-Dusseau, and Mary K. Vernon. The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance. In 8th International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2002), pages 103-127. Springer-Verlag Berlin Heidelberg, 2002.
5. Cynthia Bailey Lee, Yael Schwartzman, Jennifer Hardy, and Allan Snavely. Are User Runtime Estimates Inherently Inaccurate? In 10th International Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2004), pages 253-263. Springer-Verlag Berlin Heidelberg, 2004.
6. Radu Prodan and Thomas Fahringer. Dynamic Scheduling of Scientific Workflow Application on the Grid: a Case Study. In SAC'05: Proceedings of the 2005 A CM Symposium on Applied computing, pages 687-694, New York, NY, USA, 2005. ACM Press.
7. Christos H. Papadimitriou and Kennet Steiglitz. Combinatorial Optimization - Algorithms and Complexity, pages 363-366. Dover Publications, 1998.
8. Daniel M. Batista, Nelson L. S. da Fonseca, and Flavio K. Miyazawa. A Set of Schedulers for Grid Networks. In SAC '07: Proceedings of the 2007 ACM Symposium on Applied Computing, pages 209-213, New York, NY, USA, 2007. ACM Press.
9. Jim Blythe, Sonal Jain, Ewa Deelman, Yolanda Gil, Karan Vahi, Anirban Mandal and Ken Kennedy. Task Scheduling Strategies for Workflow-based Applications in Grids. In IEEE International Symposium on Cluster Computing and Grids (CCGRID'05), volume 2, pages 759-767, May 2005.
10. Fabricio Alves Barbosa da Silva and Isaac D. Scherson. Improving Parallel Job Scheduling Using Runtime Measurements. In IPDPS '00/JSSPP '00: Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, pages 18-38, London, UK, 2000. Springer-Verlag.
11. F. Cime, W.; Berman. A Comprehensive Model of the Supercomputer Workload. In IEEE International Workshop on Workload Characterization (WWC-4), pages 140-148, Dec 2001.
12. R. Real, A. Yamin, L. da Silva, G. Frainer, I. Augustin, J. Barbosa, and C. Geyer. Resource Scheduling on Grid: Handling Uncertainty. In Proceedings of the Fourth International Workshop on Grid Computing, pages 205-207, Nov 2003.
13. Michael Oikonomakos, Kostas Christodoulopoulos, and Emmanouel (Manos) Varvarigos. Profiling Computation Jobs in Grid Systems. In Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGRID 2007), pages 197-204, May 2007.