Scheduling and resource management techniques for multiprocessors:
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 prob...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Pittsburgh, Pa.
School of Computer Science, Carnegie Mellon Univ.
1990
|
Schriftenreihe: | CMU-CS / School of Computer Science <Pittsburgh, Pa.>
1990,152 |
Schlagworte: | |
Zusammenfassung: | 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. |
Beschreibung: | VI, 111 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008398712 | ||
003 | DE-604 | ||
005 | 20140611 | ||
007 | t | ||
008 | 931203s1990 d||| m||| 00||| engod | ||
035 | |a (OCoLC)22716161 | ||
035 | |a (DE-599)BVBBV008398712 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91 |a DE-188 | ||
082 | 0 | |a 510.7808 |b C28r 90-152 | |
084 | |a MAT 608d |2 stub | ||
084 | |a DAT 212d |2 stub | ||
088 | |a CMU CS 90 152 | ||
100 | 1 | |a Black, David L. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Scheduling and resource management techniques for multiprocessors |c David L. Black |
246 | 1 | 3 | |a CMU CS 90 152 |
264 | 1 | |a Pittsburgh, Pa. |b School of Computer Science, Carnegie Mellon Univ. |c 1990 | |
300 | |a VI, 111 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a CMU-CS / School of Computer Science <Pittsburgh, Pa.> |v 1990,152 | |
502 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1990 | ||
520 | 3 | |a 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) | |
520 | 3 | |a 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 | |
520 | 3 | |a 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. | |
650 | 4 | |a Multiprocessors | |
650 | 4 | |a Production scheduling | |
650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
689 | 0 | 1 | |a Scheduling |0 (DE-588)4179449-7 |D s |
689 | 0 | |5 DE-604 | |
810 | 2 | |a School of Computer Science <Pittsburgh, Pa.> |t CMU-CS |v 1990,152 |w (DE-604)BV006187264 |9 1990,152 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005532972 |
Datensatz im Suchindex
_version_ | 1804122766405795840 |
---|---|
any_adam_object | |
author | Black, David L. |
author_facet | Black, David L. |
author_role | aut |
author_sort | Black, David L. |
author_variant | d l b dl dlb |
building | Verbundindex |
bvnumber | BV008398712 |
classification_tum | MAT 608d DAT 212d |
ctrlnum | (OCoLC)22716161 (DE-599)BVBBV008398712 |
dewey-full | 510.7808 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510.7808 |
dewey-search | 510.7808 |
dewey-sort | 3510.7808 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03966nam a2200469 cb4500</leader><controlfield tag="001">BV008398712</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140611 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931203s1990 d||| m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22716161</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008398712</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 90-152</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 608d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 212d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 90 152</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Black, David L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling and resource management techniques for multiprocessors</subfield><subfield code="c">David L. Black</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 90 152</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="b">School of Computer Science, Carnegie Mellon Univ.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 111 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">CMU-CS / School of Computer Science <Pittsburgh, Pa.></subfield><subfield code="v">1990,152</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1990</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">School of Computer Science <Pittsburgh, Pa.></subfield><subfield code="t">CMU-CS</subfield><subfield code="v">1990,152</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1990,152</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005532972</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV008398712 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:19:05Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005532972 |
oclc_num | 22716161 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-188 |
owner_facet | DE-91 DE-BY-TUM DE-188 |
physical | VI, 111 S. graph. Darst. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | School of Computer Science, Carnegie Mellon Univ. |
record_format | marc |
series2 | CMU-CS / School of Computer Science <Pittsburgh, Pa.> |
spelling | Black, David L. Verfasser aut Scheduling and resource management techniques for multiprocessors David L. Black CMU CS 90 152 Pittsburgh, Pa. School of Computer Science, Carnegie Mellon Univ. 1990 VI, 111 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier CMU-CS / School of Computer Science <Pittsburgh, Pa.> 1990,152 Zugl.: Pittsburgh, Pa., Univ., Diss., 1990 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. Multiprocessors Production scheduling Scheduling (DE-588)4179449-7 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Mehrprozessorsystem (DE-588)4038397-0 s Scheduling (DE-588)4179449-7 s DE-604 School of Computer Science <Pittsburgh, Pa.> CMU-CS 1990,152 (DE-604)BV006187264 1990,152 |
spellingShingle | Black, David L. Scheduling and resource management techniques for multiprocessors Multiprocessors Production scheduling Scheduling (DE-588)4179449-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd |
subject_GND | (DE-588)4179449-7 (DE-588)4038397-0 (DE-588)4113937-9 |
title | Scheduling and resource management techniques for multiprocessors |
title_alt | CMU CS 90 152 |
title_auth | Scheduling and resource management techniques for multiprocessors |
title_exact_search | Scheduling and resource management techniques for multiprocessors |
title_full | Scheduling and resource management techniques for multiprocessors David L. Black |
title_fullStr | Scheduling and resource management techniques for multiprocessors David L. Black |
title_full_unstemmed | Scheduling and resource management techniques for multiprocessors David L. Black |
title_short | Scheduling and resource management techniques for multiprocessors |
title_sort | scheduling and resource management techniques for multiprocessors |
topic | Multiprocessors Production scheduling Scheduling (DE-588)4179449-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd |
topic_facet | Multiprocessors Production scheduling Scheduling Mehrprozessorsystem Hochschulschrift |
volume_link | (DE-604)BV006187264 |
work_keys_str_mv | AT blackdavidl schedulingandresourcemanagementtechniquesformultiprocessors AT blackdavidl cmucs90152 |