{"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":1743740841166,"version":"3.40.3"},"reference-count":30,"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-1262-8","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"754-768","source":"Crossref","is-referenced-by-count":1,"title":["SWIP Prediction: Complexity-Effective Indirect-Branch Prediction Using Pointers"],"prefix":"10.1007","volume":"27","author":[{"given":"Zi-Chao","family":"Xie","sequence":"first","affiliation":[]},{"given":"Dong","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Ming-Kai","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Qin-Qing","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1262_CR1","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez D A, Lin C. Dynamic branch prediction with perceptrons. In Proc. the 7th HPCA, Jan. 2001, pp.197\u2013206.","DOI":"10.1109\/HPCA.2001.903263"},{"key":"1262_CR2","unstructured":"McFarling S. Combining branch predictors. Technical Report TN-36, Western Research Laboratory, June 1993."},{"key":"1262_CR3","unstructured":"Kim H, Mutlu O, Stark J, Patt Y. Wish branches: Combining conditional branching and predication for adaptive predicated execution. In Proc. the 38th MICRO, Nov. 2005, pp.43\u201354."},{"key":"1262_CR4","doi-asserted-by":"crossref","unstructured":"Seznec A. Analysis of the O-GEometric history length branch predictor. In Proc. the 32nd ISCA, Jun. 2005, pp.394\u2013405.","DOI":"10.1145\/1080695.1070003"},{"key":"1262_CR5","doi-asserted-by":"crossref","unstructured":"Yeh T Y, Patt Y. A comparison of dynamic branch predictors that use two levels of branch history. In Proc. the 20th ISCA, May 1993, pp.257\u2013266.","DOI":"10.1145\/173682.165161"},{"issue":"4","key":"1262_CR6","first-page":"323","volume":"2","author":"B Calder","year":"1994","unstructured":"Calder B, Grunwald D, Zorn B. Quantifying behavioral differences between C and C++ programs. Journal of Programming Languages, 1994, 2(4): 323\u2013351.","journal-title":"Journal of Programming Languages"},{"key":"1262_CR7","doi-asserted-by":"crossref","unstructured":"Chang P Y, Hao E, Patt Y. Target prediction for indirect jumps. In Proc. the 24th ISCA, June 1997, pp.274\u2013283.","DOI":"10.1145\/384286.264209"},{"key":"1262_CR8","doi-asserted-by":"crossref","unstructured":"Driesen K, H\u00f6lzle U. The cascaded predictor: Economical and adaptive branch target prediction. In Proc. the 31st MICRO, Nov. 30-Dec. 2 1998, pp.249\u2013258.","DOI":"10.1109\/MICRO.1998.742786"},{"key":"1262_CR9","doi-asserted-by":"crossref","unstructured":"Kim H, Joao J A, Mutlu O, Lee C\u00a0J, Patt Y, Cohn R. VPC prediction: Reducing the cost of indirect branches via hardware-based dynamic devirtualization. In Proc. the 34th ISCA, June 2007, pp.424\u2013435.","DOI":"10.1145\/1250662.1250715"},{"key":"1262_CR10","unstructured":"Driesen K, H\u00f6zle U. Accurate indirect branch prediction. Technical Report TRCS97-19, University of California, March 1998."},{"key":"1262_CR11","doi-asserted-by":"crossref","unstructured":"Kalamatianos J, Kaeli D R. Predicting indirect branches via data compression. In Proc. the 31st MICRO, Nov. 30-Dec. 2, 1998, pp.272\u2013281.","DOI":"10.1109\/MICRO.1998.742789"},{"key":"1262_CR12","doi-asserted-by":"crossref","unstructured":"Driesen K, H\u00f6lzle U. Multi-stage cascaded prediction. In Proc. the 5th Euro-Par Conference on Parallel Processing, Aug. 31-Sept. 3, 1999, pp.1312\u20131321.","DOI":"10.1007\/3-540-48311-X_186"},{"issue":"1","key":"1262_CR13","first-page":"1","volume":"8","author":"A Seznec","year":"2006","unstructured":"Seznec A, Michaud P. A case for (partially) TAgged GEometric history length branch prediction. Journal of Instruction-Level Parallelism (JILP), 2006, 8(1): 1\u201323.","journal-title":"Journal of Instruction-Level Parallelism (JILP)"},{"key":"1262_CR14","doi-asserted-by":"crossref","unstructured":"Joao J A, Mutlu O, Kim H, Agarwal R, Patt Y. Improving the performance of object-oriented languages with dynamic predication of indirect jumps. In Proc. the 13th ASPLOS, March 2008, pp.80\u201390.","DOI":"10.1145\/1346281.1346293"},{"key":"1262_CR15","doi-asserted-by":"crossref","unstructured":"Farooq M, Chen L, John L\u00a0K. Value based BTB indexing for indirect jump prediction. In Proc. the 16th HPCA, Jan. 2010.","DOI":"10.1109\/HPCA.2010.5416659"},{"key":"1262_CR16","doi-asserted-by":"crossref","unstructured":"Azizi O, Mahesri A, Lee B C, Patel S\u00a0J, Horowitz M. Energy-performance tradeoffs in processor architecture and circuit design: A marginal cost analysis. In Proc. the 37th ISCA, Jun. 2010, pp.26\u201336.","DOI":"10.1145\/1815961.1815967"},{"key":"1262_CR17","doi-asserted-by":"crossref","unstructured":"Hameed R, Qadeer W, Wachs M et al. Understanding sources of inefficiency in general-purpose chips. In Proc. the 37th ISCA, June 2010, pp.37\u201347.","DOI":"10.1145\/1815961.1815968"},{"key":"1262_CR18","doi-asserted-by":"crossref","unstructured":"Lin Y L. Essential Issues in System-On-a-Chip Design, Springer-Verlag, 2006.","DOI":"10.1007\/1-4020-5352-5"},{"issue":"1","key":"1262_CR19","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MC.1984.1658927","volume":"17","author":"JKF Lee","year":"1984","unstructured":"Lee J K F, Smith A J. Branch prediction strategies and branch target buffer design. IEEE Computer, 1984, 17(1): 6\u201322.","journal-title":"IEEE Computer"},{"key":"1262_CR20","doi-asserted-by":"crossref","unstructured":"Yeh T Y, Patt Y. Two-level adaptive training branch prediction. In Proc. the 24th MICRO, Nov. 1991, pp.51\u201361.","DOI":"10.1145\/123465.123475"},{"key":"1262_CR21","doi-asserted-by":"crossref","unstructured":"Roth A, Moshovos A, Sohi G\u00a0S. Improving virtual function call target prediction via dependence-based pre-computation. In Proc. the 13th ICS, June 1999, pp.356\u2013364.","DOI":"10.1145\/305138.305213"},{"issue":"2","key":"1262_CR22","first-page":"21","volume":"7","author":"S Gochman","year":"2003","unstructured":"Gochman S, Ronen R, Anati I et al. The Intel\u00ae Pentium\u00ae M processor: Microarchitecture and performance. Intel Technology Journal, 2003, 7(2): 21\u201359.","journal-title":"Intel Technology Journal"},{"key":"1262_CR23","unstructured":"IBM. IBM PowerPC 970FX RISC Microprocessor user\u2019s manual. Version 2.3, March 2008."},{"key":"1262_CR24","unstructured":"SPEC. Standard Performance Evaluation Corporation. http:\/\/www.spec.org , July 2011."},{"issue":"3","key":"1262_CR25","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/268806.268810","volume":"25","author":"D Burger","year":"1997","unstructured":"Burger D, Austin T\u00a0M. The simpleScalar tool set, version 2.0. SIGARCH Comput. Archit. News, 1997, 25(3): 13\u201325.","journal-title":"SIGARCH Comput. Archit. News"},{"key":"1262_CR26","doi-asserted-by":"crossref","unstructured":"Brooks D, Tiwari V, Martonosi M. Wattch: A framework for architectural-level power analysis and optimizations. In Proc. the 27th ISCA, June 2000, pp.83\u201394.","DOI":"10.1145\/342001.339657"},{"key":"1262_CR27","unstructured":"Wolczko M. Benchmarking Java with the Richards benchmark. http:\/\/research.sun.com\/people\/mario\/java_benchmarking\/richards\/richards.html , July 2011."},{"key":"1262_CR28","doi-asserted-by":"crossref","unstructured":"Perelman E, Hamerly G, Van Biesbrouck M et al. Using Sim-Point for accurate and efficient simulation. In Proc. SIGMETRICS, June 2003, pp.318\u2013319.","DOI":"10.1145\/885651.781076"},{"key":"1262_CR29","doi-asserted-by":"crossref","unstructured":"Yeh T Y, Marr D, Patt Y. Increasing the instruction fetch rate via multiple branch prediction and branch address cache. In Proc. the 7th ICS, July 1993, pp.67\u201376.","DOI":"10.1145\/165939.165956"},{"key":"1262_CR30","unstructured":"Thoziyoor S, Muralimanohar N, Ahn J\u00a0N, Jouppi N P. CACTI 5.1. Technical Report HPL-2008-20, Hp Labs, 2008, http:\/\/www.hpl.hp.com\/techreports\/2008\/HPL-2008-20.html ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1262-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1262-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1262-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T23:32:52Z","timestamp":1743723172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1262-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1262"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1262-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}