Adaptive workflow scheduling for dynamic grid and cloud computing environment

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 13, 2013, Pages 1816-1842

  Rahman, Mustafizur ^a   Hassan, Rafiul ^b   Ranjan, Rajiv ^c   Buyya, Rajkumar ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^c CSIRO   (Australia)

Author keywords

adaptive scheduling; grid computing; workflow management

Indexed keywords

GRAPH ALGORITHMS; GRID COMPUTING; WORK SIMPLIFICATION;

ADAPTIVE SCHEDULING; DYNAMIC CRITICAL PATHS; HYBRID HEURISTICS; PERFORMANCE DEGRADATION; PERFORMANCE-DRIVEN; SCHEDULING TECHNIQUES; WORKFLOW MANAGEMENTS; WORKFLOW SCHEDULING;

SCHEDULING;

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

References (24)

1. Laity AC, Anagnostou N, Berriman GB, Good JC, Jacob JC, Katz DS, Prince T,. Montage: an astronomical image mosaic service for the nvo. In Proceedings of the 14th Annual Conference on Astronomical Data Analysis Software and Systems (ADASS'XIV), USA, October, 2004.
2. Blaha P, Schwarz K, Madsen G, Kvasnicka D, Luitz J,. Wien2k-an augmented plane wave plus local orbitals program for calculating crystal properties. Technical Report, Vienna University of Technology, Austria, 2001.
3. Yu J, Buyya R,. Taxonomy of workflow management systems for grid computing. Journal of Grid Computing 2005; 3 (3-4): 171-200. (Pubitemid 43280301)
4. Yu J, Buyya R, Ramamohanarao K,. Workflow Scheduling Algorithms for Grid Computing, Metaheuristics for Scheduling in Distributed Computing Environments, Xhafa F, and, Abraham A, (eds.) Springer: Germany, 2008.
5. Kim S, Browne J,. A general approach to mapping of parallel computation upon multiprocessor architectures. In Proceedings of the 27th IEEE International Conference on Parallel Processing (ICPP'98), USA, August, 1988.
6. Kwok Y, Ahmad I,. Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1996; 5 (7): 506-521. (Pubitemid 126782383)
7. Garey MR, Johnson DS,. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.: USA, 1990.
8. Wieczorek M, Prodan R, Fahringer T,. Scheduling of scientific workflows in the ASKALON grid enviornment. ACM SIGMOD Record 2005; 34 (3): 56-62. (Pubitemid 43152533)
9. The directed acyclic graph manager, condor project. (Available from: http://www.cs.wisc.edu/condor/dagman/) [Accessed on 18 August 2012].
10. Maheswaran M, Ali S, Siegel HJ, Hensgen D, Freund R,. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In Proceedings of the 8th Heterogeneous Computing Workshop (HCW'99), Puerto Rico, April, 1999.
11. Blythe J, Jain S, Deelman E, Gil A, Vahi K,. Task scheduling strategies for workflow-based applications in grids. In Proceedings of the 5th IEEE International Symposium on Cluster Computing and the Grid (CCGRID'05), UK, May, 2005.
12. Mandal A, et al,. Scheduling strategies for mapping application workflows onto the grid. In Proceedings of the 14th IEEE International Symposium on High Performance Distributed Computing (HPDC'05), USA, July, 2005.
13. 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. (Pubitemid 34448780)
14. Fahringer T, Jugravu A, Pllana S, Prodan R, Seragiotto C, Truong HL,. ASKALON: a tool set for cluster and grid computing. Concurrency and Computation: Practice and Experience 2005; 17 (2-4): 143-169. (Pubitemid 40285773)
15. Goldberg DE,. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley: USA, 1989.
16. Yu J, Buyya R,. A budget constrained scheduling of workflow applications on utility grids using genetic algorithms. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC'06), France, June, 2006.
17. Foster I, Kesselman C, (eds). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers: USA, 1999.
18. Buyya R, Murshed M,. Gridsim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurrency and Computation: Practice and Experience 2002; 14 (13-15): 1175-1220.
19. Sulzer S, Kinzelbach W, Rutschmann P,. Flood Discharge Prediction using 2D Inverse Modelling. ASCE Journal of Hydraulic Engineering 2002; 128 (1): 46-54. (Pubitemid 34133374)
20. Bell WH, Cameron DG, Capozza L, Millar AP, Stockinger K, Zini F,. Simulation of dynamic grid replication strategies in optorsim. In Proceedings of the 3rd IEEE/ACM International Workshop on Grid Computing (GRID'02), November, 2002.
21. Venugopal S, Buyya R,. A set coverage-based mapping heuristic for scheduling distributed data-intensive applications on global grids. In Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (GRID'06), Spain, September, 2006.
22. Buyya R, Yeo CS, Venugopal S, Broberg J, Brandic I,. Cloud computing and emerging it platforms: vision, hype, and reality for delivering computing as the 5th utility. Future Generation Computer Systems 2009; 25 (6): 599-616.
23. Pandey S, Wu L, Guru S, Buyya R,. A particle swarm optimization (pso)-based heuristic for scheduling workflow applications in cloud computing environments. In Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications (AINA'10), Australia, April, 2010.
24. Wu Z, Liu X, Ni Z, Yuan D, Yang Y,. A market-oriented hierarchical scheduling strategy in cloud workflow systems. Journal of Supercomputing 2013; 63 (1): 256-293.