Synthetic traces for trace-driven simulation of cache memories
Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probabil...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 1992-04, Vol.41 (4), p.388-410 |
|---|---|
| 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 | 410 |
|---|---|
| container_issue | 4 |
| container_start_page | 388 |
| container_title | IEEE transactions on computers |
| container_volume | 41 |
| creator | Thiebaut, D. Wolf, J.L. Stone, H.S. |
| description | Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probability law. The second algorithm is a refinement of the first in which the address space has a given finite size. The basic model for the random walk has two parameters that correspond to the working set size and the locality of reference. By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associative memories.< > |
| doi_str_mv | 10.1109/12.135552 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_5420343</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>135552</ieee_id><sourcerecordid>28604797</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-5f27e9aac1eac514aba984662236bc864fab3e12bbc2015e70bc757f63b355c43</originalsourceid><addsrcrecordid>eNpFkDtLxEAUhQdRcF0tbK1SiGCR9c4zmUaQxRcsWKh1mFzvsCN5rDNZYf-9kSxanVt894NzGDvnsOAc7A0XCy611uKAzbjWRW6tNodsBsDL3EoFx-wkpU8AMALsjN2-7rphTUPAbIgOKWW-j9OZf8TwTV2WQrtt3BD6Lut9hg7XlLXU9jFQOmVH3jWJzvY5Z-8P92_Lp3z18vi8vFvlKMEMufaiIOsccnKouXK1s6UyRghpaiyN8q6WxEVdowCuqYAaC114I-uxDCo5Z1eTdxP7ry2loWpDQmoa11G_TZUoDajCFiN4PYEY-5Qi-WoTQ-viruJQ_S5UcVFNC43s5V7qErrGR9dhSH8PWgmQSo7YxYQFIvrXTY4fMi1tDw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28604797</pqid></control><display><type>article</type><title>Synthetic traces for trace-driven simulation of cache memories</title><source>IEEE Electronic Library (IEL)</source><creator>Thiebaut, D. ; Wolf, J.L. ; Stone, H.S.</creator><creatorcontrib>Thiebaut, D. ; Wolf, J.L. ; Stone, H.S.</creatorcontrib><description>Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probability law. The second algorithm is a refinement of the first in which the address space has a given finite size. The basic model for the random walk has two parameters that correspond to the working set size and the locality of reference. By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associative memories.< ></description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.135552</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Bandwidth ; Cache memory ; Computational modeling ; Computer errors ; Computer science ; Computer science; control theory; systems ; Computer simulation ; Drives ; Emulation ; Exact sciences and technology ; Fractals ; Geometry ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Software</subject><ispartof>IEEE transactions on computers, 1992-04, Vol.41 (4), p.388-410</ispartof><rights>1992 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-5f27e9aac1eac514aba984662236bc864fab3e12bbc2015e70bc757f63b355c43</citedby><cites>FETCH-LOGICAL-c306t-5f27e9aac1eac514aba984662236bc864fab3e12bbc2015e70bc757f63b355c43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/135552$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/135552$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5420343$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Thiebaut, D.</creatorcontrib><creatorcontrib>Wolf, J.L.</creatorcontrib><creatorcontrib>Stone, H.S.</creatorcontrib><title>Synthetic traces for trace-driven simulation of cache memories</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probability law. The second algorithm is a refinement of the first in which the address space has a given finite size. The basic model for the random walk has two parameters that correspond to the working set size and the locality of reference. By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associative memories.< ></description><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Cache memory</subject><subject>Computational modeling</subject><subject>Computer errors</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Computer simulation</subject><subject>Drives</subject><subject>Emulation</subject><subject>Exact sciences and technology</subject><subject>Fractals</subject><subject>Geometry</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNpFkDtLxEAUhQdRcF0tbK1SiGCR9c4zmUaQxRcsWKh1mFzvsCN5rDNZYf-9kSxanVt894NzGDvnsOAc7A0XCy611uKAzbjWRW6tNodsBsDL3EoFx-wkpU8AMALsjN2-7rphTUPAbIgOKWW-j9OZf8TwTV2WQrtt3BD6Lut9hg7XlLXU9jFQOmVH3jWJzvY5Z-8P92_Lp3z18vi8vFvlKMEMufaiIOsccnKouXK1s6UyRghpaiyN8q6WxEVdowCuqYAaC114I-uxDCo5Z1eTdxP7ry2loWpDQmoa11G_TZUoDajCFiN4PYEY-5Qi-WoTQ-viruJQ_S5UcVFNC43s5V7qErrGR9dhSH8PWgmQSo7YxYQFIvrXTY4fMi1tDw</recordid><startdate>19920401</startdate><enddate>19920401</enddate><creator>Thiebaut, D.</creator><creator>Wolf, J.L.</creator><creator>Stone, H.S.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19920401</creationdate><title>Synthetic traces for trace-driven simulation of cache memories</title><author>Thiebaut, D. ; Wolf, J.L. ; Stone, H.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-5f27e9aac1eac514aba984662236bc864fab3e12bbc2015e70bc757f63b355c43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Cache memory</topic><topic>Computational modeling</topic><topic>Computer errors</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Computer simulation</topic><topic>Drives</topic><topic>Emulation</topic><topic>Exact sciences and technology</topic><topic>Fractals</topic><topic>Geometry</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Thiebaut, D.</creatorcontrib><creatorcontrib>Wolf, J.L.</creatorcontrib><creatorcontrib>Stone, H.S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems 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><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thiebaut, D.</au><au>Wolf, J.L.</au><au>Stone, H.S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Synthetic traces for trace-driven simulation of cache memories</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1992-04-01</date><risdate>1992</risdate><volume>41</volume><issue>4</issue><spage>388</spage><epage>410</epage><pages>388-410</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>Two techniques for producing synthetic address traces that produce good emulations of the locality of reference of real programs are presented. The first algorithm generates synthetic addresses by simulating a random walk in an infinite address-space with references governed by a hyperbolic probability law. The second algorithm is a refinement of the first in which the address space has a given finite size. The basic model for the random walk has two parameters that correspond to the working set size and the locality of reference. By comparing synthetic traces with real traces of identical locality parameters, it is demonstrated that synthetic traces exhibit miss ratios and lifetime functions that compare well with those of the real traces they mimic, both in fully associative and in set-associative memories.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/12.135552</doi><tpages>23</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 1992-04, Vol.41 (4), p.388-410 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_5420343 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Bandwidth Cache memory Computational modeling Computer errors Computer science Computer science control theory systems Computer simulation Drives Emulation Exact sciences and technology Fractals Geometry Memory and file management (including protection and security) Memory organisation. Data processing Software |
| title | Synthetic traces for trace-driven simulation of cache memories |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T16%3A15%3A31IST&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=Synthetic%20traces%20for%20trace-driven%20simulation%20of%20cache%20memories&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Thiebaut,%20D.&rft.date=1992-04-01&rft.volume=41&rft.issue=4&rft.spage=388&rft.epage=410&rft.pages=388-410&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.135552&rft_dat=%3Cproquest_RIE%3E28604797%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=28604797&rft_id=info:pmid/&rft_ieee_id=135552&rfr_iscdi=true |