{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:10:29Z","timestamp":1780521029296,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07490-6","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T20:24:30Z","timestamp":1749500670000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BPTCN: a low-latency branch prediction model based on temporal convolutional networks"],"prefix":"10.1007","volume":"81","author":[{"given":"Ye","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinghui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Liao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"issue":"11","key":"7490_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/356989.357013","volume":"35","author":"K Sundaramoorthy","year":"2000","unstructured":"Sundaramoorthy K, Purser Z, Rotenberg E (2000) Slipstream processors: improving both performance and fault tolerance. ACM SIGPLAN Notices 35(11):257\u2013268","journal-title":"ACM SIGPLAN Notices"},{"issue":"2","key":"7490_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/545214.545250","volume":"30","author":"RS Chappell","year":"2002","unstructured":"Chappell RS, Tseng F, Yoaz A, Patt YN (2002) Difficult-path branch prediction using subordinate microthreads. ACM SIGARCH Comput Arch News 30(2):307\u2013317","journal-title":"ACM SIGARCH Comput Arch News"},{"key":"7490_CR3","doi-asserted-by":"crossref","unstructured":"Srinivasan V, Chowdhury RBR, Rotenberg E (2020) Slipstream processors revisited: Exploiting branch sets. In: 2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA), pp. 105\u2013117. IEEE","DOI":"10.1109\/ISCA45697.2020.00020"},{"key":"7490_CR4","doi-asserted-by":"crossref","unstructured":"Naithani A, Feliu J, Adileh A, Eeckhout L (2020) Precise runahead execution. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 397\u2013410. IEEE","DOI":"10.1109\/HPCA47549.2020.00040"},{"key":"7490_CR5","doi-asserted-by":"crossref","unstructured":"Pruett S, Patt Y (2021) Branch runahead: An alternative to branch prediction for impossible to predict branches. In: MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 804\u2013815","DOI":"10.1145\/3466752.3480053"},{"key":"7490_CR6","doi-asserted-by":"crossref","unstructured":"Chen D, Li DX, Moseley T (2016) Autofdo: Automatic feedback-directed optimization for warehouse-scale applications. In: Proceedings of the 2016 International Symposium on Code Generation and Optimization, pp. 12\u201323","DOI":"10.1145\/2854038.2854044"},{"key":"7490_CR7","doi-asserted-by":"crossref","unstructured":"Shen H, Pszeniczny K, Lavaee R, Kumar S, Tallam S, Li XD (2023) Propeller: A profile guided, relinking optimizer for warehouse-scale applications. In: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems 2:617\u2013631","DOI":"10.1145\/3575693.3575727"},{"issue":"POPL","key":"7490_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3498714","volume":"6","author":"W He","year":"2022","unstructured":"He W, Mestre J, Pupyrev S, Wang L, Yu H (2022) Profile inference revisited. Proc ACM Program Lang 6(POPL):1\u201324","journal-title":"Proc ACM Program Lang"},{"key":"7490_CR9","doi-asserted-by":"crossref","unstructured":"Li DX, Ashok R, Hundt R (2010) Lightweight feedback-directed cross-module optimization. In: Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 53\u201361","DOI":"10.1145\/1772954.1772964"},{"key":"7490_CR10","unstructured":"Luk C-K, Muth R, Patil H, Cohn R, Lowney G (2004) Ispike: a post-link optimizer for the intel\/spl reg\/itanium\/spl reg\/architecture. In: International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp. 15\u201326. IEEE"},{"key":"7490_CR11","doi-asserted-by":"crossref","unstructured":"Reinman G, Calder B, Austin T (1999) Fetch directed instruction prefetching. In: MICRO-32. Proceedings of the 32nd Annual ACM\/IEEE International Symposium on Microarchitecture, pp. 16\u201327. IEEE","DOI":"10.1109\/MICRO.1999.809439"},{"issue":"2","key":"7490_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/LCA.2020.3035068","volume":"19","author":"Y Ishii","year":"2020","unstructured":"Ishii Y, Lee J, Nathella K, Sunwoo D (2020) Rebasing instruction prefetching: an industry perspective. IEEE Comput Arch Lett 19(2):147\u2013150","journal-title":"IEEE Comput Arch Lett"},{"key":"7490_CR13","doi-asserted-by":"crossref","unstructured":"Ishii Y, Lee J, Nathella K, Sunwoo D (2021) Re-establishing fetch-directed instruction prefetching: An industry perspective. In: 2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp. 172\u2013182. IEEE","DOI":"10.1109\/ISPASS51385.2021.00034"},{"key":"7490_CR14","doi-asserted-by":"crossref","unstructured":"Ferdman M, Wenisch TF, Ailamaki A, Falsafi B, Moshovos A (2008) Temporal instruction fetch streaming. In: 2008 41st IEEE\/ACM International Symposium on Microarchitecture, pp. 1\u201310. IEEE","DOI":"10.1109\/MICRO.2008.4771774"},{"key":"7490_CR15","unstructured":"Falsafi B, Wenisch TF (2022) A Primer on Hardware Prefetching. Springer"},{"key":"7490_CR16","doi-asserted-by":"crossref","unstructured":"Kumar R, Huang C-C, Grot B, Nagarajan V (2017) Boomerang: A metadata-free architecture for control flow delivery. In: 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 493\u2013504. IEEE","DOI":"10.1109\/HPCA.2017.53"},{"issue":"2","key":"7490_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/3296957.3173178","volume":"53","author":"R Kumar","year":"2018","unstructured":"Kumar R, Grot B, Nagarajan V (2018) Blasting through the front-end bottleneck with shotgun. ACM SIGPLAN Notices 53(2):30\u201342","journal-title":"ACM SIGPLAN Notices"},{"key":"7490_CR18","volume-title":"Exploring deep neural networks for branch prediction","author":"Y Mao","year":"2017","unstructured":"Mao Y, Huiyang Z, Gui X (2017) Exploring deep neural networks for branch prediction. NC University, ECE Department"},{"key":"7490_CR19","doi-asserted-by":"crossref","unstructured":"Li M, Xu R, Zhang H, Li L, Li Y (2024) Cma-bp: A clustered multi-task learning and branch attention based branch predictor. In: 2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1370\u20131376. IEEE","DOI":"10.1109\/SMC54092.2024.10831163"},{"key":"7490_CR20","unstructured":"Seznec A (2016) Tage-sc-l branch predictors again. In: 5th JILP Workshop on Computer Architecture Competitions (JWAC-5): Championship Branch Prediction (CBP-5)"},{"key":"7490_CR21","unstructured":"Seznec A (2016) Exploring branch predictability limits with the mtage+ sc predictor. In: 5th JILP Workshop on Computer Architecture Competitions (JWAC-5): Championship Branch Prediction (CBP-5), p. 4"},{"issue":"8","key":"7490_CR22","doi-asserted-by":"publisher","first-page":"10299","DOI":"10.1007\/s13369-022-07593-9","volume":"48","author":"NM Dang","year":"2023","unstructured":"Dang NM, Cao HX, Tran L (2023) Batage-bfnp: a high-performance hybrid branch predictor with data-dependent branches speculative pre-execution for risc-v processors. Arab J Sci Eng 48(8):10299\u201310312","journal-title":"Arab J Sci Eng"},{"key":"7490_CR23","doi-asserted-by":"crossref","unstructured":"Yang X, Mai S, Bao R (2023) Mispredtable: A side branch predictor to tage in multithreading processors. In: 2023 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135. IEEE","DOI":"10.1109\/ISCAS46773.2023.10181591"},{"key":"7490_CR24","unstructured":"Jim\u00e9nez DA (2016) Multiperspective perceptron predictor. In: 5th JILP Workshop on Computer Architecture Competitions (JWAC-5): Championship Branch Prediction (CBP-5)"},{"key":"7490_CR25","unstructured":"Pruett S, Zangeneh S, Fakhrzadehgan A, Lin B, Patt Y (2016) Dynamically sizing the tage branch predictor. In: 5th JILP Workshop on Computer Architecture Competitions (JWAC-5): Championship Branch Prediction (CBP-5)"},{"key":"7490_CR26","first-page":"23","volume":"8","author":"A Seznec","year":"2006","unstructured":"Seznec A, Michaud P (2006) A case for (partially) tagged geometric history length branch prediction. J Instr-Level Parallelism 8:23","journal-title":"J Instr-Level Parallelism"},{"key":"7490_CR27","doi-asserted-by":"crossref","unstructured":"Khan TA, Ugur M, Nathella K, Sunwoo D, Litz H, Jim\u00e9nez DA, Kasikci B (2022) Whisper: Profile-guided branch misprediction elimination for data center applications. In: 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 19\u201334. IEEE","DOI":"10.1109\/MICRO56248.2022.00017"},{"key":"7490_CR28","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez DA, Hanson HL, Lin C (2001) Boolean formula-based branch prediction for future technologies. In: Proceedings 2001 International Conference on Parallel Architectures and Compilation Techniques, pp. 97\u2013106. IEEE","DOI":"10.1109\/PACT.2001.953291"},{"key":"7490_CR29","unstructured":"Tarsa SJ, Lin C-K, Keskin G, Chinya G, Wang H (2019) Improving branch prediction by modeling global history with convolutional neural networks. arXiv preprint arXiv:1906.09889"},{"key":"7490_CR30","doi-asserted-by":"crossref","unstructured":"Zangeneh S, Pruett S, Lym S, Patt YN (2020) Branchnet: A convolutional neural network to predict hard-to-predict branches. In: 2020 53rd Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 118\u2013130. IEEE","DOI":"10.1109\/MICRO50266.2020.00022"},{"key":"7490_CR31","doi-asserted-by":"crossref","unstructured":"Pettis K, Hansen RC (1990) Profile guided code positioning. In: Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, pp. 16\u201327","DOI":"10.1145\/93542.93550"},{"issue":"4","key":"7490_CR32","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1145\/183432.183527","volume":"16","author":"T Ball","year":"1994","unstructured":"Ball T, Larus JR (1994) Optimally profiling and tracing programs. ACM Trans Program Lang Syst (TOPLAS) 16(4):1319\u20131360","journal-title":"ACM Trans Program Lang Syst (TOPLAS)"},{"key":"7490_CR33","unstructured":"(SPEC), T.S.P.E.C.: The spec benchmark suite. (2017) http:\/\/www.spec.org"},{"key":"7490_CR34","doi-asserted-by":"crossref","unstructured":"Seznec A (2005) Analysis of the o-geometric history length branch predictor. In: 32nd International Symposium on Computer Architecture (ISCA\u201905), pp. 394\u2013405. IEEE","DOI":"10.1109\/ISCA.2005.13"},{"key":"7490_CR35","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep Learning, vol 1. MIT Press, Cambridge, MA"},{"key":"7490_CR36","unstructured":"McFarling S (1993) Combining branch predictors. Technical report, Technical Report TN-36, Digital Western Research Laboratory"},{"key":"7490_CR37","doi-asserted-by":"crossref","unstructured":"Muralimanohar N, Balasubramonian R, Jouppi N (2007) Optimizing nuca organizations and wiring alternatives for large caches with cacti 6.0. In: 40th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO 2007), pp. 3\u201314. IEEE","DOI":"10.1109\/MICRO.2007.33"},{"issue":"6","key":"7490_CR38","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/1064978.1065034","volume":"40","author":"C-K Luk","year":"2005","unstructured":"Luk C-K, Cohn R, Muth R, Patil H, Klauser A, Lowney G, Wallace S, Reddi VJ, Hazelwood K (2005) Pin: building customized program analysis tools with dynamic instrumentation. Acm Sigplan Notices 40(6):190\u2013200","journal-title":"Acm Sigplan Notices"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07490-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T20:24:39Z","timestamp":1749500679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07490-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":38,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["7490"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07490-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"21 May 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1002"}}