A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors:
Abstract: "We propose and evaluate empirically the performance of a dynamic processor scheduling policy for multiprogrammed, shared memory multiprocessors. The policy is dynamic in that it reallocates processors from one parallel job to another based on the currently realized parallelism of tho...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Seattle, Wash.
1991
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,3,2 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We propose and evaluate empirically the performance of a dynamic processor scheduling policy for multiprogrammed, shared memory multiprocessors. The policy is dynamic in that it reallocates processors from one parallel job to another based on the currently realized parallelism of those jobs. The policy is suitable for implementation in production systems in that: - it interacts well with very efficient user- level thread packages, leaving to them many low level thread operations that do not require kernel intervention. - it deals with thread blocking due to user I/O and page faults. - it ensures fairness in delivering resources to jobs - its performance, measured in terms of average job response time, is superior to that of previously proposed schedulers, including those implemented in existing systems. - it provides good performance to very short, sequential (e.g., interactive) requests. We have evaluated our scheduler and compared it to alternatives using a set of prototype implementations running on a Sequent Symmetry multiprocessor Using a number of parallel applications with distinct qualitative behaviors, we have both evaluated the policies according to the major criterion of overall performance and examined a number of more general policy issues, including the advantage of 'space sharing' over 'time sharing' the processors of a multiprocessor, the importance of cooperation between the kernel and the application in reallocating processors between jobs, and the impact of scheduling policy on an application's cache behavior. We have also compared the policies according to other criteria important in real implementations: fairness, resiliency to countermeasures, and response time to short, sequential requests |
| Beschreibung: | 23, 3 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993136 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28390758 | ||
| 035 | |a (DE-599)BVBBV008993136 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a MacCann, Cathy |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors |c Cathy McCann ; Raj Vaswani ; John Zahorjan |
| 264 | 1 | |a Seattle, Wash. |c 1991 | |
| 300 | |a 23, 3 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 90,3,2 | |
| 520 | 3 | |a Abstract: "We propose and evaluate empirically the performance of a dynamic processor scheduling policy for multiprogrammed, shared memory multiprocessors. The policy is dynamic in that it reallocates processors from one parallel job to another based on the currently realized parallelism of those jobs. The policy is suitable for implementation in production systems in that: - it interacts well with very efficient user- level thread packages, leaving to them many low level thread operations that do not require kernel intervention. - it deals with thread blocking due to user I/O and page faults. - it ensures fairness in delivering resources to jobs | |
| 520 | 3 | |a - its performance, measured in terms of average job response time, is superior to that of previously proposed schedulers, including those implemented in existing systems. - it provides good performance to very short, sequential (e.g., interactive) requests. We have evaluated our scheduler and compared it to alternatives using a set of prototype implementations running on a Sequent Symmetry multiprocessor | |
| 520 | 3 | |a Using a number of parallel applications with distinct qualitative behaviors, we have both evaluated the policies according to the major criterion of overall performance and examined a number of more general policy issues, including the advantage of 'space sharing' over 'time sharing' the processors of a multiprocessor, the importance of cooperation between the kernel and the application in reallocating processors between jobs, and the impact of scheduling policy on an application's cache behavior. We have also compared the policies according to other criteria important in real implementations: fairness, resiliency to countermeasures, and response time to short, sequential requests | |
| 650 | 4 | |a Multiprocessors | |
| 700 | 1 | |a Vaswani, Raj |e Verfasser |4 aut | |
| 700 | 1 | |a Zahorjan, John |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,3,2 |w (DE-604)BV008930431 |9 90,3,2 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941960 | ||
Datensatz im Suchindex
| _version_ | 1804123335620034560 |
|---|---|
| any_adam_object | |
| author | MacCann, Cathy Vaswani, Raj Zahorjan, John |
| author_facet | MacCann, Cathy Vaswani, Raj Zahorjan, John |
| author_role | aut aut aut |
| author_sort | MacCann, Cathy |
| author_variant | c m cm r v rv j z jz |
| building | Verbundindex |
| bvnumber | BV008993136 |
| ctrlnum | (OCoLC)28390758 (DE-599)BVBBV008993136 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02908nam a2200337 cb4500</leader><controlfield tag="001">BV008993136</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28390758</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993136</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">MacCann, Cathy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors</subfield><subfield code="c">Cathy McCann ; Raj Vaswani ; John Zahorjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23, 3 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">90,3,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose and evaluate empirically the performance of a dynamic processor scheduling policy for multiprogrammed, shared memory multiprocessors. The policy is dynamic in that it reallocates processors from one parallel job to another based on the currently realized parallelism of those jobs. The policy is suitable for implementation in production systems in that: - it interacts well with very efficient user- level thread packages, leaving to them many low level thread operations that do not require kernel intervention. - it deals with thread blocking due to user I/O and page faults. - it ensures fairness in delivering resources to jobs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">- its performance, measured in terms of average job response time, is superior to that of previously proposed schedulers, including those implemented in existing systems. - it provides good performance to very short, sequential (e.g., interactive) requests. We have evaluated our scheduler and compared it to alternatives using a set of prototype implementations running on a Sequent Symmetry multiprocessor</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Using a number of parallel applications with distinct qualitative behaviors, we have both evaluated the policies according to the major criterion of overall performance and examined a number of more general policy issues, including the advantage of 'space sharing' over 'time sharing' the processors of a multiprocessor, the importance of cooperation between the kernel and the application in reallocating processors between jobs, and the impact of scheduling policy on an application's cache behavior. We have also compared the policies according to other criteria important in real implementations: fairness, resiliency to countermeasures, and response time to short, sequential requests</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vaswani, Raj</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zahorjan, John</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">90,3,2</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,3,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941960</subfield></datafield></record></collection> |
| id | DE-604.BV008993136 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941960 |
| oclc_num | 28390758 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 23, 3 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | MacCann, Cathy Verfasser aut A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors Cathy McCann ; Raj Vaswani ; John Zahorjan Seattle, Wash. 1991 23, 3 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,3,2 Abstract: "We propose and evaluate empirically the performance of a dynamic processor scheduling policy for multiprogrammed, shared memory multiprocessors. The policy is dynamic in that it reallocates processors from one parallel job to another based on the currently realized parallelism of those jobs. The policy is suitable for implementation in production systems in that: - it interacts well with very efficient user- level thread packages, leaving to them many low level thread operations that do not require kernel intervention. - it deals with thread blocking due to user I/O and page faults. - it ensures fairness in delivering resources to jobs - its performance, measured in terms of average job response time, is superior to that of previously proposed schedulers, including those implemented in existing systems. - it provides good performance to very short, sequential (e.g., interactive) requests. We have evaluated our scheduler and compared it to alternatives using a set of prototype implementations running on a Sequent Symmetry multiprocessor Using a number of parallel applications with distinct qualitative behaviors, we have both evaluated the policies according to the major criterion of overall performance and examined a number of more general policy issues, including the advantage of 'space sharing' over 'time sharing' the processors of a multiprocessor, the importance of cooperation between the kernel and the application in reallocating processors between jobs, and the impact of scheduling policy on an application's cache behavior. We have also compared the policies according to other criteria important in real implementations: fairness, resiliency to countermeasures, and response time to short, sequential requests Multiprocessors Vaswani, Raj Verfasser aut Zahorjan, John Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,3,2 (DE-604)BV008930431 90,3,2 |
| spellingShingle | MacCann, Cathy Vaswani, Raj Zahorjan, John A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors Multiprocessors |
| title | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors |
| title_auth | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors |
| title_exact_search | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors |
| title_full | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors Cathy McCann ; Raj Vaswani ; John Zahorjan |
| title_fullStr | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors Cathy McCann ; Raj Vaswani ; John Zahorjan |
| title_full_unstemmed | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors Cathy McCann ; Raj Vaswani ; John Zahorjan |
| title_short | A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors |
| title_sort | a dynamic processor allocation policy for multiprogrammed shared memory multiprocessors |
| topic | Multiprocessors |
| topic_facet | Multiprocessors |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT maccanncathy adynamicprocessorallocationpolicyformultiprogrammedsharedmemorymultiprocessors AT vaswaniraj adynamicprocessorallocationpolicyformultiprogrammedsharedmemorymultiprocessors AT zahorjanjohn adynamicprocessorallocationpolicyformultiprogrammedsharedmemorymultiprocessors |