A throughput maximization strategy for scheduling transaction-intensive workflows on SwinDeW-G

Concurrency and Computation: Practice and Experience

Volumn 20, Issue 15, 2008, Pages 1807-1820

  Liu, Ke ^a,b   Chen, Jinjun ^a   Yang, Yun ^a   Jin, Hai ^b  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

P2p based grid workflow systems; Scheduling algorithms; Transaction intensive workflows

Indexed keywords

QUALITY OF SERVICE; SCHEDULING ALGORITHMS;

DECENTRALIZED WORKFLOW; GRID WORKFLOW SYSTEMS; SCIENTIFIC WORKFLOWS; THROUGHPUT MAXIMIZATION; UTILIZATION RATES; WORK-FLOW SYSTEMS; WORK-FLOWS; WORKFLOW INSTANCES;

SCHEDULING;

EID: 53349109279     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1316     Document Type: Conference Paper

References (24)

1. Yang Y, Liu K, Chen J, Lignier J, Jin H. Peer-to-peer based grid workflow runtime environment of SwinDeW-G. Proceedings of the Third IEEE International Conference on e-Science and Grid Computing (e-ScienceOT), Bangalore, India, December 2007; 51-58.
2. Dong F, Akl SG. Scheduling algorithms for grid computing: State of the art and open problems. Technical Report No. 2006-504, Queen's University, Canada, 2006; 55. Available at: http://www.cs.queensu.ca/TechReports/Reports/ 2006-504.pdf [30 October 2007].
3. Yu J, Buyya R. Workflow scheduling algorithms for grid computing. Technical Report, GRIDS-TR-2007-10, Grid Computing and Distributed Systems Laboratory. The University of Melbourne, Australia, 31 May 2007. Available at: http://gridbus.csse.unimelb.edu.au/reports/ WorkflowSchedulingAlgs2007.pdf [30 October 2007].
4. Fox GC, Gannon D. Workflow in grid systems. Concurrency and Computation: Practice and Experience 2006; 18(10):1009-1019.
5. Braun TD, Siegel HJ, Beck N. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 2001; 61:810-837.
6. Feo TA, Resende MGC. Greedy randomized adaptive search procedures. Journal of Global Optimization 1995; 6:109-133.
7. Ludcher B, Altintas I, Berkley C, Higgins D, Jaeger-Frank E, Jones M, Lee E, Tao J, Zhao Y. Scientific workflow management and the Kepler system. Concurrency and Computation: Practice and Experience 2006; 18(10): 1039-1065.
8. Topcuoglu H, Hariri S, Wu MY. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 2002; 13(3):260-274.
9. Fahringer T, Jugravu A, Pllana S, Prodan R, Slovis C Jr, Truong HL. ASKALON: A tool set for cluster and Grid computing. Concurrency and Computation: Practice and Experience 2005; 17:143-169.
10. Sakellariou R, Zhao H, Tsiakkouri E, Dikaiakos MD. Scheduling workflows with budget constraints. The CoreGRID Workshop on Integrated Research in Grid Computing, Gorlatch S, Danelutto M (eds.). Technical Report TR-05-22, University of Pisa, Dipartimento Di Informatica, Pisa, Italy, November 2005; 347-357.
11. Tannenbaum T, Wright D, Miller K, Livny M. Condor-A distributed job scheduler. Computing with Linux. MIT Press: MA, U.S.A., 2002.
12. Sakellariou R, Zhao H. A hybrid heuristic for DAG scheduling on heterogeneous systems. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04), Santa Fe, New Mexico, U.S.A., April 2004; 111-123.
13. Bajaj R, Agrawal DP. Improving scheduling of tasks in a heterogeneous environment. IEEE Transactions on Parallel and Distributed Systems 2004; 15(2): 107-118.
14. Menasc DA, Casalicchio E. A framework for resource allocation in Grid computing. Proceedings of the 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'04), Volendam, The Netherlands, 2004; 259-267.
15. Yu J, Buyya R, Tham CK. A cost-based scheduling of scientific workflow applications on utility grids. Proceedings of the First IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia, December 2005; 140-147.
16. Dogan A, Özgüner F. Genetic algorithm based scheduling of meta-tasks with stochastic execution times in heterogeneous computing systems. Cluster Computing, vol. 7. Kluwer Academic Publishers: Netherlands, 2004; 177-190.
17. Yu J, Buyya R. A novel architecture for realizing Grid workflow using tuple spaces. Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing (Grid 2004). Pittsburgh, U.S.A. IEEE Computer Society Press: Los Alamitos, CA, U.S.A., November 2004; 119-128.
18. He L, Jarvis SA, Spooner DP, Bacigalupo D, Tan G, Nudd GR. Mapping DAG-based applications to multiclusters with background workload. Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05), May 2005; 855-862.
19. Yang L, Schopf JM, Foster I. Conservative scheduling: Using predicted variance to improve scheduling decisions in dynamic environments. Proceedings of the ACM/IEEE SuperComputing Conference, Phoenix, Arizona, U.S.A., November 2003; 31-46.
20. Jin H, Shi X, Qiang W, Zou D. An adaptive meta-scheduler for data-intensive applications. International Journal of Grid and Utility Computing 2005; 1(1):32-37.
21. Sakellariou R, Zhao H, Tsiakkouri E, Dikaiakos M. Scheduling workflows with budget constraints. The CoreGRID Workshop on Integrated Research in Grid Computing, Gorlatch S, Danelutto M (eds.). Technical Report TR-05-22, University of Pisa, Dipartimento Di Informatica, Pisa, Italy, November 2005; 347-357.
22. Sun X, Wu M. Grid harvest service: A system for long-term application-level task scheduling. Proceedings of 2003 International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France, April 2003; 25-32.
23. Chen J, Yang Y. Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in Grid workflow systems. ACM Transactions on Autonomous and Adaptive Systems 2007; 2(2).
24. CROWN Team 2006. CROWN Portal, http://www.crown.org.cn/en/ [30 October 2007].