Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For m processors at most m −1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time av...
Gespeichert in:
| Veröffentlicht in: | Real-time systems 2012-01, Vol.48 (1), p.3-33 |
|---|---|
| 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 | 33 |
|---|---|
| container_issue | 1 |
| container_start_page | 3 |
| container_title | Real-time systems |
| container_volume | 48 |
| creator | Burns, A. Davis, R. I. Wang, P. Zhang, F. |
| description | An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For
m
processors at most
m
−1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the
C
=
D
scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the
C
=
D
scheme on Linux or via the Ada programming language are also discussed. |
| doi_str_mv | 10.1007/s11241-011-9126-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_963839325</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>963839325</sourcerecordid><originalsourceid>FETCH-LOGICAL-c391t-61de63c4a2ec93c716a6aa8d2851b524e485b36e4250750603e4b1f2aa421c93</originalsourceid><addsrcrecordid>eNp1kM1Lw0AQxRdRsFb_AG8LHjxFd_Yr2YMHqa0KBXvofdkmm5qaj7qTHPzv3RBBEDwNzPze480j5BrYHTCW3iMAl5AwgMQA14k5ITNQqUhAZOKUzJjhPNFSinNygXhgjClIzYxsNi70VV91rS_o8mlFMX_3xVBX7Z6WXaDNUPfVMXS5R-wC0gHHi6OLhyfaO_ygeKyrvh-Xo7Lxl-SsdDX6q585J9vVcrt4SdZvz6-Lx3WSCwN9oqHwWuTScZ8bkaegnXYuK3imYKe49DJTO6G95IqlimkmvNxByZ2THKJiTm4n25jtc_DY26bC3Ne1a303oDU6_m0EV5G8-UMeuiG0MZvlXBnJODCIFExUHjrE4Et7DFXjwpcFZseG7dSwjQ3bsWE7ZuCTBiPb7n34df5f9A3V3ny6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2259402101</pqid></control><display><type>article</type><title>Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme</title><source>Springer Nature - Complete Springer Journals</source><creator>Burns, A. ; Davis, R. I. ; Wang, P. ; Zhang, F.</creator><creatorcontrib>Burns, A. ; Davis, R. I. ; Wang, P. ; Zhang, F.</creatorcontrib><description>An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For
m
processors at most
m
−1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the
C
=
D
scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the
C
=
D
scheme on Linux or via the Ada programming language are also discussed.</description><identifier>ISSN: 0922-6443</identifier><identifier>EISSN: 1573-1383</identifier><identifier>DOI: 10.1007/s11241-011-9126-9</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Ada (programming language) ; Algorithms ; Communications Engineering ; Computer Science ; Computer Systems Organization and Communication Networks ; Control ; Mechatronics ; Microprocessors ; Multiprocessing ; Multiprocessor ; Networks ; Performance and Reliability ; Processors ; Programming languages ; Robotics ; Run time (computers) ; Scheduling ; Special Purpose and Application-Based Systems ; Splitting ; Task scheduling ; Tasks</subject><ispartof>Real-time systems, 2012-01, Vol.48 (1), p.3-33</ispartof><rights>Springer Science+Business Media, LLC 2011</rights><rights>Real-Time Systems is a copyright of Springer, (2011). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c391t-61de63c4a2ec93c716a6aa8d2851b524e485b36e4250750603e4b1f2aa421c93</citedby><cites>FETCH-LOGICAL-c391t-61de63c4a2ec93c716a6aa8d2851b524e485b36e4250750603e4b1f2aa421c93</cites></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-011-9126-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11241-011-9126-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,778,782,27911,27912,41475,42544,51306</link.rule.ids></links><search><creatorcontrib>Burns, A.</creatorcontrib><creatorcontrib>Davis, R. I.</creatorcontrib><creatorcontrib>Wang, P.</creatorcontrib><creatorcontrib>Zhang, F.</creatorcontrib><title>Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme</title><title>Real-time systems</title><addtitle>Real-Time Syst</addtitle><description>An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For
m
processors at most
m
−1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the
C
=
D
scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the
C
=
D
scheme on Linux or via the Ada programming language are also discussed.</description><subject>Ada (programming language)</subject><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>Multiprocessor</subject><subject>Networks</subject><subject>Performance and Reliability</subject><subject>Processors</subject><subject>Programming languages</subject><subject>Robotics</subject><subject>Run time (computers)</subject><subject>Scheduling</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Splitting</subject><subject>Task scheduling</subject><subject>Tasks</subject><issn>0922-6443</issn><issn>1573-1383</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNp1kM1Lw0AQxRdRsFb_AG8LHjxFd_Yr2YMHqa0KBXvofdkmm5qaj7qTHPzv3RBBEDwNzPze480j5BrYHTCW3iMAl5AwgMQA14k5ITNQqUhAZOKUzJjhPNFSinNygXhgjClIzYxsNi70VV91rS_o8mlFMX_3xVBX7Z6WXaDNUPfVMXS5R-wC0gHHi6OLhyfaO_ygeKyrvh-Xo7Lxl-SsdDX6q585J9vVcrt4SdZvz6-Lx3WSCwN9oqHwWuTScZ8bkaegnXYuK3imYKe49DJTO6G95IqlimkmvNxByZ2THKJiTm4n25jtc_DY26bC3Ne1a303oDU6_m0EV5G8-UMeuiG0MZvlXBnJODCIFExUHjrE4Et7DFXjwpcFZseG7dSwjQ3bsWE7ZuCTBiPb7n34df5f9A3V3ny6</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Burns, A.</creator><creator>Davis, R. I.</creator><creator>Wang, P.</creator><creator>Zhang, F.</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><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120101</creationdate><title>Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme</title><author>Burns, A. ; Davis, R. I. ; Wang, P. ; Zhang, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c391t-61de63c4a2ec93c716a6aa8d2851b524e485b36e4250750603e4b1f2aa421c93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Ada (programming language)</topic><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>Multiprocessor</topic><topic>Networks</topic><topic>Performance and Reliability</topic><topic>Processors</topic><topic>Programming languages</topic><topic>Robotics</topic><topic>Run time (computers)</topic><topic>Scheduling</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Splitting</topic><topic>Task scheduling</topic><topic>Tasks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Burns, A.</creatorcontrib><creatorcontrib>Davis, R. I.</creatorcontrib><creatorcontrib>Wang, P.</creatorcontrib><creatorcontrib>Zhang, F.</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><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Real-time systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Burns, A.</au><au>Davis, R. I.</au><au>Wang, P.</au><au>Zhang, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme</atitle><jtitle>Real-time systems</jtitle><stitle>Real-Time Syst</stitle><date>2012-01-01</date><risdate>2012</risdate><volume>48</volume><issue>1</issue><spage>3</spage><epage>33</epage><pages>3-33</pages><issn>0922-6443</issn><eissn>1573-1383</eissn><abstract>An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For
m
processors at most
m
−1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the
C
=
D
scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the
C
=
D
scheme on Linux or via the Ada programming language are also discussed.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11241-011-9126-9</doi><tpages>31</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0922-6443 |
| ispartof | Real-time systems, 2012-01, Vol.48 (1), p.3-33 |
| issn | 0922-6443 1573-1383 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_963839325 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Ada (programming language) Algorithms Communications Engineering Computer Science Computer Systems Organization and Communication Networks Control Mechatronics Microprocessors Multiprocessing Multiprocessor Networks Performance and Reliability Processors Programming languages Robotics Run time (computers) Scheduling Special Purpose and Application-Based Systems Splitting Task scheduling Tasks |
| title | Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T21%3A30%3A58IST&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=Partitioned%20EDF%20scheduling%20for%20multiprocessors%20using%20a%20C=D%20task%20splitting%20scheme&rft.jtitle=Real-time%20systems&rft.au=Burns,%20A.&rft.date=2012-01-01&rft.volume=48&rft.issue=1&rft.spage=3&rft.epage=33&rft.pages=3-33&rft.issn=0922-6443&rft.eissn=1573-1383&rft_id=info:doi/10.1007/s11241-011-9126-9&rft_dat=%3Cproquest_cross%3E963839325%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=2259402101&rft_id=info:pmid/&rfr_iscdi=true |