Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation patter...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 529 |
|---|---|
| container_issue | |
| container_start_page | 524 |
| container_title | |
| container_volume | |
| creator | Negrean, M. Schliecker, S. Ernst, R. |
| description | As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP). |
| doi_str_mv | 10.1109/DATE.2009.5090720 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5090720</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5090720</ieee_id><sourcerecordid>5090720</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-2f7faf3bbf5c2b134555a4c3aaa19fcce9e8b112d7997c391e289ef736c1ce623</originalsourceid><addsrcrecordid>eNotkMtOwzAURM1LopR-AGLjH0jxtePGXlZQHlIlJFTWleNeq4akqXxdUP6eAN3MWczRLIaxGxBTAGHvHuarxVQKYadaWFFJccImtjLKGhBGgNanbDSkKQYbzv46KGVZqoHm_LdTogBt4ZJdEX0IIbSSdsTwDWnf7QiLHFvkbueaniLxLnCX6piTS7HpufM5frmMG54dfRKPO94emhz3qfNI1CVOPWVsiX_HvOW0dWlwE1J3SINwzS6CawgnR47Z--Nidf9cLF-fXu7nyyJCpXMhQxVcUHUdtJc1qFJr7UqvnHNgg_do0dQAclNZW3llAaWxGCo18-BxJtWY3f7vRkRc71NsXerXx8fUD5HDXh4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Negrean, M. ; Schliecker, S. ; Ernst, R.</creator><creatorcontrib>Negrean, M. ; Schliecker, S. ; Ernst, R.</creatorcontrib><description>As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).</description><identifier>ISSN: 1530-1591</identifier><identifier>ISBN: 9781424437818</identifier><identifier>ISBN: 1424437814</identifier><identifier>EISSN: 1558-1101</identifier><identifier>EISBN: 9783981080155</identifier><identifier>EISBN: 3981080157</identifier><identifier>DOI: 10.1109/DATE.2009.5090720</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer networks ; Delay ; Multiprocessing systems ; Partitioning algorithms ; Processor scheduling ; Protocols ; Real time systems ; Scheduling algorithm ; Testing ; Timing</subject><ispartof>2009 Design, Automation & Test in Europe Conference & Exhibition, 2009, p.524-529</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5090720$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5090720$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Negrean, M.</creatorcontrib><creatorcontrib>Schliecker, S.</creatorcontrib><creatorcontrib>Ernst, R.</creatorcontrib><title>Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources</title><title>2009 Design, Automation & Test in Europe Conference & Exhibition</title><addtitle>DATE</addtitle><description>As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).</description><subject>Computer networks</subject><subject>Delay</subject><subject>Multiprocessing systems</subject><subject>Partitioning algorithms</subject><subject>Processor scheduling</subject><subject>Protocols</subject><subject>Real time systems</subject><subject>Scheduling algorithm</subject><subject>Testing</subject><subject>Timing</subject><issn>1530-1591</issn><issn>1558-1101</issn><isbn>9781424437818</isbn><isbn>1424437814</isbn><isbn>9783981080155</isbn><isbn>3981080157</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMtOwzAURM1LopR-AGLjH0jxtePGXlZQHlIlJFTWleNeq4akqXxdUP6eAN3MWczRLIaxGxBTAGHvHuarxVQKYadaWFFJccImtjLKGhBGgNanbDSkKQYbzv46KGVZqoHm_LdTogBt4ZJdEX0IIbSSdsTwDWnf7QiLHFvkbueaniLxLnCX6piTS7HpufM5frmMG54dfRKPO94emhz3qfNI1CVOPWVsiX_HvOW0dWlwE1J3SINwzS6CawgnR47Z--Nidf9cLF-fXu7nyyJCpXMhQxVcUHUdtJc1qFJr7UqvnHNgg_do0dQAclNZW3llAaWxGCo18-BxJtWY3f7vRkRc71NsXerXx8fUD5HDXh4</recordid><startdate>200904</startdate><enddate>200904</enddate><creator>Negrean, M.</creator><creator>Schliecker, S.</creator><creator>Ernst, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200904</creationdate><title>Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources</title><author>Negrean, M. ; Schliecker, S. ; Ernst, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-2f7faf3bbf5c2b134555a4c3aaa19fcce9e8b112d7997c391e289ef736c1ce623</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Computer networks</topic><topic>Delay</topic><topic>Multiprocessing systems</topic><topic>Partitioning algorithms</topic><topic>Processor scheduling</topic><topic>Protocols</topic><topic>Real time systems</topic><topic>Scheduling algorithm</topic><topic>Testing</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Negrean, M.</creatorcontrib><creatorcontrib>Schliecker, S.</creatorcontrib><creatorcontrib>Ernst, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Negrean, M.</au><au>Schliecker, S.</au><au>Ernst, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources</atitle><btitle>2009 Design, Automation & Test in Europe Conference & Exhibition</btitle><stitle>DATE</stitle><date>2009-04</date><risdate>2009</risdate><spage>524</spage><epage>529</epage><pages>524-529</pages><issn>1530-1591</issn><eissn>1558-1101</eissn><isbn>9781424437818</isbn><isbn>1424437814</isbn><eisbn>9783981080155</eisbn><eisbn>3981080157</eisbn><abstract>As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most known schedulability tests lack a general applicability. Common constraints are a periodic or sporadic task activation pattern, with deadlines no larger than the period, or no support for shared resource arbitration, which is frequently required for embedded systems. In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned multiprocessor system with shared resources. Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).</abstract><pub>IEEE</pub><doi>10.1109/DATE.2009.5090720</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1530-1591 |
| ispartof | 2009 Design, Automation & Test in Europe Conference & Exhibition, 2009, p.524-529 |
| issn | 1530-1591 1558-1101 |
| language | eng |
| recordid | cdi_ieee_primary_5090720 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer networks Delay Multiprocessing systems Partitioning algorithms Processor scheduling Protocols Real time systems Scheduling algorithm Testing Timing |
| title | Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T06%3A03%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Response-time%20analysis%20of%20arbitrarily%20activated%20tasks%20in%20multiprocessor%20systems%20with%20shared%20resources&rft.btitle=2009%20Design,%20Automation%20&%20Test%20in%20Europe%20Conference%20&%20Exhibition&rft.au=Negrean,%20M.&rft.date=2009-04&rft.spage=524&rft.epage=529&rft.pages=524-529&rft.issn=1530-1591&rft.eissn=1558-1101&rft.isbn=9781424437818&rft.isbn_list=1424437814&rft_id=info:doi/10.1109/DATE.2009.5090720&rft_dat=%3Cieee_6IE%3E5090720%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783981080155&rft.eisbn_list=3981080157&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5090720&rfr_iscdi=true |