{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:38:34Z","timestamp":1774449514130,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1023\/a:1026431920605","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T16:45:40Z","timestamp":1068137140000},"page":"35-58","source":"Crossref","is-referenced-by-count":22,"title":["An Exploration of Instruction Fetch Requirement in Out-of-Order Superscalar Processors"],"prefix":"10.1007","volume":"29","author":[{"given":"Pierre","family":"Michaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Seznec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Jourdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"15","key":"229447_CR1","first-page":"1","volume":"13","author":"K. Diefendorff","year":"1999","unstructured":"Keith Diefendorff, Hal makes Sparcs fly, Microprocessor Report\n13(15):1-12 (November 1999).","journal-title":"Microprocessor Report"},{"key":"229447_CR2","unstructured":"E. Rotenberg, S. Bennett, and J. E. Smith, Trace cache: A low latency approach to high bandwidth instruction fetching, Proc. 29th Int'l. Symp. on Microarchitecture (1996)."},{"key":"229447_CR3","doi-asserted-by":"crossref","unstructured":"T. M. Conte, K. N. Menezes, P. M. Mills, and B. A. Patel, Optimization of instruction fetch mechanisms for high issue rates, Proc. 22nd Ann. Int'l. Symp. on Computer Architecture (1995).","DOI":"10.1145\/223982.224444"},{"key":"229447_CR4","doi-asserted-by":"crossref","unstructured":"A. Seznec, S. Jourdan, P. Sainrat, and P. Michaud, Multiple-block ahead branch predictor, Proc. Seventh Int'l. Conf. Architectural Support for Progr. Lang. Operat. Syst. (1996).","DOI":"10.1145\/237090.237169"},{"key":"229447_CR5","doi-asserted-by":"crossref","unstructured":"T.-Y. Yeh, D. T. Marr, and Y. N. Patt, Increasing the instruction fetch rate via multiple branch prediction and a branch address cache, Proc. Seventh ACM Int'l. Conf. on Super-computing (July 1993).","DOI":"10.1145\/165939.165956"},{"key":"229447_CR6","unstructured":"Tse-Yu Yeh and Yale Patt, Branch history table indexing to prevent pipeline bubbles in wide-issue superscalar processors, Proc. 26th Int'l. Symp. on Microarchitedcture (1993)."},{"key":"229447_CR7","doi-asserted-by":"crossref","unstructured":"P.-Y. Chang, E. Hao, and Y. N. Patt, Target prediction for indirect jumps, Proc. 24th Ann. Int'l. Symp. on Computer Architecture (1997).","DOI":"10.1145\/264107.264209"},{"key":"229447_CR8","unstructured":"R. Uhlig, D. Nagle, T. Mudge, S. Sechrest, and J. Emer, Coping with code bloat, Proc. 22nd Ann. Int'l. Symp. on Computer Architecture (June 1995)."},{"key":"229447_CR9","doi-asserted-by":"crossref","unstructured":"P. Michaud, A. Seznec, and R. Uhlig, Trading conflict and capacity aliasing in conditional branch predictors,Proc. 24th Ann. Int'l. Symp. on Computer Architecture (1997).","DOI":"10.1145\/264107.264211"},{"key":"229447_CR10","unstructured":"Karel Driesen and Urs Holzle, The cascaded predictor: Economical and adaptive branch target prediction, Proc. 31st Ann. Int'l. Symp. on Microarchitecture (1998)."},{"key":"229447_CR11","doi-asserted-by":"crossref","unstructured":"Brad Calder and Dirk Grunwald, Reducing branch costs via branch alignment, Proc. Sixth Int'l. Conf. Architectural Support for Progr. Lang. Operat. Syst. (1994).","DOI":"10.1145\/195473.195553"},{"key":"229447_CR12","unstructured":"Pierre Michaud, Andr\u00e9 Seznec, and St\u00e9phan Jourdan, Exploring instruction-fetch bandwidth requirement in wide-issue superscalar processors, Proc. Int'l. Conf. Parallel Architectures and Compilation Techniques (October 1999)."},{"issue":"12","key":"229447_CR13","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/T-C.1972.223514","volume":"C-21","author":"E. Riseman","year":"1972","unstructured":"Edward Riseman and Caxton Foster, The inhibition of potential parallelism by conditional jumps, IEEE Trans. on Computer Architectures C-21(12):1405-1411 (December 1972).","journal-title":"IEEE Trans. on Computer Architectures"},{"key":"229447_CR14","unstructured":"A. Klauser, T. Austin, D. Grunwald, and B. Calder, Dynamic Hammock predication for nonpredicated instruction set architectures,Proc. Int'l. Conf. on Parallel Architectures and Compilation Techniques (1998)."},{"key":"229447_CR15","doi-asserted-by":"crossref","unstructured":"Artur Klauser, Abhijit Paithankar, and Dirk Grunwald, Selective Eager execution on the polypath architecture, Proc. 25th Ann. Int'l. Symp. on Computer Architecture (1998).","DOI":"10.1145\/279361.279393"},{"key":"229447_CR16","doi-asserted-by":"crossref","unstructured":"Scott A. Mahlke, Richard E. Hank, Roger A. Bringmann, John C. Gyllenhaal, David M. Gallagher, and Wen-mei W. Hwu, Characterizing the impact of predicated execution on branch prediction, Proc. 27th Ann. Int'l. Symp. on Microarchitecture (1994).","DOI":"10.1145\/192724.192755"},{"key":"229447_CR17","unstructured":"S. Jourdan, R. Ronen, M. Bekerman, B. Shomar, and A. Yoaz, A novel renaming scheme to exploit value temporal locality through physical register reuse and unification, Proc. 31st Ann. Int'l. Symp. on Microarchitecture (1998)."},{"key":"229447_CR18","unstructured":"M. H. Lipasti and J. P. Shen, Exceeding the dataflow limit with value prediction, Proc. 29th Int'l. Symp. on Microarchitecture (1996)."},{"key":"229447_CR19","unstructured":"Y. Sazeides, S. Vassiliadis, and J. E. Smith, The performance potential of data dependence speculation and collapsing, Proc. 29th Int'l. Symp. on Microarchitecture (1996)."},{"key":"229447_CR20","doi-asserted-by":"crossref","unstructured":"A. Sodani and G. S. Sohi, Dynamic instruction reuse, Proc. 24th Ann. Int'l. Symp. on Computer Architecture (1997). 58 Michaud, Seznec, and Jourdan","DOI":"10.1145\/264107.264200"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026431920605.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026431920605\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026431920605.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:36:46Z","timestamp":1748335006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026431920605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["229447"],"URL":"https:\/\/doi.org\/10.1023\/a:1026431920605","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}