کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
425709 685824 2011 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A stochastic scheduling algorithm for precedence constrained tasks on Grid
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
A stochastic scheduling algorithm for precedence constrained tasks on Grid
چکیده انگلیسی

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 (SHEFT) 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 SHEFT scheduling algorithm performs much better than the existing scheduling algorithms in terms of makespan, speedup, and makespan standard deviation.


► This paper formulates a form of stochastic scheduling model.
► This paper proposes a stochastic heterogeneous earliest finish time (SHEFT) scheduling algorithm.
► This paper incorporates the expected value and variance of stochastic processing time into scheduling.
► The comparison studies show that our algorithm has good performance.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 27, Issue 8, October 2011, Pages 1083–1091
نویسندگان
, , , , ,