Statically optimal dynamic soft real-time semi-partitioned scheduling
Semi-partitioned scheduling is an approach to multiprocessor real-time scheduling where most tasks are fixed to processors, while a small subset of tasks is allowed to migrate. This approach offers reduced overhead compared to global scheduling, and can reduce processor capacity loss compared to par...
Gespeichert in:
| Veröffentlicht in: | Real-time systems 2021-04, Vol.57 (1-2), p.97-140 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 140 |
|---|---|
| container_issue | 1-2 |
| container_start_page | 97 |
| container_title | Real-time systems |
| container_volume | 57 |
| creator | Hobbs, Clara Tong, Zelin Bakita, Joshua Anderson, James H. |
| description | Semi-partitioned scheduling is an approach to multiprocessor real-time scheduling where most tasks are fixed to processors, while a small subset of tasks is allowed to migrate. This approach offers reduced overhead compared to global scheduling, and can reduce processor capacity loss compared to partitioned scheduling. Prior work has resulted in a number of semi-partitioned scheduling algorithms, but their correctness typically hinges on a complex intertwining of offline task assignment and online execution. This brittleness has resulted in few proposed semi-partitioned scheduling algorithms that support dynamic task systems, where tasks may join or leave the system at runtime, and few that are optimal in any sense. This paper introduces EDF-sc, the first semi-partitioned scheduling algorithm that is optimal for scheduling (static) soft real-time (SRT) sporadic task systems and allows tasks to dynamically join and leave. The SRT notion of optimality provided by EDF-sc requires deadline tardiness to be bounded for any task system that does not cause over-utilization. In the event that all tasks can be assigned as fixed, EDF-sc behaves exactly as partitioned EDF. Heuristics are provided that give EDF-sc the novel ability to
stabilize
the workload to approach the partitioned case as tasks join and leave the system. |
| doi_str_mv | 10.1007/s11241-020-09359-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2503358926</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2503358926</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-53d7fad9d7d13e830fdc3000c1eb212960f5033d5498220df577c2481f5730ba3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKt_wNOC5-gks-kmRyn1Awoe1HNI81G3bHfXJD303xtdwZunGYb3eWfmJeSawS0DaO4SY7xmFDhQUCgUlSdkxkSDlKHEUzIDxTld1DWek4uUdgAgWKNmZPWaTW6t6bpjNYy53Zuucsfe7FtbpSHkKnrT0TL3VfL7lo4m5ja3Q-9dleyHd4eu7beX5CyYLvmr3zon7w-rt-UTXb88Pi_v19QiU5kKdE0wTrnGMfQSITiL5RTL_IYzrhYQBCA6USvJObggmsbyWrLSIGwMzsnN5DvG4fPgU9a74RD7slLzb1JIxRdFxSeVjUNK0Qc9xvJYPGoG-jsuPcWlS1z6Jy4tC4QTlIq43_r4Z_0P9QWr9mzZ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2503358926</pqid></control><display><type>article</type><title>Statically optimal dynamic soft real-time semi-partitioned scheduling</title><source>SpringerLink Journals - AutoHoldings</source><creator>Hobbs, Clara ; Tong, Zelin ; Bakita, Joshua ; Anderson, James H.</creator><creatorcontrib>Hobbs, Clara ; Tong, Zelin ; Bakita, Joshua ; Anderson, James H.</creatorcontrib><description>Semi-partitioned scheduling is an approach to multiprocessor real-time scheduling where most tasks are fixed to processors, while a small subset of tasks is allowed to migrate. This approach offers reduced overhead compared to global scheduling, and can reduce processor capacity loss compared to partitioned scheduling. Prior work has resulted in a number of semi-partitioned scheduling algorithms, but their correctness typically hinges on a complex intertwining of offline task assignment and online execution. This brittleness has resulted in few proposed semi-partitioned scheduling algorithms that support dynamic task systems, where tasks may join or leave the system at runtime, and few that are optimal in any sense. This paper introduces EDF-sc, the first semi-partitioned scheduling algorithm that is optimal for scheduling (static) soft real-time (SRT) sporadic task systems and allows tasks to dynamically join and leave. The SRT notion of optimality provided by EDF-sc requires deadline tardiness to be bounded for any task system that does not cause over-utilization. In the event that all tasks can be assigned as fixed, EDF-sc behaves exactly as partitioned EDF. Heuristics are provided that give EDF-sc the novel ability to
stabilize
the workload to approach the partitioned case as tasks join and leave the system.</description><identifier>ISSN: 0922-6443</identifier><identifier>EISSN: 1573-1383</identifier><identifier>DOI: 10.1007/s11241-020-09359-8</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Communications Engineering ; Computer Science ; Computer Systems Organization and Communication Networks ; Control ; Mechatronics ; Microprocessors ; Multiprocessing ; Networks ; Optimization ; Performance and Reliability ; Real time ; Robotics ; Run time (computers) ; Scheduling ; Special Purpose and Application-Based Systems ; Task scheduling</subject><ispartof>Real-time systems, 2021-04, Vol.57 (1-2), p.97-140</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-53d7fad9d7d13e830fdc3000c1eb212960f5033d5498220df577c2481f5730ba3</citedby><cites>FETCH-LOGICAL-c319t-53d7fad9d7d13e830fdc3000c1eb212960f5033d5498220df577c2481f5730ba3</cites><orcidid>0000-0002-4697-8747</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11241-020-09359-8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11241-020-09359-8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Hobbs, Clara</creatorcontrib><creatorcontrib>Tong, Zelin</creatorcontrib><creatorcontrib>Bakita, Joshua</creatorcontrib><creatorcontrib>Anderson, James H.</creatorcontrib><title>Statically optimal dynamic soft real-time semi-partitioned scheduling</title><title>Real-time systems</title><addtitle>Real-Time Syst</addtitle><description>Semi-partitioned scheduling is an approach to multiprocessor real-time scheduling where most tasks are fixed to processors, while a small subset of tasks is allowed to migrate. This approach offers reduced overhead compared to global scheduling, and can reduce processor capacity loss compared to partitioned scheduling. Prior work has resulted in a number of semi-partitioned scheduling algorithms, but their correctness typically hinges on a complex intertwining of offline task assignment and online execution. This brittleness has resulted in few proposed semi-partitioned scheduling algorithms that support dynamic task systems, where tasks may join or leave the system at runtime, and few that are optimal in any sense. This paper introduces EDF-sc, the first semi-partitioned scheduling algorithm that is optimal for scheduling (static) soft real-time (SRT) sporadic task systems and allows tasks to dynamically join and leave. The SRT notion of optimality provided by EDF-sc requires deadline tardiness to be bounded for any task system that does not cause over-utilization. In the event that all tasks can be assigned as fixed, EDF-sc behaves exactly as partitioned EDF. Heuristics are provided that give EDF-sc the novel ability to
stabilize
the workload to approach the partitioned case as tasks join and leave the system.</description><subject>Algorithms</subject><subject>Communications Engineering</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Control</subject><subject>Mechatronics</subject><subject>Microprocessors</subject><subject>Multiprocessing</subject><subject>Networks</subject><subject>Optimization</subject><subject>Performance and Reliability</subject><subject>Real time</subject><subject>Robotics</subject><subject>Run time (computers)</subject><subject>Scheduling</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Task scheduling</subject><issn>0922-6443</issn><issn>1573-1383</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kE1LAzEQhoMoWKt_wNOC5-gks-kmRyn1Awoe1HNI81G3bHfXJD303xtdwZunGYb3eWfmJeSawS0DaO4SY7xmFDhQUCgUlSdkxkSDlKHEUzIDxTld1DWek4uUdgAgWKNmZPWaTW6t6bpjNYy53Zuucsfe7FtbpSHkKnrT0TL3VfL7lo4m5ja3Q-9dleyHd4eu7beX5CyYLvmr3zon7w-rt-UTXb88Pi_v19QiU5kKdE0wTrnGMfQSITiL5RTL_IYzrhYQBCA6USvJObggmsbyWrLSIGwMzsnN5DvG4fPgU9a74RD7slLzb1JIxRdFxSeVjUNK0Qc9xvJYPGoG-jsuPcWlS1z6Jy4tC4QTlIq43_r4Z_0P9QWr9mzZ</recordid><startdate>20210401</startdate><enddate>20210401</enddate><creator>Hobbs, Clara</creator><creator>Tong, Zelin</creator><creator>Bakita, Joshua</creator><creator>Anderson, James H.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><orcidid>https://orcid.org/0000-0002-4697-8747</orcidid></search><sort><creationdate>20210401</creationdate><title>Statically optimal dynamic soft real-time semi-partitioned scheduling</title><author>Hobbs, Clara ; Tong, Zelin ; Bakita, Joshua ; Anderson, James H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-53d7fad9d7d13e830fdc3000c1eb212960f5033d5498220df577c2481f5730ba3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Communications Engineering</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Control</topic><topic>Mechatronics</topic><topic>Microprocessors</topic><topic>Multiprocessing</topic><topic>Networks</topic><topic>Optimization</topic><topic>Performance and Reliability</topic><topic>Real time</topic><topic>Robotics</topic><topic>Run time (computers)</topic><topic>Scheduling</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Task scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hobbs, Clara</creatorcontrib><creatorcontrib>Tong, Zelin</creatorcontrib><creatorcontrib>Bakita, Joshua</creatorcontrib><creatorcontrib>Anderson, James H.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Real-time systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hobbs, Clara</au><au>Tong, Zelin</au><au>Bakita, Joshua</au><au>Anderson, James H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Statically optimal dynamic soft real-time semi-partitioned scheduling</atitle><jtitle>Real-time systems</jtitle><stitle>Real-Time Syst</stitle><date>2021-04-01</date><risdate>2021</risdate><volume>57</volume><issue>1-2</issue><spage>97</spage><epage>140</epage><pages>97-140</pages><issn>0922-6443</issn><eissn>1573-1383</eissn><abstract>Semi-partitioned scheduling is an approach to multiprocessor real-time scheduling where most tasks are fixed to processors, while a small subset of tasks is allowed to migrate. This approach offers reduced overhead compared to global scheduling, and can reduce processor capacity loss compared to partitioned scheduling. Prior work has resulted in a number of semi-partitioned scheduling algorithms, but their correctness typically hinges on a complex intertwining of offline task assignment and online execution. This brittleness has resulted in few proposed semi-partitioned scheduling algorithms that support dynamic task systems, where tasks may join or leave the system at runtime, and few that are optimal in any sense. This paper introduces EDF-sc, the first semi-partitioned scheduling algorithm that is optimal for scheduling (static) soft real-time (SRT) sporadic task systems and allows tasks to dynamically join and leave. The SRT notion of optimality provided by EDF-sc requires deadline tardiness to be bounded for any task system that does not cause over-utilization. In the event that all tasks can be assigned as fixed, EDF-sc behaves exactly as partitioned EDF. Heuristics are provided that give EDF-sc the novel ability to
stabilize
the workload to approach the partitioned case as tasks join and leave the system.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11241-020-09359-8</doi><tpages>44</tpages><orcidid>https://orcid.org/0000-0002-4697-8747</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0922-6443 |
| ispartof | Real-time systems, 2021-04, Vol.57 (1-2), p.97-140 |
| issn | 0922-6443 1573-1383 |
| language | eng |
| recordid | cdi_proquest_journals_2503358926 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Communications Engineering Computer Science Computer Systems Organization and Communication Networks Control Mechatronics Microprocessors Multiprocessing Networks Optimization Performance and Reliability Real time Robotics Run time (computers) Scheduling Special Purpose and Application-Based Systems Task scheduling |
| title | Statically optimal dynamic soft real-time semi-partitioned scheduling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T08%3A00%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Statically%20optimal%20dynamic%20soft%20real-time%20semi-partitioned%20scheduling&rft.jtitle=Real-time%20systems&rft.au=Hobbs,%20Clara&rft.date=2021-04-01&rft.volume=57&rft.issue=1-2&rft.spage=97&rft.epage=140&rft.pages=97-140&rft.issn=0922-6443&rft.eissn=1573-1383&rft_id=info:doi/10.1007/s11241-020-09359-8&rft_dat=%3Cproquest_cross%3E2503358926%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2503358926&rft_id=info:pmid/&rfr_iscdi=true |