{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:35:10Z","timestamp":1761323710390,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229247"},{"type":"electronic","value":"9783540278665"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27866-5_69","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T20:20:42Z","timestamp":1284668442000},"page":"525-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Mechanism for Verifying Data Speculation"],"prefix":"10.1007","author":[{"given":"Enric","family":"Morancho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Mar\u00eda","family":"Llaber\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c0ngel","family":"Oliv\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Reinman, G., Calder, B.: Predictive techniques for aggressive load speculation. In: International Symposium on Microarchitecture, pp. 127\u2013137 (1998)","key":"69_CR1","DOI":"10.1109\/MICRO.1998.742775"},{"issue":"13","key":"69_CR2","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/S1383-7621(00)00022-9","volume":"46","author":"T. Sato","year":"2000","unstructured":"Sato, T.: Quantitative evaluation of pipelining and decoupling a dynamic instruction scheduling mechanism. Journal of System Architecture\u00a046(13), 1231\u20131252 (2000)","journal-title":"Journal of System Architecture"},{"doi-asserted-by":"crossref","unstructured":"Morancho, E., Llaber\u00eda, J.M., Oliv\u00e9, \u00c0.: Recovery mechanism for latency misprediction. In: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques, pp. 118\u2013128.","key":"69_CR3","DOI":"10.1109\/PACT.2001.953293"},{"issue":"2","key":"69_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/40.755465","volume":"19","author":"R.E. Kessler","year":"1999","unstructured":"Kessler, R.E.: The alpha 21264 microprocessor. IEEE Micro\u00a019(2), 24\u201336 (1999)","journal-title":"IEEE Micro"},{"unstructured":"Diefendorff, K.: Hal makes sparcs fly. Microprocessor Report\u00a013(5) (November 1999)","key":"69_CR5"},{"key":"69_CR6","first-page":"285","volume-title":"24 th. EUROMICRO Conference Volume 1 (EUROMICRO 1998)","author":"T. Sato","year":"1998","unstructured":"Sato, T.: Data dependence speculation using data address prediction and its enhancement with instruction reissue. In: 24 th. EUROMICRO Conference Volume 1 (EUROMICRO 1998), August 1998, pp. 285\u2013292. IEEE Computer Society, Los Alamitos (1998)"},{"unstructured":"Sazeides, Y.: An analysis of value predictability and its application to a superscalar processor. Ph.D. Thesis, University of Wisconsin-Madison (1999)","key":"69_CR7"},{"doi-asserted-by":"crossref","unstructured":"Palacharla, S.: Complexity-effective superscalar processors. Ph.D. Thesis, University of Wisconsin-Madison, Department Computer Science (1998)","key":"69_CR8","DOI":"10.1145\/264107.264201"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/MICRO.2001.991121","volume-title":"Proceedings of the 34th annual ACM\/IEEE international symposium on Microarchitecture","author":"M. Goshima","year":"2001","unstructured":"Goshima, M., Nishino, K., Kitamura, T., Nakashima, Y., Tomita, S., Ichiro Mori, S.: A high-speed dynamic instruction scheduling scheme for superscalar processors. In: Proceedings of the 34th annual ACM\/IEEE international symposium on Microarchitecture, pp. 225\u2013236. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"5","key":"69_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/4.668985","volume":"33","author":"J. Farrell","year":"1998","unstructured":"Farrell, J., Fischer, T.C.: Issue logic for a 600-mhz out-of-order execution microprocessor. IEEE Journal of Solid-State Circuits\u00a033(5), 707\u2013712 (1998)","journal-title":"IEEE Journal of Solid-State Circuits"},{"unstructured":"Burger, D., Austin, T., Bennet, S.: Evaluating future microprocessors: The simplescalar tool set. University of Wisconsin-Madison, Department Computer Science, Tech. Rep. CS-TR-96-1308 (1996)","key":"69_CR11"},{"unstructured":"Morancho, E.: Address prediction and recovery mechanisms. Ph.D. Thesis, Dept. of Computer Architecture, Universidad Polit\u00e8cnica de Catalunya (May 2002)","key":"69_CR12"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2004 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27866-5_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:55:11Z","timestamp":1740520511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27866-5_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229247","9783540278665"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27866-5_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}