skip to main content
research-article

Accurate Estimation of Service Rates in Interleaved Scratchpad Memory Systems

Published:10 February 2022Publication History
Skip Abstract Section

Abstract

The prototyping of embedded platforms demands rapid exploration of multi-dimensional parameter sets. Especially the design of the memory system is essential to guarantee high utilization while reducing conflicts at the same time. To aid the design process, several probabilistic models to estimate the throughput of interleaved memory systems have been proposed. While accurately estimating the average throughput of the system, these models fail to determine the impact on individual processing elements. To mitigate this divergence, we extend three known models to include non-uniform access probabilities and priorities.

REFERENCES

  1. [1] Ax Johannes, Sievers Gregor, Daberkow Julian, Flasskamp Martin, Vohrmann Marten, Jungeblut Thorsten, Kelly Wayne, Porrmann Mario, and Rückert Ulrich. 2018. CoreVA-MPSoC: A many-core architecture with tightly coupled shared and local data memories. IEEE Trans. Parallel Distrib. Syst. 29, 5 (2018), 10301043. https://doi.org/10.1109/TPDS.2017.2785799Google ScholarGoogle ScholarCross RefCross Ref
  2. [2] Bhandarkar D. P.. 1975. Analysis of memory interference in multiprocessors. IEEE Trans. Comput. C-24, 9 (1975), 897908. https://doi.org/10.1109/T-C.1975.224335 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Bhandarkar Dileep P. and Fuller Samuel H.. 1973. markov chain models for analyzing memory interference in multiprocessor computer systems. In Proceedings of the 1st Annual Symposium on Computer Architecture (ISCA’73). ACM. https://doi.org/10.1145/633642.803965 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Centre 3GPP Mobile Competence. 2019. 3GPP Homepage. Retrieved from https://www.3gpp.org/specificationsGoogle ScholarGoogle Scholar
  5. [5] Dogan Ahmed Yasir, Constantin Jeremy, Ruggiero Martino, Burg Andreas, and Atienza David. 2012. multi-core architecture design for ultra-low-power wearable health monitoring systems. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’12). IEEE. https://doi.org/10.1109/DATE.2012.6176640 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Haas Sebastian, Moriam Sadia, Hasler Mattis, Fischer Erik, Chen Yong, Matúš Emil, Ellguth Georg, Hartmann Stephan, Schiefer Stefan, Cederström Love, Walter Dennis, Seifert Tobias, Henker Stephan, Hänzsche Stefan, Uhlig Johannes, Eisenreich Holger, Weithoffer Stefan, Wehn Norbert, Schüffny René, Mayr Christian, Fettweis Gerhard, Nöthen Benedikt, Scholze Stefan, Höppner Sebastian, Dixius Andreas, Adeva Esther Pérez, Augustin Thomas, and Pauls Friedrich. 2017. A heterogeneous SDR MPSoC in 28 nm CMOS for low-latency wireless applications. In Proceedings of the 54th Annual Design Automation Conference (DAC’17). ACM. https://doi.org/10.1145/3061639.3062188 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] John Lizy K. and Liu Yu-Cheng. 1996. performance model for a prioritized multiple-bus multiprocessor system. IEEE Trans. Comput. 45, 5 (1996), 580588. https://doi.org/10.1109/12.509909 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Kakoee Mohammad Reza, Petrovic Vladimir, and Benini Luca. 2012. a multi-banked shared-l1 cache architecture for tightly coupled processor clusters. In Proceedings of the International Symposium on System on Chip (SoC’12). IEEE. https://doi.org/10.1109/ISSoC.2012.6376362Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] Olofsson Andreas. 2016. epiphany-v: A 1024 processor 64-bit RISC system-on-chip. arxiv:1610.01832. Retrieved from http://arxiv.org/abs/1610.01832.Google ScholarGoogle Scholar
  10. [10] Raghavan Ram and Hayes John P.. 1990. on randomly interleaved memories. In Supercomputing. IEEE Comput. Soc. Press. https://doi.org/10.1109/SUPERC.1990.130001 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Rahimi Abbas, Loi Igor, Kakoee Mohammad Reza, and Benini Luca. 2011. a fully-synthesizable single-cycle interconnection network for Shared-L1 processor clusters. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’11). IEEE. https://doi.org/10.1109/DATE.2011.5763085Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] Skinner C. E. and Asher J. R.. 1969. effects of storage contention on system performance. IBM Syst. J. 8, 4 (1969), 319333. https://doi.org/10.1147/sj.84.0319 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. [13] Tretter Andreas. 2018. On Efficient Data Exchange in Multicore Architectures. Ph.D. Dissertation.Google ScholarGoogle Scholar
  14. [14] Tretter Andreas, Kumar Pratyush, and Thiele Lothar. 2015. interleaved multi-bank scratchpad memories: A probabilistic description of access conflicts. In Proceedings of the 52nd Annual Design Automation Conference (DAC’15). ACM, New York, NY. https://doi.org/10.1145/2744769.2744861 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] Venkatesh Ganesh, Sampson Jack, Goulding Nathan, Garcia Saturnino, Bryksin Vladyslav, Lugo-Martinez Jose, Swanson Steven, and Taylor Michael Bedford. 2010. Conservation cores: Reducing the energy of mature computations. In Proceedings of the 15th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS’10). ACM. https://doi.org/10.1145/1736020.1736044 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Strecker William Daniel. 1970. An Analysis of the Instruction Execution Rate in Certain Computer Structures. Ph.D. Dissertation. Carnegie-Mellon University.Google ScholarGoogle Scholar
  17. [17] Wittig Robert, Hasler Mattis, Matus Emil, and Fettweis Gerhard. 2019. queue based memory management unit for heterogeneous MPSoCs. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’19). IEEE. https://doi.org/10.23919/DATE.2019.8715129Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Accurate Estimation of Service Rates in Interleaved Scratchpad Memory Systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Embedded Computing Systems
        ACM Transactions on Embedded Computing Systems  Volume 21, Issue 1
        January 2022
        288 pages
        ISSN:1539-9087
        EISSN:1558-3465
        DOI:10.1145/3505211
        Issue’s Table of Contents

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 10 February 2022
        • Accepted: 1 March 2021
        • Revised: 1 October 2020
        • Received: 1 December 2019
        Published in tecs Volume 21, Issue 1

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Refereed
      • Article Metrics

        • Downloads (Last 12 months)69
        • Downloads (Last 6 weeks)7

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Full Text

      View this article in Full Text.

      View Full Text

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!