Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A task duplication based scheduling algorithm for shared memory multiprocessors
- Issue Date
- Jan-2003
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- task scheduling; directed acyclic graph; heuristics; shared memory multiprocessors; task duplication
- Citation
- PARALLEL COMPUTING, v.29, no.1, pp 161 - 166
- Pages
- 6
- Journal Title
- PARALLEL COMPUTING
- Volume
- 29
- Number
- 1
- Start Page
- 161
- End Page
- 166
- ISSN
- 0167-8191
1872-7336
- Abstract
- We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SNIP), 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. (C) 2002 Elsevier Science B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Department of Computer Software Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.