A data-aware workflow scheduling algorithm for heterogeneous distributed systems

Proceedings of the 2011 International Conference on High Performance Computing and Simulation, HPCS 2011

Volumn , Issue , 2011, Pages 114-120

  Yin, Dengpan ^a   Kosar, Tevfik ^b  

^a Louisiana State University   (United States)

^b the State University of New York   (United States)

Author keywords

Data intensive supercomputing; Grid and cluster computing; Large scale scientific computing; Large scale systems; Workflow scheduling

Indexed keywords

CO-SCHEDULING; COMPUTATION TIME; COMPUTING POWER; DATA INTENSIVE; HETEROGENEOUS DISTRIBUTED SYSTEMS; IMPROVE-A; IMPROVED ALGORITHM; OPTIMAL ALGORITHM; OPTIMAL SCHEDULING; REMOTE DATA; SCHEDULING PROBLEM; TIME EFFICIENCIES; WORKFLOW SCHEDULING;

CLUSTER COMPUTING; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATA TRANSFER; LARGE SCALE SYSTEMS; NATURAL SCIENCES COMPUTING; OPTIMIZATION; TURNAROUND TIME;

SCHEDULING ALGORITHMS;

EID: 80053038167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCSim.2011.5999814     Document Type: Conference Paper

References (12)

1. P. C. Chang and Y. S. Jiang. A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations. European Journal of Operational Research, 77:208-223, 1994.
2. H. C. Chou and C.-P. Chung. Optimal multiprocessor task scheduling using dominance and equivalence relations. Computers & OR, 21(4):463-475, 1994.
3. Y.-K. Kwok and I. Ahmad. On multiprocessor task scheduling using efficient state space search approaches. J. Parallel Distrib. Comput., 65(12):1515-1532, 2005.
4. J.-C. Lin. Optimal task assignment with precedence in distributed computing systems. Inf. Sci., 78(1-2):1-18, 1994.
5. H. W. Y. B. J. B. Meng xu, Lizhen Cui. A data-intensive workflow scheduling algorithm for grid computing.
6. S. V. Mustafizur Rahman and R. Buyya. A dynamic critical path algorithm for scheduling scientific workflow applications on global grids. Proc. Third IEEE International Conference on e-Science and Grid Computing, pages 35-42, 2007.
7. W. neng Chen, S. Member, J. Zhang, and S. Member. An ant colony optimization approach to a grid workflow scheduling problem with various qos requirements.
8. L. Wang, H. J. Siegel, V. P. Roychowdhury, and A. A. Maciejewski. Task matching and scheduling in heterogenous computing environments using a genetic-algorithm-based approach. J. Parallel Distrib. Comput., 47(1):8-22, 1997.
9. L.-L. Wang and W.-H. Tsai. Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search. BIT, 28(1):54-68, 1988.
10. A. S. Wu, H. Yu, S. Jin, K. chi Lin, and G. Schiavone. An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems, 15:824-834, 2004.
11. L. Young, S. Mcgough, S. Newhouse, and J. Darlington. Scheduling architecture and algorithms within the iceni grid middleware. In In UK e-Science All Hands Meeting, pages 5-12, 2003.
12. A. Y. Zomaya, C. Ward, and B. S. Macey. Genetic scheduling for parallel processor systems: Comparative studies and performance issues. IEEE Trans. Parallel Distrib. Syst., 10(8):795-812, 1999.