{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:33Z","timestamp":1750307673360,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T00:00:00Z","timestamp":1224892800000},"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":[[2008,10,25]]},"DOI":"10.1145\/1454115.1454126","type":"proceedings-article","created":{"date-parts":[[2008,10,28]],"date-time":"2008-10-28T12:18:35Z","timestamp":1225196315000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Skewed redundancy"],"prefix":"10.1145","author":[{"given":"Gordon B.","family":"Bell","sequence":"first","affiliation":[{"name":"IBM, Research Triangle Park, NC, USA"}]},{"given":"Mikko H.","family":"Lipasti","sequence":"additional","affiliation":[{"name":"University of Wisconsin - Madison, Madison, WI, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250720"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/956417.956557"},{"key":"e_1_3_2_1_3_1","volume-title":"ISPASS-4","author":"Bell G.","year":"2004","unstructured":"G. Bell and M. Lipasti . Deconstructing commit . In ISPASS-4 , Austin , Texas, March 2004 . G. Bell and M. Lipasti. Deconstructing commit. In ISPASS-4, Austin, Texas, March 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_6_1","volume-title":"CAECW","author":"Cain H.","year":"2002","unstructured":"H. Cain , K. Lepak , B. Schwarz , and M. Lipasti . Precise and accurate processor simulation . In CAECW , Feb. 2002 . H. Cain, K. Lepak, B. Schwarz, and M. Lipasti. Precise and accurate processor simulation. In CAECW, Feb. 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2004.10008"},{"key":"e_1_3_2_1_9_1","volume-title":"PhD","author":"Dundas J.","year":"1998","unstructured":"J. Dundas . Improving processor performance by dynamically pre-processing the instruction stream . PhD , 1998 . J. Dundas. Improving processor performance by dynamically pre-processing the instruction stream. PhD, 1998."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.23"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/859618.859631"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291020"},{"key":"e_1_3_2_1_13_1","volume-title":"US patent #5805849: Data processing system and method for using an unique identifier to maintain an age relationship between executing instructions","author":"Jordan P.","year":"1997","unstructured":"P. Jordan , B. Konigsburg , H. Le , and S. White . US patent #5805849: Data processing system and method for using an unique identifier to maintain an age relationship between executing instructions , 1997 . P. Jordan, B. Konigsburg, H. Le, and S. White. US patent #5805849: Data processing system and method for using an unique identifier to maintain an age relationship between executing instructions, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"Workshop on Memory Performance Issues","author":"Karkhanis T.","year":"2002","unstructured":"T. Karkhanis and J. Smith . A day in the life of a data cache miss , In Workshop on Memory Performance Issues , 2002 . T. Karkhanis and J. Smith. A day in the life of a data cache miss, In Workshop on Memory Performance Issues, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2004.10011"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.795218"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/545215.545223"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.4288106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/774861.774863"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/545215.545227"},{"key":"e_1_3_2_1_21_1","volume-title":"HPCA-9","author":"Mutlu O","year":"2003","unstructured":"O Mutlu , J Stark , C Wilkerson , and YN Patt . Runahead execution: an alternative to very large instruction windows for out-of-order processors . In HPCA-9 , Jan. 2003 . O Mutlu, J Stark, C Wilkerson, and YN Patt. Runahead execution: an alternative to very large instruction windows for out-of-order processors. In HPCA-9, Jan. 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/563998.564027"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168869"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/339647.339652"},{"key":"e_1_3_2_1_25_1","volume-title":"FTCS-29","author":"Rotenberg E.","year":"1999","unstructured":"E. Rotenberg . AR-SMT : A microarchitectural approach to fault tolerance in microprocessors . In FTCS-29 , June 1999 . E. Rotenberg. AR-SMT: A microarchitectural approach to fault tolerance in microprocessors. In FTCS-29, June 1999."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.87"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.42"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2004.19"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.224451"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024407"},{"key":"e_1_3_2_1_31_1","volume-title":"HPCA-4","author":"Steffan J.","year":"1998","unstructured":"J. Steffan and T Mowry . The potential for using thread-level data speculation to facilitate automatic parallelization . In HPCA-4 , 1998 . J. Steffan and T Mowry. The potential for using thread-level data speculation to facilitate automatic parallelization. In HPCA-4, 1998."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379247"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.18"}],"event":{"name":"PACT '08: International Conference on Parallel Architectures and Compilation Techniques","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Toronto Ontario Canada","acronym":"PACT '08"},"container-title":["Proceedings of the 17th international conference on Parallel architectures and compilation techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454115.1454126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1454115.1454126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:39Z","timestamp":1750253379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454115.1454126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,25]]},"references-count":31,"alternative-id":["10.1145\/1454115.1454126","10.1145\/1454115"],"URL":"https:\/\/doi.org\/10.1145\/1454115.1454126","relation":{},"subject":[],"published":{"date-parts":[[2008,10,25]]},"assertion":[{"value":"2008-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}