Comparative Study on Static Task Scheduling Algorithms in Global Heterogeneous Environment


The KIPS Transactions:PartA, Vol. 13, No. 2, pp. 163-170, Apr. 2006
10.3745/KIPSTA.2006.13.2.163,   PDF Download:

Abstract

Most scheduling problems including DAG(Directed Acyclic Graph)-based are known to be NP-complete, so many heuristic-based scheduling algorithms have been researched. HEFT and CPOP are such algorithms which have been devised to be effective in heterogeneous environment. We proposed, in the previous research, three scheduling algorithms which are effective in realistic global heterogeneous environment: CPOC, eCPOPC and eCPOP. In this paper, the heuristics which are used in the above five algorithms will be systematically analyzed. Those algorithms will be also studied experimentally using various benchmarks. Experimental results show that the eCPOC generates better schedules than any other algorithms and the heuristics which are used in the proposed algorithms are effective in the global heterogeneous environment.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Kim, "Comparative Study on Static Task Scheduling Algorithms in Global Heterogeneous Environment," The KIPS Transactions:PartA, vol. 13, no. 2, pp. 163-170, 2006. DOI: 10.3745/KIPSTA.2006.13.2.163.

[ACM Style]
Jung Hwan Kim. 2006. Comparative Study on Static Task Scheduling Algorithms in Global Heterogeneous Environment. The KIPS Transactions:PartA, 13, 2, (2006), 163-170. DOI: 10.3745/KIPSTA.2006.13.2.163.