Algorithms for scheduling tasks with input error and end-to-end deadlines:
Abstract: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional pa...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
Univ. of Ill., Dep. of Computer Science
1994
|
| Subjects: | |
| Summary: | Abstract: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be extended in order to compensate for input error. We use a two-level scheduler. At the high level, the scheduler schedules the composite tasks preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The result is the total amount of time budgeted to each composite task in order for all composite tasks to meet their end-to-end deadlines. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of each composite task." |
| Physical Description: | 30 Bl. |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035644046 | ||
| 003 | DE-604 | ||
| 005 | 20090728 | ||
| 007 | t | ||
| 008 | 090723s1994 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31689757 | ||
| 035 | |a (DE-599)GBV181805855 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UIUCDCS-R-94-1888 | ||
| 088 | |a UILU-ENG-94-1742 | ||
| 100 | 1 | |a Feng, W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for scheduling tasks with input error and end-to-end deadlines |c W. Feng and J. W.-S. Liu |
| 246 | 1 | 3 | |a UIUCDCS R 94-1888 |
| 264 | 1 | |a Urbana, Ill. |b Univ. of Ill., Dep. of Computer Science |c 1994 | |
| 300 | |a 30 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be extended in order to compensate for input error. We use a two-level scheduler. At the high level, the scheduler schedules the composite tasks preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The result is the total amount of time budgeted to each composite task in order for all composite tasks to meet their end-to-end deadlines. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of each composite task." | |
| 650 | 4 | |a Real-time data processing | |
| 700 | 1 | |a Liu, Jane W. S. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017698782 | ||
Record in the Search Index
| _version_ | 1804139326564466688 |
|---|---|
| any_adam_object | |
| author | Feng, W. Liu, Jane W. S. |
| author_facet | Feng, W. Liu, Jane W. S. |
| author_role | aut aut |
| author_sort | Feng, W. |
| author_variant | w f wf j w s l jws jwsl |
| building | Verbundindex |
| bvnumber | BV035644046 |
| ctrlnum | (OCoLC)31689757 (DE-599)GBV181805855 |
| 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>01901nam a2200325 c 4500</leader><controlfield tag="001">BV035644046</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090728 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090723s1994 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31689757</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV181805855</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-1888</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-94-1742</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for scheduling tasks with input error and end-to-end deadlines</subfield><subfield code="c">W. Feng and J. W.-S. Liu</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 94-1888</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">Univ. of Ill., Dep. of Computer Science</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">30 Bl.</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: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be extended in order to compensate for input error. We use a two-level scheduler. At the high level, the scheduler schedules the composite tasks preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The result is the total amount of time budgeted to each composite task in order for all composite tasks to meet their end-to-end deadlines. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of each composite task."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017698782</subfield></datafield></record></collection> |
| id | DE-604.BV035644046 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:42:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017698782 |
| oclc_num | 31689757 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 30 Bl. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Univ. of Ill., Dep. of Computer Science |
| record_format | marc |
| spelling | Feng, W. Verfasser aut Algorithms for scheduling tasks with input error and end-to-end deadlines W. Feng and J. W.-S. Liu UIUCDCS R 94-1888 Urbana, Ill. Univ. of Ill., Dep. of Computer Science 1994 30 Bl. txt rdacontent n rdamedia nc rdacarrier Abstract: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be extended in order to compensate for input error. We use a two-level scheduler. At the high level, the scheduler schedules the composite tasks preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The result is the total amount of time budgeted to each composite task in order for all composite tasks to meet their end-to-end deadlines. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of each composite task." Real-time data processing Liu, Jane W. S. Verfasser aut |
| spellingShingle | Feng, W. Liu, Jane W. S. Algorithms for scheduling tasks with input error and end-to-end deadlines Real-time data processing |
| title | Algorithms for scheduling tasks with input error and end-to-end deadlines |
| title_alt | UIUCDCS R 94-1888 |
| title_auth | Algorithms for scheduling tasks with input error and end-to-end deadlines |
| title_exact_search | Algorithms for scheduling tasks with input error and end-to-end deadlines |
| title_full | Algorithms for scheduling tasks with input error and end-to-end deadlines W. Feng and J. W.-S. Liu |
| title_fullStr | Algorithms for scheduling tasks with input error and end-to-end deadlines W. Feng and J. W.-S. Liu |
| title_full_unstemmed | Algorithms for scheduling tasks with input error and end-to-end deadlines W. Feng and J. W.-S. Liu |
| title_short | Algorithms for scheduling tasks with input error and end-to-end deadlines |
| title_sort | algorithms for scheduling tasks with input error and end to end deadlines |
| topic | Real-time data processing |
| topic_facet | Real-time data processing |
| work_keys_str_mv | AT fengw algorithmsforschedulingtaskswithinputerrorandendtoenddeadlines AT liujanews algorithmsforschedulingtaskswithinputerrorandendtoenddeadlines AT fengw uiucdcsr941888 AT liujanews uiucdcsr941888 |