مشاهده مشخصات مقاله
Dynamic Task Scheduling Algorithm with Minimum Communication Cost and Processor Ready Time in Heterogeneous Systems
|
Authors |
-
Hadi Shahriar Shahhoseini
-
Hamidreza Abed Masroorkhah
|
|
Conference |
دوازدهمین کنفرانس بینالمللی سالانه انجمن کامپیوتر ایران |
|
Abstract |
Task scheduling is an NP-complete problem. A large number of heuristic approaches for finding the best
result have been presented in the literatures. Most of the algorithms are proposed for the homogeneous
systems and a few ones can be applied for the heterogeneous systems. In this paper, a synchronous task
scheduling for heterogeneous systems called Dynamic Task Scheduling with Minimum Communication Cost
and Processor Ready Time (DMCR) is proposed. DMCR can obtain exact values of communication cost and
processors ready times by task selection synchronously with machine selection. Using exact values instead of
conjectural values that used in the other scheduling approaches provides better results in heterogeneous
systems. Simulation shows 5-10% improvement comparing HEFT and 12-18% improvement comparing
HCPT. |
|
قیمت |
-
برای اعضای سایت : 100,000 Rial
-
برای دانشجویان عضو انجمن : 20,000 Rial
-
برای اعضای عادی انجمن : 40,000 Rial
|
خرید مقاله
|
|
.gif){kind=icon}