An exact stochastic analysis of priority-driven periodic real-time systems and its approximations
This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems an...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 2005-11, Vol.54 (11), p.1460-1466 |
|---|---|
| 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 | 1466 |
|---|---|
| container_issue | 11 |
| container_start_page | 1460 |
| container_title | IEEE transactions on computers |
| container_volume | 54 |
| creator | Kanghee Kim Diaz, J.L. Bello, L.L. Lopez, J.M. Chang-Gun Lee Sang Lyul Min |
| description | This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems and can handle, tasks with arbitrary relative deadlines and execution time distributions. |
| doi_str_mv | 10.1109/TC.2005.174 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TC_2005_174</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1514424</ieee_id><sourcerecordid>2351750481</sourcerecordid><originalsourceid>FETCH-LOGICAL-c344t-39aab75966d2eb251549e5d6525d1466247fecfbe95bd8b9709857b68159f5b73</originalsourceid><addsrcrecordid>eNp90U1rHDEMBmATWsg27SnHXoYeSiHMVvZY9vgYljYtBHrZno1nRkMc5mNreUv238dhC4UeehKIRxLoFeJawlZKcJ_3u60CwK20-kJsJKKtnUPzSmwAZFu7RsOleMP8CABGgduIcLtU9BT6XHFe-4fAOfZVWMJ04sjVOlaHFNcU86keUvxNS3Wg0hgKShSmOseZKj5xppnL2FDFXOrhkNanOIcc14XfitdjmJje_alX4ufXL_vdt_r-x9333e193Tda57pxIXQWnTGDok6hRO0IB4MKB6mNUdqO1I8dOeyGtnMWXIu2M61EN2Jnmyvx8by3HP91JM5-jtzTNIWF1iN71YJtFKoCP_0XSmOlBqMNFPrhH_q4HlP5DvvWWARVXEE3Z9SnlTnR6MvP5pBOXoJ_icXvd_4lFl9iKfr9WUci-itRaq108wyYvohQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>867502406</pqid></control><display><type>article</type><title>An exact stochastic analysis of priority-driven periodic real-time systems and its approximations</title><source>IEEE Electronic Library (IEL)</source><creator>Kanghee Kim ; Diaz, J.L. ; Bello, L.L. ; Lopez, J.M. ; Chang-Gun Lee ; Sang Lyul Min</creator><creatorcontrib>Kanghee Kim ; Diaz, J.L. ; Bello, L.L. ; Lopez, J.M. ; Chang-Gun Lee ; Sang Lyul Min</creatorcontrib><description>This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems and can handle, tasks with arbitrary relative deadlines and execution time distributions.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2005.174</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Approximation ; Dynamical systems ; Dynamics ; Handles ; Index Terms- Real-time and embedded systems ; Markov processes ; Probability ; Real time ; Scheduling ; stochastic analysis ; Stochasticity ; Tasks ; Utilization</subject><ispartof>IEEE transactions on computers, 2005-11, Vol.54 (11), p.1460-1466</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c344t-39aab75966d2eb251549e5d6525d1466247fecfbe95bd8b9709857b68159f5b73</citedby><cites>FETCH-LOGICAL-c344t-39aab75966d2eb251549e5d6525d1466247fecfbe95bd8b9709857b68159f5b73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1514424$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1514424$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kanghee Kim</creatorcontrib><creatorcontrib>Diaz, J.L.</creatorcontrib><creatorcontrib>Bello, L.L.</creatorcontrib><creatorcontrib>Lopez, J.M.</creatorcontrib><creatorcontrib>Chang-Gun Lee</creatorcontrib><creatorcontrib>Sang Lyul Min</creatorcontrib><title>An exact stochastic analysis of priority-driven periodic real-time systems and its approximations</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems and can handle, tasks with arbitrary relative deadlines and execution time distributions.</description><subject>Approximation</subject><subject>Dynamical systems</subject><subject>Dynamics</subject><subject>Handles</subject><subject>Index Terms- Real-time and embedded systems</subject><subject>Markov processes</subject><subject>Probability</subject><subject>Real time</subject><subject>Scheduling</subject><subject>stochastic analysis</subject><subject>Stochasticity</subject><subject>Tasks</subject><subject>Utilization</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90U1rHDEMBmATWsg27SnHXoYeSiHMVvZY9vgYljYtBHrZno1nRkMc5mNreUv238dhC4UeehKIRxLoFeJawlZKcJ_3u60CwK20-kJsJKKtnUPzSmwAZFu7RsOleMP8CABGgduIcLtU9BT6XHFe-4fAOfZVWMJ04sjVOlaHFNcU86keUvxNS3Wg0hgKShSmOseZKj5xppnL2FDFXOrhkNanOIcc14XfitdjmJje_alX4ufXL_vdt_r-x9333e193Tda57pxIXQWnTGDok6hRO0IB4MKB6mNUdqO1I8dOeyGtnMWXIu2M61EN2Jnmyvx8by3HP91JM5-jtzTNIWF1iN71YJtFKoCP_0XSmOlBqMNFPrhH_q4HlP5DvvWWARVXEE3Z9SnlTnR6MvP5pBOXoJ_icXvd_4lFl9iKfr9WUci-itRaq108wyYvohQ</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Kanghee Kim</creator><creator>Diaz, J.L.</creator><creator>Bello, L.L.</creator><creator>Lopez, J.M.</creator><creator>Chang-Gun Lee</creator><creator>Sang Lyul Min</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20051101</creationdate><title>An exact stochastic analysis of priority-driven periodic real-time systems and its approximations</title><author>Kanghee Kim ; Diaz, J.L. ; Bello, L.L. ; Lopez, J.M. ; Chang-Gun Lee ; Sang Lyul Min</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c344t-39aab75966d2eb251549e5d6525d1466247fecfbe95bd8b9709857b68159f5b73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Approximation</topic><topic>Dynamical systems</topic><topic>Dynamics</topic><topic>Handles</topic><topic>Index Terms- Real-time and embedded systems</topic><topic>Markov processes</topic><topic>Probability</topic><topic>Real time</topic><topic>Scheduling</topic><topic>stochastic analysis</topic><topic>Stochasticity</topic><topic>Tasks</topic><topic>Utilization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kanghee Kim</creatorcontrib><creatorcontrib>Diaz, J.L.</creatorcontrib><creatorcontrib>Bello, L.L.</creatorcontrib><creatorcontrib>Lopez, J.M.</creatorcontrib><creatorcontrib>Chang-Gun Lee</creatorcontrib><creatorcontrib>Sang Lyul Min</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kanghee Kim</au><au>Diaz, J.L.</au><au>Bello, L.L.</au><au>Lopez, J.M.</au><au>Chang-Gun Lee</au><au>Sang Lyul Min</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An exact stochastic analysis of priority-driven periodic real-time systems and its approximations</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2005-11-01</date><risdate>2005</risdate><volume>54</volume><issue>11</issue><spage>1460</spage><epage>1466</epage><pages>1460-1466</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>This paper describes a stochastic analysis framework which computes the response time distribution and the deadline miss probability of individual tasks, even for systems with a maximum utilization greater than one. The framework is uniformly applied to fixed-priority and dynamic-priority systems and can handle, tasks with arbitrary relative deadlines and execution time distributions.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2005.174</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 2005-11, Vol.54 (11), p.1460-1466 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TC_2005_174 |
| source | IEEE Electronic Library (IEL) |
| subjects | Approximation Dynamical systems Dynamics Handles Index Terms- Real-time and embedded systems Markov processes Probability Real time Scheduling stochastic analysis Stochasticity Tasks Utilization |
| title | An exact stochastic analysis of priority-driven periodic real-time systems and its approximations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T00%3A22%3A54IST&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=An%20exact%20stochastic%20analysis%20of%20priority-driven%20periodic%20real-time%20systems%20and%20its%20approximations&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Kanghee%20Kim&rft.date=2005-11-01&rft.volume=54&rft.issue=11&rft.spage=1460&rft.epage=1466&rft.pages=1460-1466&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2005.174&rft_dat=%3Cproquest_RIE%3E2351750481%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=867502406&rft_id=info:pmid/&rft_ieee_id=1514424&rfr_iscdi=true |