{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:10:47Z","timestamp":1740719447561,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11549468_57","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"497-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Target Encoding for Efficient Indirect Jump Prediction"],"prefix":"10.1007","author":[{"given":"Juan Carlos","family":"Moure","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domingo","family":"Benitez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolores Isabel","family":"Rexachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Luque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"57_CR1","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/12.589219","volume":"46","author":"F. Bodin","year":"1997","unstructured":"Bodin, F., Seznec, A.: Skewed associativity improves program performance and enhances predictability. IEEE Trans. on Computers\u00a046(5), 530\u2013544 (1997)","journal-title":"IEEE Trans. on Computers"},{"key":"57_CR2","unstructured":"Burger, D., Austin, T.M.: The SimpleScalar tool set. Univ. Wisconsin-Madison Computer Science Department, Tech. Report TR-1342 (1997)"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Calder, B., Grunwald, D.: Reducing Indirect Function Call Overhead in C+ Programs. In: Proc. 21th Int. Symp. on Principles of Programming Languages, pp. 397\u2013408 (1994)","DOI":"10.1145\/174675.177973"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Calder, B., Grunwald, D.: Next Cache Line and Set Prediction. In: Proc. 22nd Int. Symp. on Computer Architecture, pp. 287\u2013296 (1995)","DOI":"10.1145\/225830.224439"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Chang, P.-Y., Hao, E., Patt, Y.N.: Target Prediction for Indirect Jumps. In: Proc. 24th Int. Symp. on Computer Architecture, pp. 274\u2013283 (1997)","DOI":"10.1145\/384286.264209"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Driesen, K., H\u00f6lzle, U.: The cascaded predictor: economical and adaptive branch target prediction. In: Proc. 31st Intl. Symp. on Microarchitecture, pp. 249\u2013258 (1998)","DOI":"10.1109\/MICRO.1998.742786"},{"issue":"2","key":"57_CR7","first-page":"21","volume":"7","author":"S. Gochman","year":"2003","unstructured":"Gochman, S., et al.: The Intel Pentium M processor: Microarchitecture and Performance. Intel Technology Journal\u00a07(2), 21\u201336 (2003)","journal-title":"Intel Technology Journal"},{"key":"57_CR8","unstructured":"Hinton, G., et al.: The microarchitecture of the Pentium 4 processor. Intel Technology Journal, Q1 (2001)"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Jacobson, Q., Rotenberg, E., Smith, J.E.: Path-based next trace prediction. In: Proc. 30th Int. Symp. on Microarchitecture, pp. 14\u201323 (1997)","DOI":"10.1109\/MICRO.1997.645793"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Juan, T., Sanjeevan, S., Navarro, J.J.: A third level of adaptivity for branch prediction. In: Proc. 25th Int. Symp. on Computer Architecture, pp. 155\u2013166 (1998)","DOI":"10.1145\/279361.279379"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Kaeli, D.R., Emma, P.G.: Branch History Table Prediction of Moving Target Branches due Subroutine Returns. In: Proc. 18th Int. Symp. on Computer Architecture, pp. 34\u201341 (1991)","DOI":"10.1145\/115952.115957"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Kalamatianos, J., Kaeli, D.R.: Predicting indirect branches via data compression. In: Proc. 31st Int. Symp. on Microarchitecture, pp. 272\u2013281 (1998)","DOI":"10.1109\/MICRO.1998.742789"},{"issue":"2","key":"57_CR13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MC.1984.1658927","volume":"17","author":"J.K.F. Lee","year":"1984","unstructured":"Lee, J.K.F., Smith, A.J.: Branch Prediction Strategies and Branch Target Buffer Design. IEEE Computer\u00a017(2), 6\u201322 (1984)","journal-title":"IEEE Computer"},{"key":"57_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-45209-6_81","volume-title":"Euro-Par 2003 Parallel Processing","author":"J.C. Moure","year":"2003","unstructured":"Moure, J.C., Rexachs, D.I., Luque, E.: Optimizing a decoupled front-end architecture: The indexed fetch target buffer (iFTB). In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 566\u2013575. Springer, Heidelberg (2003)"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Yeh, T.-Y., Patt, Y.: Two-Level Adaptive Branch Prediction. In: Proc. 24th Int. Symp. on Microarchitecture, pp. 51\u201361 (1991)","DOI":"10.1145\/123465.123475"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:22:14Z","timestamp":1740633734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11549468_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}