Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only...
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 | 110 |
---|---|
container_issue | |
container_start_page | 101 |
container_title | |
container_volume | |
creator | Bui, B.D. Caccamo, M. Lui Sha Martinez, J. |
description | Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case study and experiments show that in a typical real-time embedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment. |
doi_str_mv | 10.1109/RTCSA.2008.42 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4617278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4617278</ieee_id><sourcerecordid>4617278</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-c1fbda91214260e20545bdfd71bf930eb658541120abb7bf36acd02acc1e7e373</originalsourceid><addsrcrecordid>eNotzL1OwzAUQGFLgEQpHZlY_AIp917HcTJWUaGVikBtmCs7vgFDfqrEDH17hGA60jccIe4QlohQPOyr8rBaEkC-TOlC3IDJCq1UWqhLMSNFOkEyeC0W0_QJAAqNKYhmYrPtTraOcmhkaesPlq92jCGGoQ_9uxx6-fzdxpBEO339wp5tK6vQsVx3jr1nLw_nKXI33YqrxrYTL_47F2-P66rcJLuXp2252iUBjY5JjY3ztkDClDJgAp1q5xtv0DWFAnaZznWKSGCdM65Rma09kK1rZMPKqLm4__sGZj6extDZ8XxMMzRkcvUDX99LYQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bui, B.D. ; Caccamo, M. ; Lui Sha ; Martinez, J.</creator><creatorcontrib>Bui, B.D. ; Caccamo, M. ; Lui Sha ; Martinez, J.</creatorcontrib><description>Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case study and experiments show that in a typical real-time embedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment.</description><identifier>ISSN: 2325-1271</identifier><identifier>ISBN: 0769533493</identifier><identifier>ISBN: 9780769533490</identifier><identifier>DOI: 10.1109/RTCSA.2008.42</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; cache partitioning ; Cathode ray tubes ; Genetic algorithms ; Interference ; Optimization ; Partitioning algorithms ; Real time systems</subject><ispartof>2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2008, p.101-110</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/4617278$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4617278$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bui, B.D.</creatorcontrib><creatorcontrib>Caccamo, M.</creatorcontrib><creatorcontrib>Lui Sha</creatorcontrib><creatorcontrib>Martinez, J.</creatorcontrib><title>Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems</title><title>2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications</title><addtitle>RTCSA</addtitle><description>Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case study and experiments show that in a typical real-time embedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment.</description><subject>Algorithm design and analysis</subject><subject>cache partitioning</subject><subject>Cathode ray tubes</subject><subject>Genetic algorithms</subject><subject>Interference</subject><subject>Optimization</subject><subject>Partitioning algorithms</subject><subject>Real time systems</subject><issn>2325-1271</issn><isbn>0769533493</isbn><isbn>9780769533490</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzL1OwzAUQGFLgEQpHZlY_AIp917HcTJWUaGVikBtmCs7vgFDfqrEDH17hGA60jccIe4QlohQPOyr8rBaEkC-TOlC3IDJCq1UWqhLMSNFOkEyeC0W0_QJAAqNKYhmYrPtTraOcmhkaesPlq92jCGGoQ_9uxx6-fzdxpBEO339wp5tK6vQsVx3jr1nLw_nKXI33YqrxrYTL_47F2-P66rcJLuXp2252iUBjY5JjY3ztkDClDJgAp1q5xtv0DWFAnaZznWKSGCdM65Rma09kK1rZMPKqLm4__sGZj6extDZ8XxMMzRkcvUDX99LYQ</recordid><startdate>200808</startdate><enddate>200808</enddate><creator>Bui, B.D.</creator><creator>Caccamo, M.</creator><creator>Lui Sha</creator><creator>Martinez, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200808</creationdate><title>Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems</title><author>Bui, B.D. ; Caccamo, M. ; Lui Sha ; Martinez, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-c1fbda91214260e20545bdfd71bf930eb658541120abb7bf36acd02acc1e7e373</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>cache partitioning</topic><topic>Cathode ray tubes</topic><topic>Genetic algorithms</topic><topic>Interference</topic><topic>Optimization</topic><topic>Partitioning algorithms</topic><topic>Real time systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Bui, B.D.</creatorcontrib><creatorcontrib>Caccamo, M.</creatorcontrib><creatorcontrib>Lui Sha</creatorcontrib><creatorcontrib>Martinez, J.</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>Bui, B.D.</au><au>Caccamo, M.</au><au>Lui Sha</au><au>Martinez, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems</atitle><btitle>2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications</btitle><stitle>RTCSA</stitle><date>2008-08</date><risdate>2008</risdate><spage>101</spage><epage>110</epage><pages>101-110</pages><issn>2325-1271</issn><isbn>0769533493</isbn><isbn>9780769533490</isbn><abstract>Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-time embedded systems need to minimize task real-time utilization (function of execution time and period) instead of only minimizing the number of cache misses. In this work, the partitioning problem is presented as an optimization problem whose solution sets the size of each cache partition and assigns tasks to partitions such that system worst-case utilization is minimized thus increasing real-time schedulability. Since the problem is NP-Hard, a genetic algorithm is presented to find a near optimal solution. A case study and experiments show that in a typical real-time embedded system, the proposed algorithm is able to reduce the worst-case utilization by 15% (on average) if compared to the case when the system uses a shared cache or a proportional cache partitioned environment.</abstract><pub>IEEE</pub><doi>10.1109/RTCSA.2008.42</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2325-1271 |
ispartof | 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2008, p.101-110 |
issn | 2325-1271 |
language | eng |
recordid | cdi_ieee_primary_4617278 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis cache partitioning Cathode ray tubes Genetic algorithms Interference Optimization Partitioning algorithms Real time systems |
title | Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A06%3A05IST&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=Impact%20of%20Cache%20Partitioning%20on%20Multi-tasking%20Real%20Time%20Embedded%20Systems&rft.btitle=2008%2014th%20IEEE%20International%20Conference%20on%20Embedded%20and%20Real-Time%20Computing%20Systems%20and%20Applications&rft.au=Bui,%20B.D.&rft.date=2008-08&rft.spage=101&rft.epage=110&rft.pages=101-110&rft.issn=2325-1271&rft.isbn=0769533493&rft.isbn_list=9780769533490&rft_id=info:doi/10.1109/RTCSA.2008.42&rft_dat=%3Cieee_6IE%3E4617278%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4617278&rfr_iscdi=true |