Task scheduling in the control robotics environment:
Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Mass. Inst. fo Technology, Lab. of Computer Science
1976
|
| Subjects: | |
| Summary: | Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times and frequencies of occurrence of individual tasks is available. A model of preemptive scheduling, the scheduling game is introduced to explore the mathematical relationships for different scheduling situations. A necessary and sufficient condition for scheduling tasks with simultaneous requests or deadlines is derived. Partial solutions and the difficulties involved in scheduling tasks with distributed requests are discussed. It is shown that in the absence of a priori knowledge about the distribution of the requests of the future tasks in time, no globally optimal algorithm is possible. (Author). |
| Physical Description: | 90 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021886307 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 890915s1976 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227431738 | ||
| 035 | |a (DE-599)BVBBV021886307 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-77 | ||
| 100 | 1 | |a Mok, Aloysius K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Task scheduling in the control robotics environment |c by Aloysius Ka-Lau Mok |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. fo Technology, Lab. of Computer Science |c 1976 | |
| 300 | |a 90 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times and frequencies of occurrence of individual tasks is available. A model of preemptive scheduling, the scheduling game is introduced to explore the mathematical relationships for different scheduling situations. A necessary and sufficient condition for scheduling tasks with simultaneous requests or deadlines is derived. Partial solutions and the difficulties involved in scheduling tasks with distributed requests are discussed. It is shown that in the absence of a priori knowledge about the distribution of the requests of the future tasks in time, no globally optimal algorithm is possible. (Author). | |
| 650 | 4 | |a Control robotics | |
| 650 | 4 | |a Deadlines | |
| 650 | 4 | |a Robotics | |
| 650 | 4 | |a Task scheduling | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Microprocessors |2 dtict | |
| 650 | 7 | |a Optimization |2 dtict | |
| 650 | 7 | |a Real time |2 dtict | |
| 650 | 7 | |a Scheduling |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015101556 | ||
Record in the Search Index
| _version_ | 1804135827913048064 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Mok, Aloysius K. |
| author_facet | Mok, Aloysius K. |
| author_role | aut |
| author_sort | Mok, Aloysius K. |
| author_variant | a k m ak akm |
| building | Verbundindex |
| bvnumber | BV021886307 |
| ctrlnum | (OCoLC)227431738 (DE-599)BVBBV021886307 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02059nam a2200409zc 4500</leader><controlfield tag="001">BV021886307</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890915s1976 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227431738</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021886307</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-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-77</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mok, Aloysius K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Task scheduling in the control robotics environment</subfield><subfield code="c">by Aloysius Ka-Lau Mok</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. fo Technology, Lab. of Computer Science</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">90 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="520" ind1="3" ind2=" "><subfield code="a">Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times and frequencies of occurrence of individual tasks is available. A model of preemptive scheduling, the scheduling game is introduced to explore the mathematical relationships for different scheduling situations. A necessary and sufficient condition for scheduling tasks with simultaneous requests or deadlines is derived. Partial solutions and the difficulties involved in scheduling tasks with distributed requests are discussed. It is shown that in the absence of a priori knowledge about the distribution of the requests of the future tasks in time, no globally optimal algorithm is possible. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Control robotics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deadlines</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robotics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Task scheduling</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">Computations</subfield><subfield code="2">dtict</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">Microprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimization</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">Scheduling</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015101556</subfield></datafield></record></collection> |
| id | DE-604.BV021886307 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:59Z |
| indexdate | 2024-07-09T20:46:42Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015101556 |
| oclc_num | 227431738 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 90 S. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| publisher | Mass. Inst. fo Technology, Lab. of Computer Science |
| record_format | marc |
| spelling | Mok, Aloysius K. Verfasser aut Task scheduling in the control robotics environment by Aloysius Ka-Lau Mok Cambridge, Mass. Mass. Inst. fo Technology, Lab. of Computer Science 1976 90 S. txt rdacontent n rdamedia nc rdacarrier Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with real-time deadlines is investigated according to whether complete or partial a priori knowledge of the deadlines, computation times and frequencies of occurrence of individual tasks is available. A model of preemptive scheduling, the scheduling game is introduced to explore the mathematical relationships for different scheduling situations. A necessary and sufficient condition for scheduling tasks with simultaneous requests or deadlines is derived. Partial solutions and the difficulties involved in scheduling tasks with distributed requests are discussed. It is shown that in the absence of a priori knowledge about the distribution of the requests of the future tasks in time, no globally optimal algorithm is possible. (Author). Control robotics Deadlines Robotics Task scheduling Algorithms dtict Computations dtict Computer Hardware scgdst Microprocessors dtict Optimization dtict Real time dtict Scheduling dtict Theses dtict |
| spellingShingle | Mok, Aloysius K. Task scheduling in the control robotics environment Control robotics Deadlines Robotics Task scheduling Algorithms dtict Computations dtict Computer Hardware scgdst Microprocessors dtict Optimization dtict Real time dtict Scheduling dtict Theses dtict |
| title | Task scheduling in the control robotics environment |
| title_auth | Task scheduling in the control robotics environment |
| title_exact_search | Task scheduling in the control robotics environment |
| title_exact_search_txtP | Task scheduling in the control robotics environment |
| title_full | Task scheduling in the control robotics environment by Aloysius Ka-Lau Mok |
| title_fullStr | Task scheduling in the control robotics environment by Aloysius Ka-Lau Mok |
| title_full_unstemmed | Task scheduling in the control robotics environment by Aloysius Ka-Lau Mok |
| title_short | Task scheduling in the control robotics environment |
| title_sort | task scheduling in the control robotics environment |
| topic | Control robotics Deadlines Robotics Task scheduling Algorithms dtict Computations dtict Computer Hardware scgdst Microprocessors dtict Optimization dtict Real time dtict Scheduling dtict Theses dtict |
| topic_facet | Control robotics Deadlines Robotics Task scheduling Algorithms Computations Computer Hardware Microprocessors Optimization Real time Scheduling Theses |
| work_keys_str_mv | AT mokaloysiusk taskschedulinginthecontrolroboticsenvironment |