Optimal multiprocessor scheduling of periodic tasks in a real-time environment:
This investigation has addressed the problem of constructing a nonpreemptive schedule that requires the minimal number of processors for a given set of periodic tasks. Each periodic task is characterized by an integer period and an execution time. It is assumed that the period between each inititati...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Mikrofilm Buch |
| Sprache: | English |
| Veröffentlicht: |
1979
|
| Ausgabe: | [Mikrofiche-Ausg.] |
| Schlagworte: | |
| Zusammenfassung: | This investigation has addressed the problem of constructing a nonpreemptive schedule that requires the minimal number of processors for a given set of periodic tasks. Each periodic task is characterized by an integer period and an execution time. It is assumed that the period between each inititation and termination of a task must not vary once the first is specified. A compatibility relation is defined on the set of tasks such that any pair of tasks may be scheduled on the same processor only if they are compatible. An algorithm is defined which constructs a minimal processor schedule for a given set of tasks. The algorithm determines both upper and lower bounds on the number of processors required |
| Beschreibung: | X, 294 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035770020 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | he|uuuuuuuucu | ||
| 008 | 091014s1979 d||| bm||| 00||| eng d | ||
| 035 | |a (OCoLC)227437375 | ||
| 035 | |a (DE-599)BVBBV035770020 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 100 | 1 | |a Seward, Walter D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal multiprocessor scheduling of periodic tasks in a real-time environment |c Walter D. Seward |
| 250 | |a [Mikrofiche-Ausg.] | ||
| 264 | 1 | |c 1979 | |
| 300 | |a X, 294 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 502 | |a Dayton, Ohio, Univ., Diss., 1979 | ||
| 520 | |a This investigation has addressed the problem of constructing a nonpreemptive schedule that requires the minimal number of processors for a given set of periodic tasks. Each periodic task is characterized by an integer period and an execution time. It is assumed that the period between each inititation and termination of a task must not vary once the first is specified. A compatibility relation is defined on the set of tasks such that any pair of tasks may be scheduled on the same processor only if they are compatible. An algorithm is defined which constructs a minimal processor schedule for a given set of tasks. The algorithm determines both upper and lower bounds on the number of processors required | ||
| 533 | |a Mikroform-Ausgabe |b Ann Arbor, Mich. |c Univ. Microfilms Internat. |d 1980 |e 4 Mikrofiches |n Mikrofiche-Ausg.: |7 s1980 | ||
| 650 | 4 | |a WUAFIT20030320 | |
| 650 | 4 | |a PE62204F | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Multiprocessors |2 dtict | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Jobs |2 dtict | |
| 650 | 7 | |a Real time |2 dtict | |
| 650 | 7 | |a Distribution |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 650 | 7 | |a Scheduling |2 dtict | |
| 650 | 7 | |a Systems analysis |2 dtict | |
| 650 | 4 | |a Algorithms / dtict | |
| 650 | 4 | |a Computer Hardware / scgdst | |
| 650 | 4 | |a Distribution / dtict | |
| 650 | 4 | |a Jobs / dtict | |
| 650 | 4 | |a Multiprocessors / dtict | |
| 650 | 4 | |a PE62204F | |
| 650 | 4 | |a Real time / dtict | |
| 650 | 4 | |a Scheduling / dtict | |
| 650 | 4 | |a Systems analysis / dtict | |
| 650 | 4 | |a Theses / dtict | |
| 650 | 4 | |a WUAFIT20030320 | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Reproduktion von |a Seward, Walter D. |t Optimal multiprocessor scheduling of periodic tasks in a real-time environment |d 1979 |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018629738 | ||
Datensatz im Suchindex
| _version_ | 1804140699214413824 |
|---|---|
| any_adam_object | |
| author | Seward, Walter D. |
| author_facet | Seward, Walter D. |
| author_role | aut |
| author_sort | Seward, Walter D. |
| author_variant | w d s wd wds |
| building | Verbundindex |
| bvnumber | BV035770020 |
| ctrlnum | (OCoLC)227437375 (DE-599)BVBBV035770020 |
| edition | [Mikrofiche-Ausg.] |
| format | Thesis Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02589nam a2200577 c 4500</leader><controlfield tag="001">BV035770020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">091014s1979 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227437375</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035770020</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seward, Walter D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal multiprocessor scheduling of periodic tasks in a real-time environment</subfield><subfield code="c">Walter D. Seward</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 294 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">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Dayton, Ohio, Univ., Diss., 1979</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This investigation has addressed the problem of constructing a nonpreemptive schedule that requires the minimal number of processors for a given set of periodic tasks. Each periodic task is characterized by an integer period and an execution time. It is assumed that the period between each inititation and termination of a task must not vary once the first is specified. A compatibility relation is defined on the set of tasks such that any pair of tasks may be scheduled on the same processor only if they are compatible. An algorithm is defined which constructs a minimal processor schedule for a given set of tasks. The algorithm determines both upper and lower bounds on the number of processors required</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikroform-Ausgabe</subfield><subfield code="b">Ann Arbor, Mich.</subfield><subfield code="c">Univ. Microfilms Internat.</subfield><subfield code="d">1980</subfield><subfield code="e">4 Mikrofiches</subfield><subfield code="n">Mikrofiche-Ausg.:</subfield><subfield code="7">s1980</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">WUAFIT20030320</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PE62204F</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Multiprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Jobs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Real time</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Distribution</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Scheduling</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Systems analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Hardware / scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Jobs / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PE62204F</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real time / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems analysis / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theses / dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">WUAFIT20030320</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="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Seward, Walter D.</subfield><subfield code="t">Optimal multiprocessor scheduling of periodic tasks in a real-time environment</subfield><subfield code="d">1979</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018629738</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035770020 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:04:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018629738 |
| oclc_num | 227437375 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | X, 294 S. graph. Darst. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| spelling | Seward, Walter D. Verfasser aut Optimal multiprocessor scheduling of periodic tasks in a real-time environment Walter D. Seward [Mikrofiche-Ausg.] 1979 X, 294 S. graph. Darst. txt rdacontent h rdamedia he rdacarrier Dayton, Ohio, Univ., Diss., 1979 This investigation has addressed the problem of constructing a nonpreemptive schedule that requires the minimal number of processors for a given set of periodic tasks. Each periodic task is characterized by an integer period and an execution time. It is assumed that the period between each inititation and termination of a task must not vary once the first is specified. A compatibility relation is defined on the set of tasks such that any pair of tasks may be scheduled on the same processor only if they are compatible. An algorithm is defined which constructs a minimal processor schedule for a given set of tasks. The algorithm determines both upper and lower bounds on the number of processors required Mikroform-Ausgabe Ann Arbor, Mich. Univ. Microfilms Internat. 1980 4 Mikrofiches Mikrofiche-Ausg.: s1980 WUAFIT20030320 PE62204F Computer Hardware scgdst Multiprocessors dtict Algorithms dtict Jobs dtict Real time dtict Distribution dtict Theses dtict Scheduling dtict Systems analysis dtict Algorithms / dtict Computer Hardware / scgdst Distribution / dtict Jobs / dtict Multiprocessors / dtict Real time / dtict Scheduling / dtict Systems analysis / dtict Theses / dtict (DE-588)4113937-9 Hochschulschrift gnd-content Reproduktion von Seward, Walter D. Optimal multiprocessor scheduling of periodic tasks in a real-time environment 1979 |
| spellingShingle | Seward, Walter D. Optimal multiprocessor scheduling of periodic tasks in a real-time environment WUAFIT20030320 PE62204F Computer Hardware scgdst Multiprocessors dtict Algorithms dtict Jobs dtict Real time dtict Distribution dtict Theses dtict Scheduling dtict Systems analysis dtict Algorithms / dtict Computer Hardware / scgdst Distribution / dtict Jobs / dtict Multiprocessors / dtict Real time / dtict Scheduling / dtict Systems analysis / dtict Theses / dtict |
| subject_GND | (DE-588)4113937-9 |
| title | Optimal multiprocessor scheduling of periodic tasks in a real-time environment |
| title_auth | Optimal multiprocessor scheduling of periodic tasks in a real-time environment |
| title_exact_search | Optimal multiprocessor scheduling of periodic tasks in a real-time environment |
| title_full | Optimal multiprocessor scheduling of periodic tasks in a real-time environment Walter D. Seward |
| title_fullStr | Optimal multiprocessor scheduling of periodic tasks in a real-time environment Walter D. Seward |
| title_full_unstemmed | Optimal multiprocessor scheduling of periodic tasks in a real-time environment Walter D. Seward |
| title_short | Optimal multiprocessor scheduling of periodic tasks in a real-time environment |
| title_sort | optimal multiprocessor scheduling of periodic tasks in a real time environment |
| topic | WUAFIT20030320 PE62204F Computer Hardware scgdst Multiprocessors dtict Algorithms dtict Jobs dtict Real time dtict Distribution dtict Theses dtict Scheduling dtict Systems analysis dtict Algorithms / dtict Computer Hardware / scgdst Distribution / dtict Jobs / dtict Multiprocessors / dtict Real time / dtict Scheduling / dtict Systems analysis / dtict Theses / dtict |
| topic_facet | WUAFIT20030320 PE62204F Computer Hardware Multiprocessors Algorithms Jobs Real time Distribution Theses Scheduling Systems analysis Algorithms / dtict Computer Hardware / scgdst Distribution / dtict Jobs / dtict Multiprocessors / dtict Real time / dtict Scheduling / dtict Systems analysis / dtict Theses / dtict Hochschulschrift |
| work_keys_str_mv | AT sewardwalterd optimalmultiprocessorschedulingofperiodictasksinarealtimeenvironment |