An Efficient Duplication Based Scheduling Algorithm for Parallel Processing Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 8, pp. 2050-2059, Aug. 1999
10.3745/KIPSTE.1999.6.8.2050,   PDF Download:

Abstract

Multiprocessor scheduling problem has been an important research area for the past decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. This paper classifies DBS algorithms into two categories according to the task duplication method used. The paper then presents a new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. The simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with similar time complexity.


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]
P. G. Leen and C. H. Seung, "An Efficient Duplication Based Scheduling Algorithm for Parallel Processing Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 8, pp. 2050-2059, 1999. DOI: 10.3745/KIPSTE.1999.6.8.2050.

[ACM Style]
Park Gyung Leen and Choo Hyun Seung. 1999. An Efficient Duplication Based Scheduling Algorithm for Parallel Processing Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 8, (1999), 2050-2059. DOI: 10.3745/KIPSTE.1999.6.8.2050.