{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:27:21Z","timestamp":1743740841271,"version":"3.40.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1263-7","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"769-780","source":"Crossref","is-referenced-by-count":0,"title":["Active Store Window: Enabling Far Store-Load Forwarding with Scalability and Complexity-Efficiency"],"prefix":"10.1007","volume":"27","author":[{"given":"Zhen-Hao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Yin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang-Fang","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Lin","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke-Yi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"issue":"1","key":"1263_CR1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"WA Wulf","year":"1995","unstructured":"Wulf W A, McKee S A. Hitting the memory wall: Implications of the obvious. Computer Architecture News, 1995, 23(1): 20\u201324.","journal-title":"Computer Architecture News"},{"key":"1263_CR2","doi-asserted-by":"crossref","unstructured":"Park I, Ooi C\u00a0L, Vijaykumar T\u00a0N. Reducing design complexity of the load\/store queue. In Proc. the 36th MICRO, San Diego, USA, Dec. 3-5, 2003, pp.411\u2013422.","DOI":"10.1109\/MICRO.2003.1253245"},{"key":"1263_CR3","doi-asserted-by":"crossref","unstructured":"Gandhi A, Akkary H, Rajwar R, Srinivasan S\u00a0T, Lai K. Scalable load and store processing in latency tolerant processors. In Proc. the 32nd ISCA, Madison, USA, June 4-8, 2005, pp.446\u2013457.","DOI":"10.1145\/1080695.1070007"},{"key":"1263_CR4","doi-asserted-by":"crossref","unstructured":"Peric\u00e0s M, Cristal A, Cazorla F\u00a0J, Gonz\u00e0lez R, Veidenbaum A, Jim\u00e8nez D A, ValeroM. A two-level load\/store queue based on execution locality. In Proc. the 35th ISCA, Beijing, China, June 21-25, 2008, pp.25\u201336.","DOI":"10.1145\/1394608.1382171"},{"key":"1263_CR5","doi-asserted-by":"crossref","unstructured":"Sethumadhavan S, Desikan R, Burger D, Moore C R, Keckler S\u00a0W. Scalable hardware memory disambiguation for high ILP processors. In Proc. the 36th MICRO, San Diego, USA, Dec. 3-5, 2003, pp.399\u2013410.","DOI":"10.1109\/MICRO.2003.1253244"},{"issue":"2\/3","key":"1263_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1147\/rd.502.0287","volume":"50","author":"L Baugh","year":"2006","unstructured":"Baugh L, Zilles C. Decomposing the load-store queue by function for power reduction and scalability. IBM Journal of Research and Development, 2006, 50(2\/3): 287\u2013297.","journal-title":"IBM Journal of Research and Development"},{"key":"1263_CR7","unstructured":"Sha T\u00a0T, Martin M\u00a0M\u2009K, Roth A. Scalable store-load forwarding via store queue index prediction. In Proc. the 38th MICRO, Barcelona, Spain, Nov. 12-16, 2005, pp.159\u2013170."},{"key":"1263_CR8","doi-asserted-by":"crossref","unstructured":"Stone S\u00a0S, Woley K\u00a0M, Frank M I. Address-indexed memory disambiguation and store-to-load forwarding. In Proc. the 38th MICRO, Barcelona, Spain, Nov. 12-16, 2005, pp.171\u2013182.","DOI":"10.1109\/MICRO.2005.10"},{"key":"1263_CR9","doi-asserted-by":"crossref","unstructured":"Roesner F, Burger D, Keckler S\u00a0W. Counting dependence predictors. In Proc. the 35th ISCA, Beijing, China, June 21-25, 2008, pp.215\u2013226.","DOI":"10.1145\/1394608.1382140"},{"key":"1263_CR10","doi-asserted-by":"crossref","unstructured":"Sha T\u00a0T, Martin M\u00a0M\u2009K, Roth A. NoSQ: Store-load communication without a store queue. In Proc. the 39th MICRO, Orlando, USA, Dec. 9-13, 2006, pp.285\u2013296.","DOI":"10.1109\/MICRO.2006.39"},{"key":"1263_CR11","doi-asserted-by":"crossref","unstructured":"Subramaniam S, Loh G\u00a0H. Fire-and-forget: Load\/store scheduling with no store queue at all. In Proc. the 39th MICRO, Orlando, USA, Dec. 9-13, 2006, pp.273\u2013284.","DOI":"10.1109\/MICRO.2006.26"},{"key":"1263_CR12","doi-asserted-by":"crossref","unstructured":"Garg A, Rashid M\u00a0W, Huang M. Slackened memory dependence enforcement: Combining opportunistic forwarding with decoupled verification. In Proc. the 33rd ISCA, Boston, USA, June 17-21, 2006, pp.142\u2013154.","DOI":"10.1145\/1150019.1136498"},{"key":"1263_CR13","doi-asserted-by":"crossref","unstructured":"Sethumadhavan S, Roesner F, Emer J\u00a0S, Burger D, Keckler S\u00a0W. Late-binding: Enabling unordered load-store queue. In Proc. the 34th ISCA, San Diego, USA, June 9-13, 2007, pp.347\u2013357.","DOI":"10.1145\/1250662.1250705"},{"key":"1263_CR14","unstructured":"Huang R, Garg A, Huang M. Software hardware cooperative memory disambiguation. In Proc. the 12th HPCA, Austin, USA, Feb. 11-15, 2006, pp.244\u2013253."},{"key":"1263_CR15","doi-asserted-by":"crossref","unstructured":"Cain H\u00a0W, Lipasti M\u00a0H. Memory ordering: A value-based approach. In Proc. the 31st ISCA, M\u00fcnchen, Germany, June 19-23, 2004, pp.90\u2013101.","DOI":"10.1145\/1028176.1006709"},{"key":"1263_CR16","doi-asserted-by":"crossref","unstructured":"Roth A. Store vulnerability window: Re-execution filtering for enhanced load optimization. In Proc. the 32nd ISCA, Madison, USA, June 4-8, 2005, pp.458\u2013468.","DOI":"10.1145\/1080695.1070008"},{"key":"1263_CR17","doi-asserted-by":"crossref","unstructured":"Chrysos G Z, Emer J\u00a0S. Memory dependence prediction using store sets. In Proc. the 25th ISCA, Barcelona, Spain, June 27-July 1, 1998, pp.142\u2013153.","DOI":"10.1145\/279361.279378"},{"key":"1263_CR18","doi-asserted-by":"crossref","unstructured":"Moshovos A, Breach S E, Vijaykumar T\u00a0N, Sohi G\u00a0S. Dynamic speculation and synchronization of data dependences. In Proc. the 24th ISCA, Denver, USA, June 2-4, 1997, pp.181\u2013193.","DOI":"10.1145\/384286.264189"},{"key":"1263_CR19","doi-asserted-by":"crossref","unstructured":"Hilton A, Roth A. Decoupled store completion\/silent deterministic replay: Enabling scalable data memory for CPR\/CFP processors. In Proc. the 36th ISCA, Austin, USA, June 20-24, 2009, pp.245\u2013254.","DOI":"10.1145\/1555754.1555786"},{"key":"1263_CR20","doi-asserted-by":"crossref","unstructured":"Hilton A, Roth A. BOLT: Energy-efficient out-of-order latency-tolerant execution. In Proc. the 16th HPCA, Bangalore, India, Jan. 9-14, 2010, pp.1\u201312.","DOI":"10.1109\/HPCA.2010.5416634"},{"key":"1263_CR21","unstructured":"Mutlu O, Stark J, Wilkerson C, Patt Y N. Runahead execution: An alternative to very large instruction windows for out-of-order processors. In Proc. the 9th HPCA, Anaheim, USA, Feb. 8-12, 2003, pp.129\u2013140."},{"key":"1263_CR22","doi-asserted-by":"crossref","unstructured":"Akkary H, Rajwar R, Srinivasan S\u00a0T. Checkpoint processing and recovery: Towards scalable large instruction window processors. In Proc. the 36th MICRO, San Diego, USA, Dec. 3-5, 2003, pp.423\u2013434.","DOI":"10.1109\/MICRO.2003.1253246"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1263-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1263-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1263-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T23:33:48Z","timestamp":1743723228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1263-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1263"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1263-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}