Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
|Material Type:||Internet resource|
|Document Type:||Book, Internet Resource|
|All Authors / Contributors:||
David L Black
|Notes:||"A revised version of this paper appears in the May 1990 issue of IEEE COMPUTER."
|Description:||16 pages : illustrations ; 28 cm.|
|Series Title:||Carnegie-Mellon University.; Computer Science Department.; Research paper|
|Responsibility:||David L. Black.|
Isolating long-term policy in a server yields the advantages of policy-mechanism separation, while avoiding the drawbacks encountered in previous applications of this principle to multiprocessor scheduling. The design and implementation of a processor allocation server for a gang scheduling policy is also described. This article also describes work to support the effective multiprogrammed use of multiprocessors. The approach taken to this problem implements the scheduler in the kernel, but encourages users to provide hints. This allows the scheduler to take advantage of user knowledge without requiring users to implement sophisticated scheduling modules."