A pre-run-time scheduling algorithm for hard real-time systems
Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on software engineering 1991-07, Vol.17 (7), p.669-677 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 677 |
|---|---|
| container_issue | 7 |
| container_start_page | 669 |
| container_title | IEEE transactions on software engineering |
| container_volume | 17 |
| creator | Shepard, T. Gagne, J.A.M. |
| description | Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.< > |
| doi_str_mv | 10.1109/32.83903 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_32_83903</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>83903</ieee_id><sourcerecordid>1143010</sourcerecordid><originalsourceid>FETCH-LOGICAL-c392t-ca06f911943d4383e84b48c729e13eecb985cddda9647529ab981c22f0d4f9953</originalsourceid><addsrcrecordid>eNqN0U1Lw0AQBuBFFKxV8OotiIiX1N2dbLNzEUrxCwpe9LxsN5M2JR91Nzn035ua4sGLngZmHl4YXsYuBZ8IwfEe5EQDcjhiI4GAMSjJj9mIc9SxUhpP2VkIG865SlM1Yg-zaOsp9l0dt0VFUXBryrqyqFeRLVeNL9p1FeWNj9bWZ5EnWx7cLrRUhXN2ktsy0MVhjtnH0-P7_CVevD2_zmeL2AHKNnaWT3MUAhPIEtBAOlkm2qUSSQCRW6JWLssyi9MkVRJtvxBOypxnSY6oYMxuh9ytbz47Cq2piuCoLG1NTReMRM6nUy7_hloJAPkPqEBrIXQPr3_BTdP5uv_WCFQqlaD26G5AzjcheMrN1heV9TsjuNn3YkCa7156enPIs8HZMve2dkX48QmkQgHv2dXACiL6uQ4RXzA-keU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195572358</pqid></control><display><type>article</type><title>A pre-run-time scheduling algorithm for hard real-time systems</title><source>IEEE Electronic Library (IEL)</source><creator>Shepard, T. ; Gagne, J.A.M.</creator><creatorcontrib>Shepard, T. ; Gagne, J.A.M.</creatorcontrib><description>Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.< ></description><identifier>ISSN: 0098-5589</identifier><identifier>EISSN: 1939-3520</identifier><identifier>DOI: 10.1109/32.83903</identifier><identifier>CODEN: IESEDJ</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Application software ; Applied sciences ; Computer programming ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Deadlines ; Exact sciences and technology ; Experiments ; Multiprocessing ; Other techniques and industries ; Predation ; Processor scheduling ; Real time ; Real time systems ; Runtime ; Schedules ; Scheduling ; Scheduling algorithm ; Senior members ; Software ; Software algorithms ; Software maintenance ; Systems development ; Timing</subject><ispartof>IEEE transactions on software engineering, 1991-07, Vol.17 (7), p.669-677</ispartof><rights>1993 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 1991</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c392t-ca06f911943d4383e84b48c729e13eecb985cddda9647529ab981c22f0d4f9953</citedby><cites>FETCH-LOGICAL-c392t-ca06f911943d4383e84b48c729e13eecb985cddda9647529ab981c22f0d4f9953</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/83903$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/83903$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4371530$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shepard, T.</creatorcontrib><creatorcontrib>Gagne, J.A.M.</creatorcontrib><title>A pre-run-time scheduling algorithm for hard real-time systems</title><title>IEEE transactions on software engineering</title><addtitle>TSE</addtitle><description>Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.< ></description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Application software</subject><subject>Applied sciences</subject><subject>Computer programming</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Deadlines</subject><subject>Exact sciences and technology</subject><subject>Experiments</subject><subject>Multiprocessing</subject><subject>Other techniques and industries</subject><subject>Predation</subject><subject>Processor scheduling</subject><subject>Real time</subject><subject>Real time systems</subject><subject>Runtime</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling algorithm</subject><subject>Senior members</subject><subject>Software</subject><subject>Software algorithms</subject><subject>Software maintenance</subject><subject>Systems development</subject><subject>Timing</subject><issn>0098-5589</issn><issn>1939-3520</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqN0U1Lw0AQBuBFFKxV8OotiIiX1N2dbLNzEUrxCwpe9LxsN5M2JR91Nzn035ua4sGLngZmHl4YXsYuBZ8IwfEe5EQDcjhiI4GAMSjJj9mIc9SxUhpP2VkIG865SlM1Yg-zaOsp9l0dt0VFUXBryrqyqFeRLVeNL9p1FeWNj9bWZ5EnWx7cLrRUhXN2ktsy0MVhjtnH0-P7_CVevD2_zmeL2AHKNnaWT3MUAhPIEtBAOlkm2qUSSQCRW6JWLssyi9MkVRJtvxBOypxnSY6oYMxuh9ytbz47Cq2piuCoLG1NTReMRM6nUy7_hloJAPkPqEBrIXQPr3_BTdP5uv_WCFQqlaD26G5AzjcheMrN1heV9TsjuNn3YkCa7156enPIs8HZMve2dkX48QmkQgHv2dXACiL6uQ4RXzA-keU</recordid><startdate>19910701</startdate><enddate>19910701</enddate><creator>Shepard, T.</creator><creator>Gagne, J.A.M.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>IEEE Computer Society</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>L7M</scope><scope>7SC</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19910701</creationdate><title>A pre-run-time scheduling algorithm for hard real-time systems</title><author>Shepard, T. ; Gagne, J.A.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c392t-ca06f911943d4383e84b48c729e13eecb985cddda9647529ab981c22f0d4f9953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Application software</topic><topic>Applied sciences</topic><topic>Computer programming</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Deadlines</topic><topic>Exact sciences and technology</topic><topic>Experiments</topic><topic>Multiprocessing</topic><topic>Other techniques and industries</topic><topic>Predation</topic><topic>Processor scheduling</topic><topic>Real time</topic><topic>Real time systems</topic><topic>Runtime</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling algorithm</topic><topic>Senior members</topic><topic>Software</topic><topic>Software algorithms</topic><topic>Software maintenance</topic><topic>Systems development</topic><topic>Timing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shepard, T.</creatorcontrib><creatorcontrib>Gagne, J.A.M.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</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>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shepard, T.</au><au>Gagne, J.A.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A pre-run-time scheduling algorithm for hard real-time systems</atitle><jtitle>IEEE transactions on software engineering</jtitle><stitle>TSE</stitle><date>1991-07-01</date><risdate>1991</risdate><volume>17</volume><issue>7</issue><spage>669</spage><epage>677</epage><pages>669-677</pages><issn>0098-5589</issn><eissn>1939-3520</eissn><coden>IESEDJ</coden><abstract>Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines and arbitrary precedence and exclusion constraints. The algorithm uses a branch-and-bound implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed and that all the precedence and exclusion constraints between pairs of processes are satisfied. the algorithm was tested using a model derived from the F-18 mission computer operational flight program.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/32.83903</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0098-5589 |
| ispartof | IEEE transactions on software engineering, 1991-07, Vol.17 (7), p.669-677 |
| issn | 0098-5589 1939-3520 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_32_83903 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Application software Applied sciences Computer programming Computer science control theory systems Computer systems and distributed systems. User interface Deadlines Exact sciences and technology Experiments Multiprocessing Other techniques and industries Predation Processor scheduling Real time Real time systems Runtime Schedules Scheduling Scheduling algorithm Senior members Software Software algorithms Software maintenance Systems development Timing |
| title | A pre-run-time scheduling algorithm for hard real-time systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T14%3A14%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20pre-run-time%20scheduling%20algorithm%20for%20hard%20real-time%20systems&rft.jtitle=IEEE%20transactions%20on%20software%20engineering&rft.au=Shepard,%20T.&rft.date=1991-07-01&rft.volume=17&rft.issue=7&rft.spage=669&rft.epage=677&rft.pages=669-677&rft.issn=0098-5589&rft.eissn=1939-3520&rft.coden=IESEDJ&rft_id=info:doi/10.1109/32.83903&rft_dat=%3Cproquest_RIE%3E1143010%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195572358&rft_id=info:pmid/&rft_ieee_id=83903&rfr_iscdi=true |