{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:07Z","timestamp":1743049627486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031150739"},{"type":"electronic","value":"9783031150746"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15074-6_6","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T12:06:36Z","timestamp":1660392396000},"page":"90-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tagged Geometric History Length Access Interval Prediction for\u00a0Tightly Coupled Memory Systems"],"prefix":"10.1007","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":[[2022,8,14]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Haas, S., et al.: A heterogenous SDR MPSoC in 28 nm CMOS for low-latency wireless applications. In: DAC. ACM Press, New York (2017). https:\/\/doi.org\/10.1145\/3061639.3062188","DOI":"10.1145\/3061639.3062188"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-27562-4_16","volume-title":"Embedded Computer Systems: Architectures, Modeling, and Simulation","author":"R Wittig","year":"2019","unstructured":"Wittig, R., Pauls, F., Matus, E., Fettweis, G.: Access interval prediction for tightly coupled memory systems. In: Pnevmatikatos, D.N., Pelcat, M., Jung, M. (eds.) SAMOS 2019. LNCS, vol. 11733, pp. 229\u2013240. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27562-4_16"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Wittig, R., Hasler, M., Matus, E., Fettweis, G.: 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":"6_CR4","first-page":"1","volume":"31","author":"S Mittal","year":"2018","unstructured":"Mittal, S.: A survey of techniques for dynamic branch prediction. Concurr. Comput. Pract. Exp. 31(1), 1\u201336 (2018)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"6_CR5","unstructured":"Seznec, A., Michaud, P.: A case for (partially) TAgged GEometric history length branch prediction. J. Instruct. Level Parall. 8 (2006). https:\/\/www.jilp.org\/vol8"},{"key":"6_CR6","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 Annual Workshop on Workload Characterization. IEEE (2001)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Schoeberl, M., et al.: T-CREST: time-predictable multi-core architecture for embedded systems. J. Syst. Archit. 61(9), 449\u2013471 (2015). https:\/\/doi.org\/10.1016\/j.sysarc.2015.04.002","DOI":"10.1016\/j.sysarc.2015.04.002"},{"key":"6_CR8","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 (2009). https:\/\/doi.org\/10.1145\/1555754.1555764","DOI":"10.1145\/1555754.1555764"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ax, J., et al.: 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","DOI":"10.1109\/TPDS.2017.2785799"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Gelado, I., Cabezas, J., Stone, J.E., Patel, S., Navarro, N., Hwu, W.-M.W.: An asymmetric distributed shared memory model for heterogeneous parallel systems. In: ASPLOS. ACM Press, New York (2010). https:\/\/doi.org\/10.1145\/1736020.1736059","DOI":"10.1145\/1736020.1736059"},{"key":"6_CR11","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":"6_CR12","doi-asserted-by":"publisher","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","DOI":"10.1109\/SAMOS.2013.6621138"},{"key":"6_CR13","doi-asserted-by":"publisher","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","DOI":"10.1109\/DATE.2011.5763085"},{"key":"6_CR14","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"},{"issue":"4","key":"6_CR15","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":"6_CR16","unstructured":"Michaud, P.: A PPM-like, tag-based branch predictor. J. Instruct. Level Parall. 7, (2005). https:\/\/www.jilp.org\/vol7"},{"key":"6_CR17","unstructured":"Lowe-Power, J., et al. The gem5 simulator: version 20.0+. (2020). https:\/\/arxiv.org\/abs\/2007.03152"}],"container-title":["Lecture Notes in Computer Science","Embedded Computer Systems: Architectures, Modeling, and Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15074-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T18:04:43Z","timestamp":1666807483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15074-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031150739","9783031150746"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15074-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAMOS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Embedded Computer Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Samos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"samos2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/samos-conference.com\/wp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"SoftConference","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}