Implementation of Scheduling Strategies on PC Clusters


The KIPS Transactions:PartA, Vol. 11, No. 7, pp. 521-528, Dec. 2004
10.3745/KIPSTA.2004.11.7.521,   PDF Download:

Abstract

In this paper, we propose a new task scheduling scheme for bus-based cluster architectures and analyze performance of the scheduling scheme which has been implemented in a PC cluster. The implemented scheme schedules the tasks of a task graph to the processors of a PC cluster, and it reduces parallel execution time by selectively duplicating critical tasks using heuristic. Experimental results show that the proposed scheduling scheme produces better parallel execution time than the other scheduling scheme.


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]
O. H. Kang, H. H. Song, J. S. Chung, "Implementation of Scheduling Strategies on PC Clusters," The KIPS Transactions:PartA, vol. 11, no. 7, pp. 521-528, 2004. DOI: 10.3745/KIPSTA.2004.11.7.521.

[ACM Style]
Oh Han Kang, Hee Heon Song, and Joong Soo Chung. 2004. Implementation of Scheduling Strategies on PC Clusters. The KIPS Transactions:PartA, 11, 7, (2004), 521-528. DOI: 10.3745/KIPSTA.2004.11.7.521.