Journal
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE
Volume 27, Issue 8, Pages 1083-1091Publisher
ELSEVIER
DOI: 10.1016/j.future.2011.04.007
Keywords
Stochastic scheduling; Grid; Precedence constrained tasks; Makespan
Categories
Funding
- National Natural Science Foundation of China [61070057]
- Cultivation Fund of the Key Scientific and Technical Innovation Project
- Ministry of Education of China [708066]
- Hunan provincial Science and Technology important Projects [2010FJ1006]
- Hunan Provincial Innovation Foundation For Postgraduate [CX2010B139]
- Hunan Provincial Education Department [08C435]
Ask authors/readers for more resources
This paper addresses the problems in scheduling a precedence constrained tasks of parallel application with random tasks processing time and edges communication time on Grid computing systems so as to minimize the makespan in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. The problem is first formulated in a form of stochastic scheduling model on Grid systems. Then, a stochastic heterogeneous earliest finish time (SHEET) scheduling algorithm is developed that incorporates the expected value and variance of stochastic processing time into scheduling. Our rigorous performance evaluation study, based on randomly generated stochastic parallel application DAG graphs, shows that our proposed SHEET scheduling algorithm performs much better than the existing scheduling algorithms in terms of makespan, speedup, and makespan standard deviation. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available