Scheduling dependent real-time activities:
Abstract: "A real-time application is typically composed of a number of cooperating activities that must execute within specific time intervals. Since there are usually more activities to be executed than there are processors on which to execute them, several activities must share a single proc...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, Pa.
School of Computer Science, Carnegie Mellon Univ.
1990
|
| Schriftenreihe: | School of Computer Science <Pittsburgh, Pa.>: CMU-CS
1990,155 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A real-time application is typically composed of a number of cooperating activities that must execute within specific time intervals. Since there are usually more activities to be executed than there are processors on which to execute them, several activities must share a single processor. Necessarily, satisfying the activities' timing constraints is a prime concern in making the scheduling decisions for that processor. Unfortunately, the activities are not independent. Rather, they share data and devices, observe concurrency constraints on code execution, and send signals to one another. These interactions can be modeled as contention for shared resources that must be used by one activity at a time. An activity awaiting access to a resource currently held by another activity is said to depend on that activity, and a dependency relationship is said to exist between them. Dependency relationships may encompass both precedence constraints and resource conflicts No algorithm solves the problem of scheduling activities with dynamic dependency relationships in a way that is suitable for all real-time systems. This thesis provides and algorithm, called DASA, that is effective for scheduling the class of real-time systems known as supervisory control systems. Simulation experiments that account for the time required to make scheduling decisions demonstrate that DASA provides equivalent or superior performance to other scheduling algorithms of interest under a wide range of conditions for parameterized, synthetic workloads. DASA performs particularly well during overloads, when it is impossible to complete all of the activities This research makes a number of contributions to the field of computer science, including: a formal model for analyzing scheduling algorithms; the DASA scheduling algorithm, which integrates resource management with standardscheduling functions; results that demonstrate the efficacy of DASA in a variety of situations; and a simulator. In addition, this work may improve the current practices employed in designing and constructing supervisory control systems by encouraging the use of modern software engineering methodologies and reducing the amount of tuning that is required to produce systems that meet their real-time constraints - while providing improved scheduling, graceful degradation, and more freedom in modifying the system over time. |
| Beschreibung: | Zugl.: Pittsburgh, Pa., Univ., Diss., 1990 |
| Beschreibung: | XII, 240 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008398701 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 931203s1990 d||| m||| 00||| engod | ||
| 035 | |a (OCoLC)22716118 | ||
| 035 | |a (DE-599)BVBBV008398701 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 | ||
| 082 | 0 | |a 510.7808 |b C28r 90-155 | |
| 084 | |a DAT 260d |2 stub | ||
| 084 | |a MAT 608d |2 stub | ||
| 088 | |a CMU CS 90 155 | ||
| 100 | 1 | |a Clark, Raymond K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scheduling dependent real-time activities |c Raymond Keith Clark |
| 246 | 1 | 3 | |a CMU CS 90 155 |
| 264 | 1 | |a Pittsburgh, Pa. |b School of Computer Science, Carnegie Mellon Univ. |c 1990 | |
| 300 | |a XII, 240 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1990,155 | |
| 500 | |a Zugl.: Pittsburgh, Pa., Univ., Diss., 1990 | ||
| 520 | 3 | |a Abstract: "A real-time application is typically composed of a number of cooperating activities that must execute within specific time intervals. Since there are usually more activities to be executed than there are processors on which to execute them, several activities must share a single processor. Necessarily, satisfying the activities' timing constraints is a prime concern in making the scheduling decisions for that processor. Unfortunately, the activities are not independent. Rather, they share data and devices, observe concurrency constraints on code execution, and send signals to one another. These interactions can be modeled as contention for shared resources that must be used by one activity at a time. An activity awaiting access to a resource currently held by another activity is said to depend on that activity, and a dependency relationship is said to exist between them. Dependency relationships may encompass both precedence constraints and resource conflicts | |
| 520 | 3 | |a No algorithm solves the problem of scheduling activities with dynamic dependency relationships in a way that is suitable for all real-time systems. This thesis provides and algorithm, called DASA, that is effective for scheduling the class of real-time systems known as supervisory control systems. Simulation experiments that account for the time required to make scheduling decisions demonstrate that DASA provides equivalent or superior performance to other scheduling algorithms of interest under a wide range of conditions for parameterized, synthetic workloads. DASA performs particularly well during overloads, when it is impossible to complete all of the activities | |
| 520 | 3 | |a This research makes a number of contributions to the field of computer science, including: a formal model for analyzing scheduling algorithms; the DASA scheduling algorithm, which integrates resource management with standardscheduling functions; results that demonstrate the efficacy of DASA in a variety of situations; and a simulator. In addition, this work may improve the current practices employed in designing and constructing supervisory control systems by encouraging the use of modern software engineering methodologies and reducing the amount of tuning that is required to produce systems that meet their real-time constraints - while providing improved scheduling, graceful degradation, and more freedom in modifying the system over time. | |
| 650 | 4 | |a Production scheduling | |
| 650 | 4 | |a Real-time data processing | |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Echtzeitsystem |0 (DE-588)4131397-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Echtzeitsystem |0 (DE-588)4131397-5 |D s |
| 689 | 0 | 1 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a School of Computer Science <Pittsburgh, Pa.>: CMU-CS |v 1990,155 |w (DE-604)BV006187264 |9 1990,155 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005532962 | ||
Datensatz im Suchindex
| _version_ | 1804122766375387136 |
|---|---|
| any_adam_object | |
| author | Clark, Raymond K. |
| author_facet | Clark, Raymond K. |
| author_role | aut |
| author_sort | Clark, Raymond K. |
| author_variant | r k c rk rkc |
| building | Verbundindex |
| bvnumber | BV008398701 |
| classification_tum | DAT 260d MAT 608d |
| ctrlnum | (OCoLC)22716118 (DE-599)BVBBV008398701 |
| dewey-full | 510.7808 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7808 |
| dewey-search | 510.7808 |
| dewey-sort | 3510.7808 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03980nam a2200469 cb4500</leader><controlfield tag="001">BV008398701</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931203s1990 d||| m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22716118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008398701</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-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.7808</subfield><subfield code="b">C28r 90-155</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 260d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 608d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CMU CS 90 155</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clark, Raymond K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling dependent real-time activities</subfield><subfield code="c">Raymond Keith Clark</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">CMU CS 90 155</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="b">School of Computer Science, Carnegie Mellon Univ.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 240 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">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">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1990,155</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Pittsburgh, Pa., Univ., Diss., 1990</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A real-time application is typically composed of a number of cooperating activities that must execute within specific time intervals. Since there are usually more activities to be executed than there are processors on which to execute them, several activities must share a single processor. Necessarily, satisfying the activities' timing constraints is a prime concern in making the scheduling decisions for that processor. Unfortunately, the activities are not independent. Rather, they share data and devices, observe concurrency constraints on code execution, and send signals to one another. These interactions can be modeled as contention for shared resources that must be used by one activity at a time. An activity awaiting access to a resource currently held by another activity is said to depend on that activity, and a dependency relationship is said to exist between them. Dependency relationships may encompass both precedence constraints and resource conflicts</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">No algorithm solves the problem of scheduling activities with dynamic dependency relationships in a way that is suitable for all real-time systems. This thesis provides and algorithm, called DASA, that is effective for scheduling the class of real-time systems known as supervisory control systems. Simulation experiments that account for the time required to make scheduling decisions demonstrate that DASA provides equivalent or superior performance to other scheduling algorithms of interest under a wide range of conditions for parameterized, synthetic workloads. DASA performs particularly well during overloads, when it is impossible to complete all of the activities</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This research makes a number of contributions to the field of computer science, including: a formal model for analyzing scheduling algorithms; the DASA scheduling algorithm, which integrates resource management with standardscheduling functions; results that demonstrate the efficacy of DASA in a variety of situations; and a simulator. In addition, this work may improve the current practices employed in designing and constructing supervisory control systems by encouraging the use of modern software engineering methodologies and reducing the amount of tuning that is required to produce systems that meet their real-time constraints - while providing improved scheduling, graceful degradation, and more freedom in modifying the system over time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">School of Computer Science <Pittsburgh, Pa.>: CMU-CS</subfield><subfield code="v">1990,155</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">1990,155</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005532962</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV008398701 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:19:05Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005532962 |
| oclc_num | 22716118 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | XII, 240 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | School of Computer Science, Carnegie Mellon Univ. |
| record_format | marc |
| series | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| series2 | School of Computer Science <Pittsburgh, Pa.>: CMU-CS |
| spelling | Clark, Raymond K. Verfasser aut Scheduling dependent real-time activities Raymond Keith Clark CMU CS 90 155 Pittsburgh, Pa. School of Computer Science, Carnegie Mellon Univ. 1990 XII, 240 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1990,155 Zugl.: Pittsburgh, Pa., Univ., Diss., 1990 Abstract: "A real-time application is typically composed of a number of cooperating activities that must execute within specific time intervals. Since there are usually more activities to be executed than there are processors on which to execute them, several activities must share a single processor. Necessarily, satisfying the activities' timing constraints is a prime concern in making the scheduling decisions for that processor. Unfortunately, the activities are not independent. Rather, they share data and devices, observe concurrency constraints on code execution, and send signals to one another. These interactions can be modeled as contention for shared resources that must be used by one activity at a time. An activity awaiting access to a resource currently held by another activity is said to depend on that activity, and a dependency relationship is said to exist between them. Dependency relationships may encompass both precedence constraints and resource conflicts No algorithm solves the problem of scheduling activities with dynamic dependency relationships in a way that is suitable for all real-time systems. This thesis provides and algorithm, called DASA, that is effective for scheduling the class of real-time systems known as supervisory control systems. Simulation experiments that account for the time required to make scheduling decisions demonstrate that DASA provides equivalent or superior performance to other scheduling algorithms of interest under a wide range of conditions for parameterized, synthetic workloads. DASA performs particularly well during overloads, when it is impossible to complete all of the activities This research makes a number of contributions to the field of computer science, including: a formal model for analyzing scheduling algorithms; the DASA scheduling algorithm, which integrates resource management with standardscheduling functions; results that demonstrate the efficacy of DASA in a variety of situations; and a simulator. In addition, this work may improve the current practices employed in designing and constructing supervisory control systems by encouraging the use of modern software engineering methodologies and reducing the amount of tuning that is required to produce systems that meet their real-time constraints - while providing improved scheduling, graceful degradation, and more freedom in modifying the system over time. Production scheduling Real-time data processing Scheduling (DE-588)4179449-7 gnd rswk-swf Echtzeitsystem (DE-588)4131397-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Echtzeitsystem (DE-588)4131397-5 s Scheduling (DE-588)4179449-7 s DE-604 School of Computer Science <Pittsburgh, Pa.>: CMU-CS 1990,155 (DE-604)BV006187264 1990,155 |
| spellingShingle | Clark, Raymond K. Scheduling dependent real-time activities School of Computer Science <Pittsburgh, Pa.>: CMU-CS Production scheduling Real-time data processing Scheduling (DE-588)4179449-7 gnd Echtzeitsystem (DE-588)4131397-5 gnd |
| subject_GND | (DE-588)4179449-7 (DE-588)4131397-5 (DE-588)4113937-9 |
| title | Scheduling dependent real-time activities |
| title_alt | CMU CS 90 155 |
| title_auth | Scheduling dependent real-time activities |
| title_exact_search | Scheduling dependent real-time activities |
| title_full | Scheduling dependent real-time activities Raymond Keith Clark |
| title_fullStr | Scheduling dependent real-time activities Raymond Keith Clark |
| title_full_unstemmed | Scheduling dependent real-time activities Raymond Keith Clark |
| title_short | Scheduling dependent real-time activities |
| title_sort | scheduling dependent real time activities |
| topic | Production scheduling Real-time data processing Scheduling (DE-588)4179449-7 gnd Echtzeitsystem (DE-588)4131397-5 gnd |
| topic_facet | Production scheduling Real-time data processing Scheduling Echtzeitsystem Hochschulschrift |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT clarkraymondk schedulingdependentrealtimeactivities AT clarkraymondk cmucs90155 |