Deadline division-based heuristic for cost optimization in workflow scheduling

Information Sciences

Volumn 179, Issue 15, 2009, Pages 2562-2575

  Yuan, Yingchun ^a,b   Li, Xiaoping ^a,c   Wang, Qian ^a,c   Zhu, Xia ^a,c  

^a SOUTHEAST UNIVERSITY   (China)

^b AGRICULTURAL UNIVERSITY OF HEBEI   (China)

^c Ministry of Education   (China)

Author keywords

Cost time tradeoff; Directed acyclic graph; Grid computing; Heuristic; Workflow

Indexed keywords

COST OPTIMIZATIONS; COST/TIME TRADEOFF; CRITICAL ACTIVITIES; CRITICAL PATHS; DIRECTED ACYCLIC GRAPH; FEASIBLE SCHEDULES; HEURISTIC; ITERATIVE PROCEDURES; LOCAL OPTIMIZATIONS; NEAR-OPTIMAL SOLUTIONS; OPTIMAL COSTS; PRECEDENCE CONSTRAINTS; SLACK TIME; TIME WINDOWS; TIME-WINDOW ALLOCATIONS; WORKFLOW; WORKFLOW APPLICATIONS; WORKFLOW SCHEDULING;

COMMUNICATION CHANNELS (INFORMATION THEORY); COSTS; GRID COMPUTING; HEURISTIC METHODS; MANAGEMENT; OPTIMIZATION; PHOTOLITHOGRAPHY; SYSTEMS ENGINEERING; VEHICLE ROUTING; WINDOWS; WIRELESS TELECOMMUNICATION SYSTEMS;

DYNAMIC PROGRAMMING;

ALGORITHMS; COSTS; EXPERIMENTATION; HEURISTIC METHODS; LITHOGRAPHY; MANAGEMENT; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SYSTEMS ENGINEERING; WINDOWS;

EID: 65549099760     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.01.035     Document Type: Article

References (33)

1. Abramson D., Buyya R., and Giddy J. A computational economy for Grid computing and its implementation in the Nimrod-G resource broker. Future Generation Computing Systems (FGCS) 18 8 (2002) 1061-1074
2. Akkan C., Drexl A., and Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165 2 (2005) 339-358
3. Al-Ali R., Hafid A., Rana O., and Walker D. An approach for quality of service adaptation in service-oriented Grids. Concurrency and Computation: Practice and Experience 16 5 (2004) 401-412
4. Al-Ali R., Rana O., Walker D., Jha S., and Sohail S. G-QoSM: Grid service discovery using QoS properties. Computing and Informatics Journal, Special Issue Grid Computing 21 4 (2002) 363-382
5. J. Blythe et al., Task scheduling strategies for workflow-based applications in Grids, in: Proceedings of IEEE International Symposium on Cluster Computing and the Grid, Cardiff, Wales, United Kingdom, 2005, pp. 759-767.
6. Buyya R., Abramson D., Giddy J., and Stockinger H. Economic models for resource management and scheduling in Grid computing. Concurrency and Computation: Practice and Experience Journal (Special Issue on Grid Computing Environments) 14 13-15 (2002) 1507-1542
7. R. Buyya, J. Giddy, D. Abramson, A case for economy Grid architecture for service-oriented Grid computing, in: Proceeding of 10th IEEE Internet Heterogeneous Computing Workshop (HCW 2001), San Francisco, CA, IEEE Computer Society, 2001, pp. 776-790.
8. Cooper K., Dasgupta A., Kennedy K., et al. New Grid scheduling and rescheduling methods in the GrADS Project. Proceedings of NSF Next Generation Software Workshop, International Parallel and Distributed Processing Symposium, Los Alamitos, CA, USA (2004), IEEE CS Press, Berlin 199-206
9. Ďogan A., and Ozguner F. Scheduling independent tasks with QoS requirements in Grid computing with time-varying resource prices. Proceedings of GRID 2002. Lecture Notes in Computer Science vol. 2536 (2002), Springer 58-69
10. De P., Dunne E.J., Ghosh J.B., and Wells C.E. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45 2 (1997) 302-306
11. De P., Dunne E.J., Ghosh J.B., and Wells C.E. The discrete time-cost tradeoff problem revisited. European Journal of Operational Research 81 2 (1995) 225-238
12. Deelman E., et al. Mapping abstract complex workflows onto Grid environments. Journal of Grid Computing 1 1 (2003) 25-39
13. Foster I., and Kesselman C. The Grid: Blueprint for a Future Computing Infrastructure (1999), Morgan Kaufman Publishers, USA
14. Foster I., Kesselman C., Nick J.M., and Tuecke S. Grid service for distributed system integration. IEEE Computer 35 6 (2002) 37-46
15. Foster I., Fidler M., Roy A., Sander V., and Winkler L. End-to-end quality of service for high-end applications. Computing Communication 27 14 (2004) 1375-1388
16. Frey J., Tannenbaum T., et al. Condor-G: a computation management agent for multi-institutional grids. Cluster Computing 5 2 (2002) 237-246
17. Golconda K., and Ozguner F. A comparison of static QoS-based scheduling heuristics for a meta-task with multiple QoS dimensions in heterogeneous computing. Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04), Santa Fe, New Mexico (2004), IEEE Press 106-116
18. X. Gu, K. Nahrstedt, A scalable QoS-aware service aggregation model for peer-to-peer computing Grids, in: Proceeding of the 11th IEEE International Symposium on High Performance Distributed Computing (HPDC), Piscataway, NJ, USA, 2002, pp. 73-82.
19. Jin H., Chen H., Lu Z., and Ning X. QoS Optimizing Model and Solving for Composite Service in CGSP Job Manager. Chinese Journal of Computers 28 4 (2005) 578-588
20. Klein R. Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. European Journal of Operational Research 127 4 (2000) 619-638
21. Li C., and Li L. QoS based resource scheduling by computational economy in computational Grid. Information Processing Letters 98 (2006) 119-126
22. Li C., and Li L. Utility-based QoS optimization strategy for multi-criteria scheduling on the Grid. Journal of Parallel and Distributed Computing 67 2 (2007) 142-153
23. Lin M., and Lin Z. A cost-effective critical path approach for service priority selections in Grid computing economy. Decision Support Systems 42 3 (2006) 1628-1640
24. Menascé D.A. QoS in Grid computing. IEEE Internet Computing 8 4 (2004) 85-87
25. A. O'Brien, S. Newhouse, J. Darlington, Mapping of scientific workflow within the e-Protein project to distributed resources, in: Proceedings of UK e-Science All Hands Meeting, Nottingham, UK, 2004, pp. 404-409.
26. Shi Z., and Dongarra JJ. Scheduling workflow applications on processors with different capabilities. Future Generation Computer Systems 22 6 (2006) 665-675
27. D. Xu, K. Nahrstedt, Finding service paths in a media service proxy network, in: Proceeding of SPIE/ACM Multimedia Computing and Networking Conference (MMCN), California, USA, 2002, pp. 171-185.
28. Yu J., and Buyya R. A novel architecture for realizing grid workflow using tuple spaces. Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, Pittsburgh, USA (2004), IEEE CS Press 119-128
29. Yu J., and Buyya R. A taxonomy of workflow management systems for grid computing. Journal of Grid Computing 3 3-4 (2005) 171-201
30. J. Yu, R. Buyya, C.K. Tham, Cost-based scheduling of workflow applications on utility Grids, in: Proceedings of the First IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia, 2005, pp. 140-147.
31. Yuan Y., Li X., Wang Q., and Zhang Y. Bottom Level based heuristic for scheduling workflows in Grids. Chinese Journal of Computers 31 2 (2008) 283-290
32. Zeng L., Benatallah B., Ngu A.H.H., Dumas M., Kalagnanam J., and Chang H. QoS-aware middleware for web services composition. IEEE Transactions on Software Engineering 30 5 (2004) 311-327
33. Y. Zhao, M. Wilde, I. Foster, J. Voeckler, T. Jordan, E. Quigg, J. Dobson, Grid middleware services for virtual data discovery, composition, and integration, in: Proceeding of the Second Workshop on Middleware for Grid Computing, Toronto, Ontario, Canada, 2004, pp. 57-62.