{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:56Z","timestamp":1772163956498,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T00:00:00Z","timestamp":1245456000000},"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":[],"published-print":{"date-parts":[[2009,6,20]]},"DOI":"10.1145\/1555754.1555786","type":"proceedings-article","created":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T17:59:19Z","timestamp":1245866359000},"page":"245-254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Decoupled store completion\/silent deterministic replay"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Hilton","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Amir","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/956417.956554"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555785"},{"key":"e_1_3_2_1_3_1","first-page":"90","volume-title":"Proc. 31st Intl. Symp. on Computer Architecture","author":"Cain H.","year":"2004","unstructured":"H. Cain and M. Lipasti . Memory Ordering: A Value Based Definition . In Proc. 31st Intl. Symp. on Computer Architecture , pages 90 -- 101 , Jun. 2004 . H. Cain and M. Lipasti. Memory Ordering: A Value Based Definition. In Proc. 31st Intl. Symp. on Computer Architecture, pages 90--101, Jun. 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2004.3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250697"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.46"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/300979.300993"},{"key":"e_1_3_2_1_8_1","first-page":"431","volume-title":"Proc. 15th Intl. Symp. on High Performance Computer Architecture","author":"Hilton A.","year":"2009","unstructured":"A. Hilton , S. Nagarakatte , and A. Roth . iCFP: Tolerating All-Level Cache Misses in In-Order Pipelines . In Proc. 15th Intl. Symp. on High Performance Computer Architecture , pages 431 -- 442 , Feb. 2009 . A. Hilton, S. Nagarakatte, and A. Roth. iCFP: Tolerating All-Level Cache Misses in In-Order Pipelines. In Proc. 15th Intl. Symp. on High Performance Computer Architecture, pages 431--442, Feb. 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/774861.774863"},{"issue":"1","key":"e_1_3_2_1_10_1","first-page":"1","volume":"7","author":"Michaud P.","year":"2005","unstructured":"P. Michaud . A PPM-like, Tag-Based Branch Predictor . Journal of Instruction Level Parallelism , 7 ( 1 ): 1 -- 10 , Apr. 2005 . P. Michaud. A PPM-like, Tag-Based Branch Predictor. Journal of Instruction Level Parallelism, 7(1):1--10, Apr. 2005.","journal-title":"Journal of Instruction Level Parallelism"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/822080.822823"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299107"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2006.1598112"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258512"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.48"},{"key":"e_1_3_2_1_17_1","first-page":"8","article-title":"Store Vulnerability Window (SVW)","author":"Roth A.","year":"2006","unstructured":"A. Roth . Store Vulnerability Window (SVW) : A Filter and Potential Replacement for Load Re-Execution. Journal of Instruction Level Parallelism , 8 , 2006 . (http:\/\/www.jilp.org\/vol8\/). A. Roth. Store Vulnerability Window (SVW): A Filter and Potential Replacement for Load Re-Execution. Journal of Instruction Level Parallelism, 8, 2006. (http:\/\/www.jilp.org\/vol8\/).","journal-title":"Journal of Instruction Level Parallelism"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2007.15"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1283780.1283863"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250705"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.29"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.39"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024407"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.26"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.16"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250696"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/300979.300983"}],"event":{"name":"ISCA '09: The 36th Annual International Symposium on Computer Architecture","location":"Austin TX USA","acronym":"ISCA '09","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 36th annual international symposium on Computer architecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555754.1555786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1555754.1555786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:29:26Z","timestamp":1750238966000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555754.1555786"}},"subtitle":["enabling scalable data memory for CPR\/CFP processors"],"short-title":[],"issued":{"date-parts":[[2009,6,20]]},"references-count":27,"alternative-id":["10.1145\/1555754.1555786","10.1145\/1555754"],"URL":"https:\/\/doi.org\/10.1145\/1555754.1555786","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1555815.1555786","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,6,20]]},"assertion":[{"value":"2009-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}