{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T22:32:32Z","timestamp":1771626752923,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["16ME0426K"],"award-info":[{"award-number":["16ME0426K"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002957","name":"Technische Universit\u00e4t Dresden","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002957","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In embedded systems, tightly coupled memories (TCMs) are usually shared between multiple masters for the purpose of hardware efficiency and software flexibility. On the one hand, memory sharing improves area utilization, but on the other hand, this can lead to a performance degradation due to an increase in access conflicts. To mitigate the associated performance penalty, access interval prediction (AIP) has been proposed. In a similar fashion to branch prediction, AIP exploits program flow regularity to predict the cycle of the next memory access. We show that this structural similarity allows for adaption of state-of-the-art branch predictors, such as Prediction by Partial Matching (PPM) and the TAgged GEometric history length (TAGE) branch predictor. Our analysis on memory access traces reveals that PPM predicts 99 percent of memory accesses. As PPM does not lend itself to hardware implementation, we also present the PPM-based TAGE access interval predictor which attains an accuracy of over 97 percent outperforming all previously presented implementable AIP schemes.<\/jats:p>","DOI":"10.1007\/s10766-024-00764-1","type":"journal-article","created":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T12:02:29Z","timestamp":1707825749000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Access Interval Prediction by Partial Matching for Tightly Coupled Memory Systems"],"prefix":"10.1007","volume":"52","author":[{"given":"Viktor","family":"Razilov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Wittig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emil","family":"Mat\u00fa\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Fettweis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,13]]},"reference":[{"key":"764_CR1","doi-asserted-by":"publisher","unstructured":"Haas, S., Seifert, T., N\u00f6then, B., Scholze, S., H\u00f6ppner, S., Dixius, A., P\u00e9rez Adeva, E., Augustin, T., Pauls, F., Moriam, S., Hasler, M., Fischer, E., Chen, Y., Mat\u00fa\u0161, E., Ellguth, G., Hartmann, S., Schiefer, S., Cederstr\u00f6m, L., Walter, D., Henker, S., H\u00e4nzsche, S., Uhlig, J., Eisenreich, H., Weithoffer, S., Wehn, N., Sch\u00fcffny, R., Mayr, C., Fettweis, G.: A Heterogeneous SDR MPSoC in 28 nm CMOS for Low-Latency Wireless Applications. In: DAC. ACM Press, New York, New York, USA (2017). https:\/\/doi.org\/10.1145\/3061639.3062188","DOI":"10.1145\/3061639.3062188"},{"key":"764_CR2","volume-title":"Access Interval Prediction for Tightly Coupled Memory Systems","author":"R Wittig","year":"2019","unstructured":"Wittig, R., Pauls, F., Matus, E., Fettweis, G.: Access Interval Prediction for Tightly Coupled Memory Systems. In SAMOS, Springer, Cham (2019)"},{"key":"764_CR3","doi-asserted-by":"publisher","unstructured":"R. Wittig, M. Hasler, E. Matus, G. Fettweis: Statistical Access Interval Prediction for Tightly Coupled Memory Systems. In: COOL CHIPS. IEEE (2019). https:\/\/doi.org\/10.1109\/CoolChips.2019.8721304","DOI":"10.1109\/CoolChips.2019.8721304"},{"issue":"1","key":"764_CR4","first-page":"1","volume":"31","author":"S Mittal","year":"2018","unstructured":"Mittal, S.: A survey of techniques for dynamic branch prediction. Concurreny Comput.\u202f: Pract. Exp. 31(1), 1\u201336 (2018)","journal-title":"Concurreny Comput. : Pract. Exp."},{"key":"764_CR5","first-page":"23","volume":"8","author":"A Seznec","year":"2006","unstructured":"Seznec, A., Michaud, P.: A case for (partially) TAgged GEometric history length branch prediction. J. Inst.-Level Parallelism 8, 23 (2006)","journal-title":"J. Inst.-Level Parallelism"},{"issue":"4","key":"764_CR6","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J Cleary","year":"1984","unstructured":"Cleary, J., Witten, I.: Data Compression Using Adaptive Coding and Partial String Matching. IEEE Trans. Commun. 32(4), 396\u2013402 (1984)","journal-title":"IEEE Trans. Commun."},{"key":"764_CR7","unstructured":"Guthaus, M.R., Ringenberg, J.S., Ernst, D., Austin, T.M., Mudge, T., Brown, R.B.: MiBench: A free, commercially representative embedded benchmark suite. In: 4th Annu. Workshop on Workload Characterization. IEEE (2001)"},{"issue":"9","key":"764_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.sysarc.2015.04.002","volume":"61","author":"M Schoeberl","year":"2015","unstructured":"Schoeberl, M., Abbaspour, S., Akesson, B., Audsley, N., Capasso, R., Garside, J., Goossens, K., Goossens, S., Hansen, S., Heckmann, R., Hepp, S., Huber, B., Jordan, A., Kasapki, E., Knoop, J., Li, Y., Prokesch, D., Puffitsch, W., Puschner, P., Rocha, A., Silva, C., Spars\u00f8, J., Tocchi, A.: T-CREST: Time-predictable multi-core architecture for embedded systems. J. Syst. Architect. 61(9), 449\u2013471 (2015). https:\/\/doi.org\/10.1016\/j.sysarc.2015.04.002","journal-title":"J. Syst. Architect."},{"key":"764_CR9","doi-asserted-by":"publisher","unstructured":"Paolieri, M., Qui\u00f1ones, E., Carzola, F. J., Bernat, G., Valero, M.: Hardware Support for WCET Analysis of Hard Real-time Multicore Systems. In: ISCA. ACM Press, New York, New York, USA (2009). https:\/\/doi.org\/10.1145\/1555754.1555764","DOI":"10.1145\/1555754.1555764"},{"issue":"5","key":"764_CR10","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TPDS.2017.2785799","volume":"29","author":"J Ax","year":"2018","unstructured":"Ax, J., Sievers, G., Daberkow, J., Flasskamp, M., Vohrmann, M., Jungeblut, T., Kelly, W., Porrmann, M., R\u00fcckert, U.: CoreVA-MPSoC: A Many-Core Architecture with Tightly Coupled Shared and Local Data Memories. IEEE Trans. Parallel Distrib. Syst. 29(5), 1030\u20131043 (2018). https:\/\/doi.org\/10.1109\/TPDS.2017.2785799","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"764_CR11","doi-asserted-by":"publisher","unstructured":"Gelado, I., Cabezas, J., Stone, J. E., Patel, S., Navarro, N., Hwu, W.-m. W.: An Asyemmetric Distributed Shared Memory Model for Heterogeneous Parallel Systems. In: ASPLOS. ACM Press, New York, New York, USA (2010). https:\/\/doi.org\/10.1145\/1736020.1736059","DOI":"10.1145\/1736020.1736059"},{"key":"764_CR12","doi-asserted-by":"publisher","unstructured":"Wittig, R., Hasler, M., Matus, E., Fettweis, G.: Queue Based Memory Management Unit for Heterogeneous MPSoCs. In: DATE. IEEE (2019). https:\/\/doi.org\/10.23919\/DATE.2019.8715129","DOI":"10.23919\/DATE.2019.8715129"},{"key":"764_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/SAMOS.2013.6621138","author":"D Bates","year":"2013","unstructured":"Bates, D., Bradbury, A., Koltes, A., Mullins, R.: Exploiting tightly-coupled cores In: SAMOS. IEEE (2013). https:\/\/doi.org\/10.1109\/SAMOS.2013.6621138","journal-title":"IEEE"},{"key":"764_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763085","author":"A Rahimi","year":"2011","unstructured":"Rahimi, A., Loi, I., Kakoee, M.R., Benini, L.: A fully-synthesizable single-cycle interconnection network for shared-L1 processor clusters. In DATE. IEEE (2011). https:\/\/doi.org\/10.1109\/DATE.2011.5763085","journal-title":"In DATE. IEEE"},{"key":"764_CR15","doi-asserted-by":"publisher","unstructured":"Gautschi, M., Rossi, D., Benini, L.: Customizing an Open Source Processor to Fit in an Ultra-Low Power Cluster with a Shared L1 Memory. In: GLSVLSI. IEEE (2014). https:\/\/doi.org\/10.1145\/2591513.2591569","DOI":"10.1145\/2591513.2591569"},{"key":"764_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15074-6_6","volume-title":"Tagged Geometric History Length Access Interval Prediction for Tightly Coupled Memory Systems","author":"V Razilov","year":"2022","unstructured":"Razilov, V., Wittig, R., Mat\u00fa\u0161, E., Fettweis, G.: Tagged Geometric History Length Access Interval Prediction for Tightly Coupled Memory Systems. In SAMOS, Springer, Cham (2022)"},{"key":"764_CR17","first-page":"10","volume":"7","author":"P Michaud","year":"2005","unstructured":"Michaud, P.: A PPM-like, tag-based branch predictor. J. Inst.-Level Parallelism 7, 10 (2005)","journal-title":"J. Inst.-Level Parallelism"},{"key":"764_CR18","unstructured":"Michaud, P.: Analysis of a tag-based branch predictor. Research Report RR-5366, INRIA (2004)"},{"key":"764_CR19","unstructured":"Lowe-Power, J., et al.: The gem5 Simulator: Version 20.0+. (2020). https:\/\/arxiv.org\/abs\/2007.03152"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-024-00764-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-024-00764-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-024-00764-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T13:05:49Z","timestamp":1711717549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-024-00764-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,13]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["764"],"URL":"https:\/\/doi.org\/10.1007\/s10766-024-00764-1","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,13]]},"assertion":[{"value":"23 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}