Probabilistic timing analysis on conventional cache designs

Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 −16 ), resulting in far tighter bounds than conventional analyses. However,...

Full description

Saved in:
Bibliographic Details
Main Authors: Kosmidis, Leonidas, Curtsinger, Charlie, Quinones, Eduardo, Abella, Jaume, Berger, Emery, Cazorla, Francisco J.
Format: Conference Proceeding
Language:English
Subjects:
Hardware
Layout
Probabilistic logic
Program processors
Runtime
Timing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 606
container_issue
container_start_page 603
container_title
container_volume
creator Kosmidis, Leonidas
Curtsinger, Charlie
Quinones, Eduardo
Abella, Jaume
Berger, Emery
Cazorla, Francisco J.
description Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 −16 ), resulting in far tighter bounds than conventional analyses. However, the applicability of PTA has been limited because of its dependence on relatively exotic hardware: fully-associative caches using random replacement. This paper extends the applicability of PTA to conventional cache designs via a software-only approach. We show that, by using a combination of compiler techniques and runtime system support to randomise the memory layout of both code and data, conventional caches behave as fully-associative ones with random replacement.
doi_str_mv 10.7873/DATE.2013.132
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6513578</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6513578</ieee_id><sourcerecordid>6513578</sourcerecordid><originalsourceid>FETCH-LOGICAL-c217t-21489b4959778ad34005e892c891cbf18eec723fb487b4ecdc1091aeb63a6c53</originalsourceid><addsrcrecordid>eNotkMtOwzAURM1LopQsWbHxDyT4-tqxLVZVWx5SJVhkX9mOU4xSB8URUv-eIFiNNGd0FkPIHbBKaYUPm1WzrTgDrAD5GSmM0mg0SFSMsXOyACl1CcDggtyAqBVKpoBd_gJkJUgD16TI-XNeA6DhyBfk8X0cnHWxj3mKnk7xGNOB2mT7U46ZDon6IX2HNMVh7qi3_iPQNuR4SPmWXHW2z6H4zyVpnrbN-qXcvT2_rle70nNQU8lBaOOEkUYpbVsUjMmgDffagHcd6BC84tg5oZUTwbcemAEbXI229hKX5P5PG0MI-68xHu142tcSUM4H_AAXC0ti</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Probabilistic timing analysis on conventional cache designs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kosmidis, Leonidas ; Curtsinger, Charlie ; Quinones, Eduardo ; Abella, Jaume ; Berger, Emery ; Cazorla, Francisco J.</creator><creatorcontrib>Kosmidis, Leonidas ; Curtsinger, Charlie ; Quinones, Eduardo ; Abella, Jaume ; Berger, Emery ; Cazorla, Francisco J.</creatorcontrib><description>Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 −16 ), resulting in far tighter bounds than conventional analyses. However, the applicability of PTA has been limited because of its dependence on relatively exotic hardware: fully-associative caches using random replacement. This paper extends the applicability of PTA to conventional cache designs via a software-only approach. We show that, by using a combination of compiler techniques and runtime system support to randomise the memory layout of both code and data, conventional caches behave as fully-associative ones with random replacement.</description><identifier>ISSN: 1530-1591</identifier><identifier>ISBN: 1467350710</identifier><identifier>ISBN: 9781467350716</identifier><identifier>EISSN: 1558-1101</identifier><identifier>EISBN: 9783981537000</identifier><identifier>EISBN: 3981537009</identifier><identifier>DOI: 10.7873/DATE.2013.132</identifier><language>eng</language><publisher>IEEE</publisher><subject>Hardware ; Layout ; Probabilistic logic ; Program processors ; Runtime ; Timing</subject><ispartof>2013 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2013, p.603-606</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6513578$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6513578$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kosmidis, Leonidas</creatorcontrib><creatorcontrib>Curtsinger, Charlie</creatorcontrib><creatorcontrib>Quinones, Eduardo</creatorcontrib><creatorcontrib>Abella, Jaume</creatorcontrib><creatorcontrib>Berger, Emery</creatorcontrib><creatorcontrib>Cazorla, Francisco J.</creatorcontrib><title>Probabilistic timing analysis on conventional cache designs</title><title>2013 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)</title><addtitle>DATE</addtitle><description>Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 −16 ), resulting in far tighter bounds than conventional analyses. However, the applicability of PTA has been limited because of its dependence on relatively exotic hardware: fully-associative caches using random replacement. This paper extends the applicability of PTA to conventional cache designs via a software-only approach. We show that, by using a combination of compiler techniques and runtime system support to randomise the memory layout of both code and data, conventional caches behave as fully-associative ones with random replacement.</description><subject>Hardware</subject><subject>Layout</subject><subject>Probabilistic logic</subject><subject>Program processors</subject><subject>Runtime</subject><subject>Timing</subject><issn>1530-1591</issn><issn>1558-1101</issn><isbn>1467350710</isbn><isbn>9781467350716</isbn><isbn>9783981537000</isbn><isbn>3981537009</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkMtOwzAURM1LopQsWbHxDyT4-tqxLVZVWx5SJVhkX9mOU4xSB8URUv-eIFiNNGd0FkPIHbBKaYUPm1WzrTgDrAD5GSmM0mg0SFSMsXOyACl1CcDggtyAqBVKpoBd_gJkJUgD16TI-XNeA6DhyBfk8X0cnHWxj3mKnk7xGNOB2mT7U46ZDon6IX2HNMVh7qi3_iPQNuR4SPmWXHW2z6H4zyVpnrbN-qXcvT2_rle70nNQU8lBaOOEkUYpbVsUjMmgDffagHcd6BC84tg5oZUTwbcemAEbXI229hKX5P5PG0MI-68xHu142tcSUM4H_AAXC0ti</recordid><startdate>201303</startdate><enddate>201303</enddate><creator>Kosmidis, Leonidas</creator><creator>Curtsinger, Charlie</creator><creator>Quinones, Eduardo</creator><creator>Abella, Jaume</creator><creator>Berger, Emery</creator><creator>Cazorla, Francisco J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201303</creationdate><title>Probabilistic timing analysis on conventional cache designs</title><author>Kosmidis, Leonidas ; Curtsinger, Charlie ; Quinones, Eduardo ; Abella, Jaume ; Berger, Emery ; Cazorla, Francisco J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c217t-21489b4959778ad34005e892c891cbf18eec723fb487b4ecdc1091aeb63a6c53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Hardware</topic><topic>Layout</topic><topic>Probabilistic logic</topic><topic>Program processors</topic><topic>Runtime</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Kosmidis, Leonidas</creatorcontrib><creatorcontrib>Curtsinger, Charlie</creatorcontrib><creatorcontrib>Quinones, Eduardo</creatorcontrib><creatorcontrib>Abella, Jaume</creatorcontrib><creatorcontrib>Berger, Emery</creatorcontrib><creatorcontrib>Cazorla, Francisco 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/IET Electronic Library</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>Kosmidis, Leonidas</au><au>Curtsinger, Charlie</au><au>Quinones, Eduardo</au><au>Abella, Jaume</au><au>Berger, Emery</au><au>Cazorla, Francisco J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Probabilistic timing analysis on conventional cache designs</atitle><btitle>2013 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)</btitle><stitle>DATE</stitle><date>2013-03</date><risdate>2013</risdate><spage>603</spage><epage>606</epage><pages>603-606</pages><issn>1530-1591</issn><eissn>1558-1101</eissn><isbn>1467350710</isbn><isbn>9781467350716</isbn><eisbn>9783981537000</eisbn><eisbn>3981537009</eisbn><abstract>Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 −16 ), resulting in far tighter bounds than conventional analyses. However, the applicability of PTA has been limited because of its dependence on relatively exotic hardware: fully-associative caches using random replacement. This paper extends the applicability of PTA to conventional cache designs via a software-only approach. We show that, by using a combination of compiler techniques and runtime system support to randomise the memory layout of both code and data, conventional caches behave as fully-associative ones with random replacement.</abstract><pub>IEEE</pub><doi>10.7873/DATE.2013.132</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-1591
ispartof 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2013, p.603-606
issn 1530-1591
1558-1101
language eng
recordid cdi_ieee_primary_6513578
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Hardware
Layout
Probabilistic logic
Program processors
Runtime
Timing
title Probabilistic timing analysis on conventional cache designs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T04%3A22%3A02IST&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=Probabilistic%20timing%20analysis%20on%20conventional%20cache%20designs&rft.btitle=2013%20Design,%20Automation%20&%20Test%20in%20Europe%20Conference%20&%20Exhibition%20(DATE)&rft.au=Kosmidis,%20Leonidas&rft.date=2013-03&rft.spage=603&rft.epage=606&rft.pages=603-606&rft.issn=1530-1591&rft.eissn=1558-1101&rft.isbn=1467350710&rft.isbn_list=9781467350716&rft_id=info:doi/10.7873/DATE.2013.132&rft.eisbn=9783981537000&rft.eisbn_list=3981537009&rft_dat=%3Cieee_6IE%3E6513578%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c217t-21489b4959778ad34005e892c891cbf18eec723fb487b4ecdc1091aeb63a6c53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6513578&rfr_iscdi=true