skip to content
Scheduling and resource management techniques for multiprocessors Preview this item
ClosePreview this item
Checking...

Scheduling and resource management techniques for multiprocessors

Author: David L Black
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, 1990.
Dissertation: Ph. D. Carnegie Mellon University 1990.
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-90-152.
Edition/Format:   Thesis/dissertation : Thesis/dissertation : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "This thesis describes research in the design and implementation of multiprocessor resource management and related areas. Application requirements motivated the major research areas, processor scheduling and non-uniform memory management, as these areas contain the most important problems raised by the changing design and use of multiprocessors. A variety of processor scheduling problems are addressed by
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Thesis/dissertation
Document Type: Book
All Authors / Contributors: David L Black
OCLC Number: 22716161
Notes: "July 1990."
Description: vi, 111 pages : illustrations ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-90-152.
Responsibility: David L. Black.

Abstract:

Abstract: "This thesis describes research in the design and implementation of multiprocessor resource management and related areas. Application requirements motivated the major research areas, processor scheduling and non-uniform memory management, as these areas contain the most important problems raised by the changing design and use of multiprocessors. A variety of processor scheduling problems are addressed by this work. A major contribution is the design and implementation of a processor allocation and control facility for the Mach operating system that allows processors to be dedicated to applications. The implementation of this facility has been validated by production use, and it is one of the first successful applications of policy-mechanism separation to multiprocessor scheduling (and, in particular, to the problem of dividing a multiprocessor among competing applications).

The techniques of Discouragement and Handoff Scheduling are introduced to address the communication and synchronization problems of applications with more active entities than processors. Support for timesharing has been preserved by integrating the new features into the Mach timesharing scheduler. In the process, it was necessary to redesign the scheduler from scratch, and a number of lessons were learned about the design and implementation of timesharing schedulers, including how to collect accurate processor usage imformation based on timestamps instead of interrupt-driven sampling. The non-uniform memory management research takes a different approach, predicated on obtaining more information from hardware. Current implementations of non-uniform memory management are restricted by the available reference information.

Hardware reference and modification bits indicate only that a page was referenced or modified at least once sometime in the past; they do not indicate how many references were made or how long ago. If more reference information were available, more sophisticated (and hopefully better) management techniques would be possible. This research assumes that any desired information about the access history of any region of memory is available and designs competitive replication and migration algorithms that can take advantage of this information. A case study examines how these algorithms could be incorporated into the Mach operating system."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/22716161>
library:oclcnum"22716161"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/22716161>
rdf:typeschema:Book
rdf:typej.2:Thesis
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1990"
schema:description"The techniques of Discouragement and Handoff Scheduling are introduced to address the communication and synchronization problems of applications with more active entities than processors. Support for timesharing has been preserved by integrating the new features into the Mach timesharing scheduler. In the process, it was necessary to redesign the scheduler from scratch, and a number of lessons were learned about the design and implementation of timesharing schedulers, including how to collect accurate processor usage imformation based on timestamps instead of interrupt-driven sampling. The non-uniform memory management research takes a different approach, predicated on obtaining more information from hardware. Current implementations of non-uniform memory management are restricted by the available reference information."@en
schema:description"Abstract: "This thesis describes research in the design and implementation of multiprocessor resource management and related areas. Application requirements motivated the major research areas, processor scheduling and non-uniform memory management, as these areas contain the most important problems raised by the changing design and use of multiprocessors. A variety of processor scheduling problems are addressed by this work. A major contribution is the design and implementation of a processor allocation and control facility for the Mach operating system that allows processors to be dedicated to applications. The implementation of this facility has been validated by production use, and it is one of the first successful applications of policy-mechanism separation to multiprocessor scheduling (and, in particular, to the problem of dividing a multiprocessor among competing applications)."@en
schema:description"Hardware reference and modification bits indicate only that a page was referenced or modified at least once sometime in the past; they do not indicate how many references were made or how long ago. If more reference information were available, more sophisticated (and hopefully better) management techniques would be possible. This research assumes that any desired information about the access history of any region of memory is available and designs competitive replication and migration algorithms that can take advantage of this information. A case study examines how these algorithms could be incorporated into the Mach operating system.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/24225120>
schema:inLanguage"en"
schema:name"Scheduling and resource management techniques for multiprocessors"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.