Bottom level based heuristic for workflow scheduling in grids

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 31, Issue 2, 2008, Pages 282-290

  Yuan, Ying Chun ^a,c   Li, Xiao Ping ^a,b   Wang, Qian ^a,b   Zhang, Yi ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

^c AGRICULTURAL UNIVERSITY OF HEBEI   (China)

Author keywords

Bottom level; Computational grid; Directed acrylic graph; Heuristics; Workflow

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING ALGORITHMS; SYNCHRONIZATION;

COMPUTATIONAL GRID; COST OPTIMIZATION METHOD; DEADLINE BOTTOM LEVEL (DBL); DEADLINE TOP LEVEL (DTL); DIRECTED ACRYLIC GRAPH (DAG); MINIMUM CRITICAL PATH (MCP); WORK FLOW;

GRID COMPUTING;

EID: 40949113549     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/sp.j.1016.2008.00282     Document Type: Article

References (17)

1. Foster I, Kesselman C. The Grid: Blueprint for a Future Computing Infrastructure. USA: Morgan Kaufmann Publishers, 1999
2. Foster I, Kesselman C, Nick J M, Tuecke S. Grid service for distributed system integration. IEEE Computer, 2002, 35(6): 37-46
3. Deelman E, Blythe J et al. Mapping abstract complex workflows onto grid environments. Journal of Grid Computing. 2003, 1(1): 25-39
4. Yu J, Buyya R. Taxonomy of scientific workflow systems for Grid computing. Sigmod Record, 2005, 34(3): 44-49
5. Blythe J, Jain S, Deelman E et al. Task scheduling strategies for workflow-based applications in grids//Proceedings of the IEEE International Symposium on Cluster Computing and Grid. Cardiff, Wales, UK, 2005: 759-767
6. Frey J, Tannenbaum T et al. Condor-G: A computation management agent for multi-institutional grids. Cluster Computing, 2002, 5(3): 237-246
7. De P, Dunne E J, Ghosh J B, Wells C E. The discrete time-cost tradeoff problem revisited. European Journal of Operational Research, 1995, 81(2): 225-238
8. Demeulemeester E, Herroelen W, Elmaghraby S E. Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research, 1996, 88(1): 50-68
9. De P, Dunne E J, Ghosh J B, Wells C E. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research, 1997, 45(2): 302-306
10. Akkan C, Drexl A, Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research, 2005, 165(2): 339-358
11. Buyya R, Abramson D, Giddy J, Slockinger H. Economic models for resource management and scheduling in grid computing. Concurrency and Computation: Practice and Experience Journal (Special Issue on Grid Computing Environments), 2002, 14(13-15): 1507-1542
12. Abramson D, Buyya R, Giddy J. A computational economy for grid computing and its Implementation in the Nimrod-G resource broker. Future Generation Computer Systems (FGCS) Journal, 2002, 18(8): 1061-1074
13. Lin M, Lin Z X. A cost-effective critical path approach for service priority selections in grid computing economy. Decision Support Systems, 2006, 42(3): 1628-1640
14. Yu J, Buyya R, Tham C K. Cost-based Scheduling of workflow applications on utility grids//Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing. Melbourne, Australia: IEEE Press, 2005: 140-147
15. Senkul P, Toroslu H I. An architecture for workflow scheduling under resource allocation constraints. Information Systems, 2005, 30(5): 399-422
16. Zeng L Z, Benatallah B, Ngu A H H, Dumas M, Kalagnanam J, Chang H. QoS-aware middleware for Web services composition. IEEE Transactions on Software Engineering, 2004, 30(5): 311-327
17. Jin Hai, Chen Han-Hua, Lu Zhi-Peng, Ning Xiao-Min. QoS optimizing model and solving for composite service in CGSP job manager. Chinese Journal of Computers, 2005, 28(4): 578-588 (in Chinese)