Analysis of contention in multiprocessor scheduling:
Abstract: "Scheduling in many multiprocessor operating systems is based upon the use of a single priority queue of runnable tasks. This shared queue can become a system bottleneck due to contention among the processors. In this study we address contention for the shared system queue and develop...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Seattle, Wash.
1989
|
Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
89,11,6 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Scheduling in many multiprocessor operating systems is based upon the use of a single priority queue of runnable tasks. This shared queue can become a system bottleneck due to contention among the processors. In this study we address contention for the shared system queue and develop scheduling policies to reduce anticipated response time and load balancing problems. These problems are analyzed within the context of a unifying queueing theoretic scheduling model, which is solved using matrix-geometric techniques. Our analysis illustrates that contention for the shared system queue is significant and increases with the number of processors in the system We show that one of our policies, called autonomous scheduling, reduces contention for the system queue and thus provides better system performance than typical single queue scheduling. We also show that another of our policies, called cooperative scheduling, effectively eliminates contention for the shared system queue and consistently outperforms autonomous scheduling. In particular, the cooperative policy provides a greater maximal throughput, a lower mean response time and a smaller response time variance relative to the autonomous policy, and these differences widen with increasing system load, scheduling overhead and number of processors. |
Beschreibung: | 20 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009260390 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1989 |||| 00||| eng d | ||
035 | |a (OCoLC)24448530 | ||
035 | |a (DE-599)BVBBV009260390 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Nelson, Randolph D. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Analysis of contention in multiprocessor scheduling |c Randolph D. Nelson and Mark S. Squillante |
264 | 1 | |a Seattle, Wash. |c 1989 | |
300 | |a 20 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 89,11,6 | |
520 | 3 | |a Abstract: "Scheduling in many multiprocessor operating systems is based upon the use of a single priority queue of runnable tasks. This shared queue can become a system bottleneck due to contention among the processors. In this study we address contention for the shared system queue and develop scheduling policies to reduce anticipated response time and load balancing problems. These problems are analyzed within the context of a unifying queueing theoretic scheduling model, which is solved using matrix-geometric techniques. Our analysis illustrates that contention for the shared system queue is significant and increases with the number of processors in the system | |
520 | 3 | |a We show that one of our policies, called autonomous scheduling, reduces contention for the system queue and thus provides better system performance than typical single queue scheduling. We also show that another of our policies, called cooperative scheduling, effectively eliminates contention for the shared system queue and consistently outperforms autonomous scheduling. In particular, the cooperative policy provides a greater maximal throughput, a lower mean response time and a smaller response time variance relative to the autonomous policy, and these differences widen with increasing system load, scheduling overhead and number of processors. | |
650 | 4 | |a Multiprocessors | |
650 | 4 | |a Operating systems (Computers) | |
650 | 4 | |a Production scheduling | |
700 | 1 | |a Squillante, Mark S. |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 89,11,6 |w (DE-604)BV008930431 |9 89,11,6 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006162266 |
Datensatz im Suchindex
_version_ | 1804123708278702080 |
---|---|
any_adam_object | |
author | Nelson, Randolph D. Squillante, Mark S. |
author_facet | Nelson, Randolph D. Squillante, Mark S. |
author_role | aut aut |
author_sort | Nelson, Randolph D. |
author_variant | r d n rd rdn m s s ms mss |
building | Verbundindex |
bvnumber | BV009260390 |
ctrlnum | (OCoLC)24448530 (DE-599)BVBBV009260390 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02471nam a2200337 cb4500</leader><controlfield tag="001">BV009260390</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24448530</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260390</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nelson, Randolph D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis of contention in multiprocessor scheduling</subfield><subfield code="c">Randolph D. Nelson and Mark S. Squillante</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">89,11,6</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Scheduling in many multiprocessor operating systems is based upon the use of a single priority queue of runnable tasks. This shared queue can become a system bottleneck due to contention among the processors. In this study we address contention for the shared system queue and develop scheduling policies to reduce anticipated response time and load balancing problems. These problems are analyzed within the context of a unifying queueing theoretic scheduling model, which is solved using matrix-geometric techniques. Our analysis illustrates that contention for the shared system queue is significant and increases with the number of processors in the system</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We show that one of our policies, called autonomous scheduling, reduces contention for the system queue and thus provides better system performance than typical single queue scheduling. We also show that another of our policies, called cooperative scheduling, effectively eliminates contention for the shared system queue and consistently outperforms autonomous scheduling. In particular, the cooperative policy provides a greater maximal throughput, a lower mean response time and a smaller response time variance relative to the autonomous policy, and these differences widen with increasing system load, scheduling overhead and number of processors.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operating systems (Computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Squillante, Mark S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">89,11,6</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">89,11,6</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162266</subfield></datafield></record></collection> |
id | DE-604.BV009260390 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:34:04Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162266 |
oclc_num | 24448530 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 20 S. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
spelling | Nelson, Randolph D. Verfasser aut Analysis of contention in multiprocessor scheduling Randolph D. Nelson and Mark S. Squillante Seattle, Wash. 1989 20 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 89,11,6 Abstract: "Scheduling in many multiprocessor operating systems is based upon the use of a single priority queue of runnable tasks. This shared queue can become a system bottleneck due to contention among the processors. In this study we address contention for the shared system queue and develop scheduling policies to reduce anticipated response time and load balancing problems. These problems are analyzed within the context of a unifying queueing theoretic scheduling model, which is solved using matrix-geometric techniques. Our analysis illustrates that contention for the shared system queue is significant and increases with the number of processors in the system We show that one of our policies, called autonomous scheduling, reduces contention for the system queue and thus provides better system performance than typical single queue scheduling. We also show that another of our policies, called cooperative scheduling, effectively eliminates contention for the shared system queue and consistently outperforms autonomous scheduling. In particular, the cooperative policy provides a greater maximal throughput, a lower mean response time and a smaller response time variance relative to the autonomous policy, and these differences widen with increasing system load, scheduling overhead and number of processors. Multiprocessors Operating systems (Computers) Production scheduling Squillante, Mark S. Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 89,11,6 (DE-604)BV008930431 89,11,6 |
spellingShingle | Nelson, Randolph D. Squillante, Mark S. Analysis of contention in multiprocessor scheduling Multiprocessors Operating systems (Computers) Production scheduling |
title | Analysis of contention in multiprocessor scheduling |
title_auth | Analysis of contention in multiprocessor scheduling |
title_exact_search | Analysis of contention in multiprocessor scheduling |
title_full | Analysis of contention in multiprocessor scheduling Randolph D. Nelson and Mark S. Squillante |
title_fullStr | Analysis of contention in multiprocessor scheduling Randolph D. Nelson and Mark S. Squillante |
title_full_unstemmed | Analysis of contention in multiprocessor scheduling Randolph D. Nelson and Mark S. Squillante |
title_short | Analysis of contention in multiprocessor scheduling |
title_sort | analysis of contention in multiprocessor scheduling |
topic | Multiprocessors Operating systems (Computers) Production scheduling |
topic_facet | Multiprocessors Operating systems (Computers) Production scheduling |
volume_link | (DE-604)BV008930431 |
work_keys_str_mv | AT nelsonrandolphd analysisofcontentioninmultiprocessorscheduling AT squillantemarks analysisofcontentioninmultiprocessorscheduling |