A scheduling strategy for shared memory multiprocessors

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator George, Lal
Title A scheduling strategy for shared memory multiprocessors
Date 1990
Description An efficient scheduling strategy for shared memory multiprocessors is described. The rapid dissemination of tasks to available procesors and ready queues is crucial to the performance of any parallel system. Such overheads determine the attainable speedup and performance of the system. Poor techniques used to address this can lead to severe degradation in performance particulary with high processor counts. This work has been conducted in the context of a parallel functional language-CoF, where the parallelism is usually fine grained and the efficient assignment of tasks to processors even more important. In such systems, observing strict queue semantics (i.e., FIFO) is not essesntial. This allows for very efficient algorithms such as that described here. On the BBN GP1000, our technique was superior in performance to the centralized queue and has the potential of performing well on a fully configured GP1000.
Type Text
Publisher University of Utah
First Page 1
Last Page 11
Subject Shared memory multiprocessors
Subject LCSH Multiprocessors; Distributed shared memory
Language eng
Bibliographic Citation George, L. (1990). A scheduling strategy for shared memory multiprocessors. 1-11. UUCS-90-002.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,403,005 bytes
Identifier ir-main,16345
ARK ark:/87278/s6qj81j5
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2021-05-06
ID 704168
Reference URL https://collections.lib.utah.edu/ark:/87278/s6qj81j5
Back to Search Results