Estimating resource needs for time-constrained workflows

Proceedings - 4th IEEE International Conference on eScience, eScience 2008

Volumn , Issue , 2008, Pages 31-38

  Byun, Eun Kyu ^a   Kee, Yang Suk ^b   Deelman, Ewa ^b   Vahi, Karan ^b   Mehta, Gaurang ^b   Kim, Jin Soo ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c Sungkyunkwan University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING CAPACITIES; COMPUTING ENVIRONMENTS; FINISH TIME; RESOURCE DESCRIPTION LANGUAGES; RESOURCE PROVISIONING; SCIENCE APPLICATIONS; TIME SCHEDULING; VIRTUAL PROCESSORS; WORK FLOW TECHNOLOGIES; WORK-FLOWS;

DISTRIBUTED COMPUTER SYSTEMS; MANAGEMENT;

TURNAROUND TIME;

EID: 62749189203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/eScience.2008.18     Document Type: Conference Paper

References (29)

1. 3Tera - Utility Computing for Web Applications. http://www.3tera.com.
2. Amazon elastic compute cloud (amazon ec2). http://aws.amazon.com/ec2.
3. Linked environments for atmospheric discovery. http://lead.ou.edu/.
4. T. L. Adam et al. A comparison of list schedules for parallel processing systems. Communications of the ACM, 17(12):685-690, 1974.
5. J. Blythe et al. Task scheduling strategies for workflow-based applications in grids. In Proceedings of IEEE International Symposium on Cluster Computing on Grid, 2005.
6. R. Buyya et al. Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm. Software-Practice and Experience, 35:491-512, 2005.
7. E. Deelman et al. Pegasus: a Framework for Mapping Complex Scientific Workflows onto Distributed Systems. Scientific Programming Journal, 13(3):219-237, 2005.
8. F. Dong et al. Scheduling algorithms for grid computing: State of the art and open problems. Technical Report, 2006-504, School of Computing, Queens University, Kingston, Ontario, Jan 2006.
9. A. Geras. A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing, 16(4): 276-291, 1992.
10. Y. Gil et al. Examining the challenges of scientific workflows. IEEE Computer, Dec 2007.
11. R. Huang et al. Automatic Resource Specification Generation for Resource Selection. In Proceedings of ACM/IEEE International Conference on High Performance Computing and Communication (SC'07), 2007.
12. Y.-S. Kee et al. Efficient Resource Description and High Quality Selection for Virtual Grids. In Proceedings of ACM/IEEE International Symposium on Cluster Computing and the Grid (CCGRID'05), 2005.
13. Y.-S. Kee et al. Grid Resource Abstraction, Virtualization, and Provisioning for Time-targeted Applications. In Proceedings of ACM/IEEE International Symposium on Cluster Computing and the Grid (CCGRID'08), 2008.
14. Y. K. Kwok et al. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59(3):381-422, 1999.
15. J. Liou et al. A comparison of general approaches to multiprocessor scheduling. In Proceedings of the 11th International Symposium on Parallel Processing, 1997.
16. H. Magistrale et al. The SCEC Southern California Reference Three-Dimensional Seismic Velocity Model Version 2. Bulletin of the Seismological Society of America, 90:S65-S76, 2000.
17. D. A. Menasce et al. A framework for resource allocation in grid computing. In Proceedings of the 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications System, 2004.
18. M. Rahman et al. A dynamic critical path algorithm for scheduling scientific workflow applications on global grids. In Proceedings of IEEE International Conference on e-Science and Grid Computing, 2007.
19. S. Ranaweera et al. A task duplication based scheduling algorithm for heterogeneous systems. In Proceedings of 14th International Parallel and Distributed Processing Symposium (IPDPS00), 2000.
20. R. Sakellariou et al. A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In Proceedings of the IEEE Heterogeneous Computing Workshop, 2006.
21. G. C. Shih et al. A Compile-Tim Scheduling Heuristics for Interconnection-Constrained Heterogeneous Processor Architecture. Transaction on Parallel and Distributed Systems, 4(2):75-87, 1993.
22. G. Singh et al. Application-level Resource Provisioning on the Grid. In Proceedings of Third IEEE International Conference on e-Science and Grid Computing, 2006.
23. A. Sudarsanam et al. Resource estimation and task scheduling for multithreaded reconfigurable architectures. In Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004.
24. C. Team. The directed acyclic graph manager, 2002. http://www.cs.wisc. edu/condor/dagman.
25. H. Topcuoglu et al. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, 2002.
26. T. Yang et al. DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. on Parallel and Distributed Systems, 5(9):951-967, 1994.
27. J. Yu et al. Cost-based scheduling of Scientific Workflow Applications on Utility Grids. In Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing, 2005.
28. J. Yu et al. Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Scientific Programming Journal, 14(3-4):217-230, 2006.
29. J. Yu et al. Workflow Schdeduling Algorithms for Grid Computing. Grid Computing and Distributed Systems Laboratory, The University of Melbourne, Australia, May 2007. Technical Report, GRIDS-TR-2007-10.