{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:31Z","timestamp":1750306531340,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,1,22]],"date-time":"2015-01-22T00:00:00Z","timestamp":1421884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2015,1,22]]},"abstract":"<jats:p>The multiplication of the number of cores inside embedded systems has raised the pressure on the memory hierarchy. The cost of coherence protocol and the scalability problem of the memory hierarchy is nowadays a major issue. In this paper, a specific data management for read-only data is investigated because these data can be duplicated in several memories without being tracked. Based on analysis of standard benchmarks for embedded systems, this analysis shows that read-only data represent 62% of all the data used by applications and 18% of all the memory accesses. A specific data path for read-only data is then evaluated by using simulations. On the first level of the memory hierarchy, removing read-only data of the L1 cache and placing them in another read-only cache improve the data locality of the read-write data by 30% and decrease the total energy consumption of the first level memory by 5%.<\/jats:p>","DOI":"10.1145\/2724942.2724951","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"55-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Specific read only data management for memory hierarchy optimization"],"prefix":"10.1145","volume":"11","author":[{"given":"Gregory","family":"Vaumourin","sequence":"first","affiliation":[{"name":"CEA, LIST, Embedded Computing Laboratory, Gif-sur-Yvette, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dombek","family":"Thomas","sequence":"additional","affiliation":[{"name":"CEA, LIST, Embedded Computing Laboratory, Gif-sur-Yvette, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guerre","family":"Alexandre","sequence":"additional","affiliation":[{"name":"CEA, LIST, Embedded Computing Laboratory, Gif-sur-Yvette, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Barthou","sequence":"additional","affiliation":[{"name":"LaBRI, Bordeaux Institute of Technology, Bordeaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/774789.774805"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11261-4_7"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"e_1_2_1_4_1","volume-title":"processings of the IASTED conference on parallel and distributed computing and systems","author":"Beyls K.","year":"2001","unstructured":"K. Beyls and E. H. Hollander . Reuse distance as a metric for cache behavior . In In processings of the IASTED conference on parallel and distributed computing and systems , 2001 . K. Beyls and E. H. Hollander. Reuse distance as a metric for cache behavior. In In processings of the IASTED conference on parallel and distributed computing and systems, 2001."},{"key":"e_1_2_1_5_1","volume-title":"Operating Systems Theory","author":"Coffman E. G.","year":"1973","unstructured":"E. G. Coffman , Jr. and P. J. Denning . Operating Systems Theory . Prentice Hall Professional Technical Reference , 1973 . E. G. Coffman, Jr. and P. J. Denning. Operating Systems Theory. Prentice Hall Professional Technical Reference, 1973."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.3233\/EMC-2005-00051","article-title":"Heap data allocation to scratch-pad memory in embedded systems","author":"Dominguez A.","year":"2005","unstructured":"A. Dominguez , S. Udayakumaran , and R. Barua . Heap data allocation to scratch-pad memory in embedded systems . J. Embedded Comput. , Dec. 2005 . A. Dominguez, S. Udayakumaran, and R. Barua. Heap data allocation to scratch-pad memory in embedded systems. J. Embedded Comput., Dec. 2005.","journal-title":"J. Embedded Comput."},{"key":"e_1_2_1_7_1","volume-title":"Dinero iv trace-driven uniprocessor cache","author":"Edler J.","year":"1998","unstructured":"J. Edler and M. D. Hill . Dinero iv trace-driven uniprocessor cache . 1998 . J. Edler and M. D. Hill. Dinero iv trace-driven uniprocessor cache. 1998."},{"key":"e_1_2_1_8_1","volume-title":"White Paper","author":"Glaskwsky P.","year":"2009","unstructured":"P. Glaskwsky . Nvida's fermi : The first complete gpu computing architecture . White Paper , 2009 . P. Glaskwsky. Nvida's fermi: The first complete gpu computing architecture. White Paper, 2009."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2238990"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1128020.1128563"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273440.1250707"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.199"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.2"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2030592"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2010.5416638"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2724942.2724951","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2724942.2724951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:13Z","timestamp":1750227133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2724942.2724951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,22]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1,22]]}},"alternative-id":["10.1145\/2724942.2724951"],"URL":"https:\/\/doi.org\/10.1145\/2724942.2724951","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2015,1,22]]},"assertion":[{"value":"2015-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}