Scheduling multiple parameter sweep workflow instances on the grid

e-Science 2009 - 5th IEEE International Conference on e-Science

Volumn , Issue , 2009, Pages 300-306

  Smanchat, Sucha ^a   Indrawan, Maria ^a   Ling, Sea ^a   Enticott, Colin ^a   Abramson, David ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Grid workflow; Parameter sweep; Resource competition; Workflow scheduling

Indexed keywords

E-SCIENCE; GRID WORKFLOW; GRID WORKFLOWS; HIGH-PERFORMANCE COMPUTING; MULTIPLE INSTANCES; MULTIPLE PARAMETERS; PARALLEL EXECUTIONS; PARAMETER SWEEPING; SCHEDULING PROCESS; SCIENTIFIC SERVICE; WORKFLOW SCHEDULING; WORKFLOW TECHNOLOGY;

AUTOMATION; COMPETITION; GRID COMPUTING; SCHEDULING ALGORITHMS;

MANAGEMENT;

EID: 77949848881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/e-Science.2009.49     Document Type: Conference Paper

References (22)

1. B. Ludäscher, I. Altintas, C. Berkley, D. Higgins, E. Jaeger, M. Jones, E. A. Lee, J. Tao, and Y. Zhao, "Scientific workflow management and the Kepler system," Concurr. Comput. : Pract. Exper., vol. 18, pp. 1039-1065, 2006.
2. J. Zhang, D. Pennington, and W. Michener, "Using web services and scientific workflow for species distribution prediction modeling," in Advances in Web-Age Information Management, 2005, pp. 610-617.
3. Z. Jianting, "Ontology-driven composition and validation of scientific grid workflows in Kepler: a case study of hyperspectral image processing," in Proceedings of the 5th International Conference on Grid and Cooperative Computing Workshops (GCCW '06), 2006, pp. 282-289.
4. H. Topcuoglu, S. Hariri, and W. Min-You, "Performance-effective and low-complexity task scheduling for heterogeneous computing," IEEE Transactions on Parallel and Distributed Systems, vol. 13, pp. 260-274, 2002.
5. J. Yu, R. Buyya, and K. Ramamohanarao, "Workflow scheduling algorithms for grid computing," in Metaheuristics for Scheduling in Distributed Computing Environments, 2008, pp. 173-214.
6. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, "Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems," in Proceedings of the 8th Heterogeneous Computing Workshop (HCW '99), 1999, pp. 30-44.
7. M. Wieczorek, A. Hoheisel, and R. Prodan, "Taxonomies of the multi-criteria grid workflow scheduling problem," in Grid Middleware and Services, 2008, pp. 237-264.
8. E. Deelman, G. Singh, M.-H. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, G. B. Berriman, J. Good, A. Laity, J. C. Jacob, and D. S. Katz, "Pegasus: A framework for mapping complex scientific workflows onto distributed systems," Sci. Program., vol. 13, pp. 219-237, 2005.
9. Y. Gil, E. Deelman, M. Ellisman, T. Fahringer, G. Fox, D. Gannon, C. Goble, M. Livny, L. Moreau, and J. Myers, "Examining the challenges of scientific workflows," Computer, vol. 40, pp. 24-32, 2007.
10. J. Yu and R. Buyya, "A taxonomy of scientific workflow systems for grid computing," SIGMOD Rec., vol. 34, pp. 44-49, 2005.
11. D. Abramson, C. Enticott, and I. Altintas, "Nimrod/K: towards massively parallel dynamic grid workflows," in Proceedings of the 2008 ACM/IEEE conference on Supercomputing. Austin, Texas: IEEE Press, 2008.
12. Nimrod Toolkit, http://messagelab.monash.edu.au/Nimrod, Accessed July, 2009.
13. S. Ayyub, D. Abramson, C. Enticott, S. Garic, and J. Tan, "Executing large parameter sweep applications on a multi-VO testbed," in Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007): IEEE Computer Society, 2007, pp. 73-80.
14. T. C. Peachey, N. T. Diamond, D. A. Abramson, W. Sudholt, A. Michailova, and S. Amirriazi, "Fractional factorial design for parameter sweep experiments using Nimrod/E," Journal of Scientific Programming, vol. 16, pp. 217-230, 2008.
15. B. Bethwaite, D. Abramson, and A. Buckle, "Grid interoperability: an experiment in bridging grid islands," in Proceedings of the 2008 4th IEEE International Conference on eScience: IEEE Computer Society, 2008.
16. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, "Heuristics for scheduling parameter sweep applications in grid environments," in Proceedings of the 9th Heterogeneous Computing Workshop (HCW 2000) 2000, pp. 349-363.
17. X. He, X. Sun, and G. v. Laszewski, "QoS guided min-min heuristic for grid task scheduling," J. Comput. Sci. Technol., vol. 18, pp. 442-451, 2003.
18. K. Etminani and M. Naghibzadeh, "A Min-Min Max-Min selective algorihtm for grid task scheduling," in Proceedings of the 3rd IEEE/IFIP International Conference in Central Asia on Internet (ICI 2007), 2007, pp. 1-7.
19. K. Liu, J. Chen, H. Jin, and Y. Yang, "A Min-Min average algorithm for scheduling transaction-intensive grid workflows," in Proceedings of the 7th Australasian Symposium on Grid Computing and e-Research (AusGrid 2009). Wellington, New Zealand: Australian Computer Society, Inc., 2009, pp. 41-48.
20. R. Sakellariou and H. Zhao, "A hybrid heuristic for DAG scheduling on heterogeneous systems," in Proceedings of the 18th International Conference on Parallel and Distributed Processing Symposium, 2004, pp. 111.
21. Z. Shi and J. J. Dongarra, "Scheduling workflow applications on processors with different capabilities," Future Gener. Comput. Syst., vol. 22, pp. 665-675, 2006.
22. D. Kondo, A. A. Chien, and H. Casanova, "Scheduling task parallel applications for rapid application turnaround on enterprise desktop grids," Journal of Grid Computing, vol. 5, pp. 379-405, 2007.