Critical path-based iterative heuristic for workflow scheduling in utility and cloud computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8274 LNCS, Issue , 2013, Pages 207-221

  Cai, Zhicheng ^a   Li, Xiaoping ^a   Gupta, Jatinder N D ^b  

^a SOUTHEAST UNIVERSITY   (China)

^b UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Cloud computing; critical path; dynamic programming; multi stage decision process; utility computing; workflow scheduling

Indexed keywords

CRITICAL PATHS; MIXED INTEGER PROGRAMMING; MULTI-STAGE DECISION PROCESS; PARTIAL CRITICAL PATH; PRECEDENCE CONSTRAINTS; STATE-OF-THE-ART ALGORITHMS; UTILITY COMPUTING; WORKFLOW SCHEDULING;

CLOUD COMPUTING; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING;

ITERATIVE METHODS;

EID: 84892399375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-45005-1_15     Document Type: Conference Paper

References (15)

1. Chard, K., Bubendorfer, K.: High performance resource allocation strategies for computational economies. IEEE Transactions on Parallel and Distributed Systems 24(1), 72-84 (2013)
2. Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR) 31(4), 406-471 (1999)
3. Bajaj, R., Agrawal, D.P.: Improving scheduling of tasks in a heterogeneous environment. IEEE Transactions on Parallel and Distributed Systems 15(2), 107-118 (2004)
4. Byun, E.K., Kee, Y.S., Kim, J.S., Deelman, E., Maeng, S.: Bts: Resource capacity estimate for time-targeted science workflows. Journal of Parallel and Distributed Computing 71(6), 848-862 (2011)
5. De, P., Dunne, E., Ghosh, J., Wells, C.: Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45(2), 302-306 (1997)
6. Yu, J., Buyya, R., Tham, C.: Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing, p. 8. IEEE (2005)
7. Yuan, Y., Li, X., Wang, Q., Zhu, X.: Deadline division-based heuristic for cost optimization in workflow scheduling. Information Sciences 179(15), 2562-2575 (2009)
8. Abrishami, S., Naghibzadeh, M., Epema, D.: Cost-driven scheduling of grid workflows using partial critical paths. IEEE Transactions on Parallel and Distributed Systems 23(8), 1400-1414 (2012)
9. Yu, J., Buyya, R.: Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Scientific Programming 14(3), 217-230 (2006)
10. Chen, W.N., Zhang, J.: An ant colony optimization approach to a grid workflow scheduling problem with various qos requirements. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 39(1), 29-43 (2009)
11. Wu, Z., Liu, X., Ni, Z., Yuan, D., Yang, Y.: A market-oriented hierarchical scheduling strategy in cloud workflow systems. The Journal of Supercomputing 63(1), 256-293 (2013)
12. Abrishami, S., Naghibzadeh, M., Epema, D.: Deadline-constrained workflow scheduling algorithms for iaas clouds. In: Future Generation Computer Systems (2012)
13. Demeulemeester, E., Vanhoucke, M., Herroelen, W.: Rangen: A random network generator for activity-on-the-node networks. Journal of Scheduling 6(1), 17-38 (2003)
14. Akkan, C., Drexl, A., Kimms, A.: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research 165(2), 339-358 (2005)
15. Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41(10), 1693-1703 (1995)