Scalable Scheduling for Shared Memory Multiprocessors


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 10, pp. 3055-3063, Oct. 2000
10.3745/KIPSTE.2000.7.10.3055,   PDF Download:

Abstract

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiprocessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conflict, and the algorithm uses heuristics to select duplication tasks so as to reduce of a multiprocessors, and generates scheduling according to the available number of processors in a system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.


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, "Scalable Scheduling for Shared Memory Multiprocessors," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 10, pp. 3055-3063, 2000. DOI: 10.3745/KIPSTE.2000.7.10.3055.

[ACM Style]
Oh Han Kang. 2000. Scalable Scheduling for Shared Memory Multiprocessors. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 10, (2000), 3055-3063. DOI: 10.3745/KIPSTE.2000.7.10.3055.