Aperiodic request scheduling in fixed-priority preemptive systems:
Abstract: "In this report, we investigate the problem of scheduling aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the resp...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science
1994
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this report, we investigate the problem of scheduling aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the response time of every aperiodic request and guarantee that the deadlines of the periodic tasks are met when the periodic tasks are scheduled on fixed-priority, preemptive basis. We then develop two algorithms: Algorithm L is locally optimal in that it minimizes the response time of the aperiodic request at the head of the aperiodic service queue. Algorithm G is globally optimal in that it completes the current backlog of work in the aperiodic service queue as early as possible. Algorithm G also tries to reduce the average response time of the aperiodic requests." |
| Beschreibung: | 32 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035655624 | ||
| 003 | DE-604 | ||
| 005 | 20090731 | ||
| 007 | t | ||
| 008 | 090730s1994 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)31750037 | ||
| 035 | |a (DE-599)GBV181602385 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UIUCDCS-R-94-1859 | ||
| 088 | |a UILU-ENG-94-1717 | ||
| 100 | 1 | |a Tia, Too-Seng |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Aperiodic request scheduling in fixed-priority preemptive systems |c Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar |
| 246 | 1 | 3 | |a UIUCDCS-R-94-1859 |
| 264 | 1 | |a Urbana, Ill. |b Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1994 | |
| 300 | |a 32 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "In this report, we investigate the problem of scheduling aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the response time of every aperiodic request and guarantee that the deadlines of the periodic tasks are met when the periodic tasks are scheduled on fixed-priority, preemptive basis. We then develop two algorithms: Algorithm L is locally optimal in that it minimizes the response time of the aperiodic request at the head of the aperiodic service queue. Algorithm G is globally optimal in that it completes the current backlog of work in the aperiodic service queue as early as possible. Algorithm G also tries to reduce the average response time of the aperiodic requests." | |
| 650 | 4 | |a Production scheduling | |
| 650 | 4 | |a Queuing theory | |
| 700 | 1 | |a Liu, Jane W. S. |e Verfasser |4 aut | |
| 700 | 1 | |a Shankar, Mallikarjun |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017710127 | ||
Datensatz im Suchindex
| _version_ | 1804139343371042816 |
|---|---|
| any_adam_object | |
| author | Tia, Too-Seng Liu, Jane W. S. Shankar, Mallikarjun |
| author_facet | Tia, Too-Seng Liu, Jane W. S. Shankar, Mallikarjun |
| author_role | aut aut aut |
| author_sort | Tia, Too-Seng |
| author_variant | t s t tst j w s l jws jwsl m s ms |
| building | Verbundindex |
| bvnumber | BV035655624 |
| ctrlnum | (OCoLC)31750037 (DE-599)GBV181602385 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01941nam a2200349 c 4500</leader><controlfield tag="001">BV035655624</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090731 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090730s1994 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31750037</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV181602385</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-94-1859</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-94-1717</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tia, Too-Seng</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Aperiodic request scheduling in fixed-priority preemptive systems</subfield><subfield code="c">Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS-R-94-1859</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 Bl.</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="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this report, we investigate the problem of scheduling aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the response time of every aperiodic request and guarantee that the deadlines of the periodic tasks are met when the periodic tasks are scheduled on fixed-priority, preemptive basis. We then develop two algorithms: Algorithm L is locally optimal in that it minimizes the response time of the aperiodic request at the head of the aperiodic service queue. Algorithm G is globally optimal in that it completes the current backlog of work in the aperiodic service queue as early as possible. Algorithm G also tries to reduce the average response time of the aperiodic requests."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Jane W. S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shankar, Mallikarjun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017710127</subfield></datafield></record></collection> |
| id | DE-604.BV035655624 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:42:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017710127 |
| oclc_num | 31750037 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 32 Bl. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spelling | Tia, Too-Seng Verfasser aut Aperiodic request scheduling in fixed-priority preemptive systems Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar UIUCDCS-R-94-1859 Urbana, Ill. Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science 1994 32 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Abstract: "In this report, we investigate the problem of scheduling aperiodic requests in systems where periodic tasks are scheduled on a fixed-priority, preemptive basis. First, we show that given any queueing discipline for the aperiodic requests, no scheduling algorithm can minimize the response time of every aperiodic request and guarantee that the deadlines of the periodic tasks are met when the periodic tasks are scheduled on fixed-priority, preemptive basis. We then develop two algorithms: Algorithm L is locally optimal in that it minimizes the response time of the aperiodic request at the head of the aperiodic service queue. Algorithm G is globally optimal in that it completes the current backlog of work in the aperiodic service queue as early as possible. Algorithm G also tries to reduce the average response time of the aperiodic requests." Production scheduling Queuing theory Liu, Jane W. S. Verfasser aut Shankar, Mallikarjun Verfasser aut |
| spellingShingle | Tia, Too-Seng Liu, Jane W. S. Shankar, Mallikarjun Aperiodic request scheduling in fixed-priority preemptive systems Production scheduling Queuing theory |
| title | Aperiodic request scheduling in fixed-priority preemptive systems |
| title_alt | UIUCDCS-R-94-1859 |
| title_auth | Aperiodic request scheduling in fixed-priority preemptive systems |
| title_exact_search | Aperiodic request scheduling in fixed-priority preemptive systems |
| title_full | Aperiodic request scheduling in fixed-priority preemptive systems Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar |
| title_fullStr | Aperiodic request scheduling in fixed-priority preemptive systems Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar |
| title_full_unstemmed | Aperiodic request scheduling in fixed-priority preemptive systems Too-Seng Tia ; Jane W.-S. Liu ; Mallikarjun Shankar |
| title_short | Aperiodic request scheduling in fixed-priority preemptive systems |
| title_sort | aperiodic request scheduling in fixed priority preemptive systems |
| topic | Production scheduling Queuing theory |
| topic_facet | Production scheduling Queuing theory |
| work_keys_str_mv | AT tiatooseng aperiodicrequestschedulinginfixedprioritypreemptivesystems AT liujanews aperiodicrequestschedulinginfixedprioritypreemptivesystems AT shankarmallikarjun aperiodicrequestschedulinginfixedprioritypreemptivesystems AT tiatooseng uiucdcsr941859 AT liujanews uiucdcsr941859 AT shankarmallikarjun uiucdcsr941859 |