Name
Abstract | ||
|---|---|---|
We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performance of the S2MP algorithm has been observed by comparing the schedule length under various number of processors and the ratio of communication to computation cost. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0167-8191(02)00181-3 | Parallel Computing |
Keywords | Field | DocType |
shared memory multiprocessors,task scheduling,heuristics,various number,schedule length,directed acyclic graph,s2mp algorithm,task duplication,scheduling algorithm | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Distributed shared memory,Earliest deadline first scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
29 | 1 | Parallel Computing |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oh-han Kang | 1 | 18 | 4.02 |
| Si-Gwan Kim | 2 | 3 | 1.10 |