article

DRDU: A data reuse analysis technique for efficient scratch-pad memory management

Authors:

Erik Brockmeyer,

Miguel Miranda,

Nikil DuttAuthors Info & Claims

ACM Transactions on Design Automation of Electronic Systems (TODAES), Volume 12, Issue 2

Pages 15 - es

https://doi.org/10.1145/1230800.1230807

Published: 01 April 2007 Publication History

Abstract

In multimedia and other streaming applications, a significant portion of energy is spent on data transfers. Exploiting data reuse opportunities in the application, we can reduce this energy by making copies of frequently used data in a small local memory and replacing speed- and power-inefficient transfers from main off-chip memory by more efficient local data transfers. In this article we present an automated approach for analyzing these opportunities in a program that allows modification of the program to use custom scratch-pad memory configurations comprising a hierarchical set of buffers for local storage of frequently reused data. Using our approach we are able to both reduce energy consumption of the memory subsystem when using a scratch-pad memory by about a factor of two, on average, and improve memory system performance compared to a cache of the same size.

References

[1]

Avissar, O., Barua, R., and Stewart, D. 2002. An optimal memory allocation scheme for scratch-pad based embedded systems. IEEE Trans. Embedded Comput. Syst. 1, 1, 6--26.

Digital Library

[2]

Bacon, D. F., Graham, S. L., and Sharp, O. J. 1994. Compiler transformations for high-performance computing. ACM Computing Surv. 26, 4.

Digital Library

[3]

Banakar, R., Steinke, S., Lee, B. S., Balakrishnan, M., and Marwedel, P. 2002. Scratchpad memory: Design alternative for cache on-chip memory in embedded systems. In Proceedings of the 10th International Workshop on Hardware/Software Codesign (CODES).

Digital Library

[4]

Brockmeyer, E., Miranda, M., Catthoor, F., and Corporaal, H. 2003. Layer assignment techniques for low energy in multi-layered memory organisations. In Proceedings of the Design, Automation, and Test in Europe Conference (DATE), Germany.

Digital Library

[5]

Burger, D. and Austin, T. M. 1997. The SimpleScalar tool set, version 2.0. Tech. Rep. 1342, Department of Computer Science, University of Wisconsin-Madison, WI

[6]

Cooper, K., and Harvey, T. 1998. Compiler-Controlled memory. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (San Jose, CA). 2--11.

Digital Library

[7]

Diguet, J., Wuytack, S., Catthoor, F., and De Man, H. 1997. Formalized methodology for data reuse exploration in hierarchical memory mappings. In Proceedings of the IEEE International Symposium on Low Power Design (Monterey, CA). 30--35.

Digital Library

[8]

Falk, H. and Marwedel, P. 2003. Control flow driven splitting of loop nests at the source code level. In Proceedings of the Design, Automation, and Test in Europe Conference (DATE) (Munich, Germany).

Digital Library

[9]

Fischer, M. J. and Rabin, M. O. 1974. Super-Exponential complexity of Presburger arithmetic. In Proceedings of the American Mathematical Society Symposium on the Complexity of Computational Processes. 27--41.

[10]

Ghez, C., Miranda, M., Vandecappelle, A., Catthoor, F., and Verkest, D. 2000. Systematic high-level address code transformations for piece-wise linear indexing: Illustration on a medical imaging algorithm. In Workshop on Signal Processing Systems (Lafayette, LA).

[11]

Guthaus, M. R., Ringenberg, J. S., Ernst, D., Austin, T. M., Mudge, I., and Brown, R. B. 2001. MiBench: A free, commercially representative embedded benchmark suite. In 4th Annual Workshop on Workload Characterization.

Digital Library

[12]

Issenin, I., Brockmeyer, E., Miranda, M., and Dutt, N. 2004. Data reuse analysis technique for software-controlled memory hierarchies. In Proceedings of the Design, Automation and Test in Europe Conference.

Digital Library

[13]

Issenin, I. and Dutt, N. 2005. FORAY-GEN: Automatic generation of affine functions for memory optimizations. In Proceedings of the Design, Automation, and Test in Europe Conference (DATE) (Munich, Germany).

Digital Library

[14]

Kandemir, M. and Choudhary, A. 2002. Compiler-Directed scratch pad memory hierarchy design and management. In Proceedings of the 39th Design Automation Conference (New Orleans, LA).

Digital Library

[15]

Kandemir, M., Ramanujam, J., Irwin, M. J., Vijaykrishnan, N., Kadayif, I., and Parikh, A. 2001. Dynamic management of scratch-pad memory space. In Proceedings of the 38th Design Automation Conference (Las Vegas, NV).

Digital Library

[16]

Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shipeisman, T., and Wonnacott, D. 1995. The Omega library interface guide. Tech. Rep. CS-TR-3445, Department of Computer Science, University of Maryland, College Park, MD.

Digital Library

[17]

Kulkarni, C., Miranda, M., Ghez, C., Catthoor, F., and De Man, H. 2001. Cache conscious data layout organization for embedded multimedia applications. In Proceedings of the Design, Automation and Test in Europe Conference (DATE) (Germany).

Digital Library

[18]

Lillevold, K. et al. 1995. Telenor R&D, H.263 test model simulation software.

[19]

McKinley, K., Carr, S., and Tseng, C.-W. 1996. Improving data locality with loop transformations. In ACM Trans. Program. Lang. Syst. 18, 4.

Digital Library

[20]

Ozturk, O., Kandemir, M., Demikiran, I., Chen, G., and Irwin, M. J. 2004. Data compression for improving SPM behavior. In Proceedings of the Design Automation Conference (San Diego, CA).

Digital Library

[21]

Panda, P., Dutt, N., and Nicolau, A. 1997. Efficient utilization of scratch-pad memory in embedded processor applications. In Proceedings of the Design, Automation and Test in Europe Conference (DATE) (Paris).

Digital Library

[22]

Shivakumar, P. and Jouppi, N. 2001. CACTI 3.0: An integrated cache timing, power, and area model. WRL Tech. Rep. 2001/2.

[23]

Sjödin, J. and Von Platen, C. 2001. Storage allocation for embedded processors. In Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (Atlanta, GA). 15--23.

Digital Library

[24]

Steinke, S., Wehmeyer, L., Lee, B., and Marwedel, P. 2002. Assigning program and data objects to scratchpad for energy reduction. In Proceedings of the Design, Automation and Test in Europe Conference (DATE) (Paris).

Digital Library

[25]

Stobach, P. 1988. A new technique in scene adaptive coding. In Proceedings of EUSIPCO (Grenoble, France).

[26]

Udayakumaran, S. and Barua, R. 2003. Compiler-Decided dynamic memory allocation for scratch-pad based embedded systems. In Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES) (San Jose, CA).

Digital Library

[27]

Van Achteren, T., Catthoor, F., Lauwereins, R., and Deconinck, G. 2003. Search space definition and exploration for nonuniform data reuse opportunities in data-dominant applications. ACM Trans. Desi. Autom. Electron. Syst. 8, 1.

Digital Library

[28]

Van Achteren, T., Catthoor, F., Lauwereins, R., and Deconinck, G. 2002. Data reuse exploration techniques for loop-dominated applications. In IEEE/ACM Design Automation and Test Conference (Paris).

Digital Library

[29]

Verma, M., Steinke, S., and Marwedel, P. 2003. Data partitioning for maximal scratchpad usage. In Proceedings of the Asia South Pacific Design Automation Conference (ASPDAC) (KitaKyushu, Japan).

Digital Library

[30]

Verma, M., Wehmeyer, L., and Marwedel, P. 2004. Dynamic overlay of scratchpad memory for energy minimization. In Proceedings of the International Workshop on Hardware/Software Codesign (CODES) (Stockholm, Sweden).

Digital Library

[31]

Wilde, D. 1993. A library for doing polyhedral operations. Tech. Rep. 785, IRISA Rennes, France.

Cited By

Mayer FBrandner JPhilippsen M(2023)Employing Polyhedral Methods to Reduce Data Movement in FPGA Stencil CodesLanguages and Compilers for Parallel Computing10.1007/978-3-031-31445-2_4(47-63)Online publication date: 10-May-2023
https://doi.org/10.1007/978-3-031-31445-2_4
Jung JPark DDo YPark JLee JGupta RShen X(2020)Overlapping host-to-device copy and computation using hidden unified memoryProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374531(321-335)Online publication date: 19-Feb-2020
https://dl.acm.org/doi/10.1145/3332466.3374531
Dave SKim YAvancha SLee KShrivastava A(2019)dMazeRunnerACM Transactions on Embedded Computing Systems10.1145/335819818:5s(1-27)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1145/3358198
Show More Cited By

Index Terms

DRDU: A data reuse analysis technique for efficient scratch-pad memory management
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

An integrated memory-disk system with buffering adapter and non-volatile memory

Next generation non-volatile memory devices are promising replacements for DRAM and Flash memories for mobile devices because of their energy efficiency and non-volatile characteristics. In this paper, we propose a new memory hierarchy system for next-...
Compiler-Assisted and Profiling-Based Analysis for Fast and Efficient STT-MRAM On-Chip Cache Design

Spin Transfer Torque Magnetic Random Access Memory (STT-MRAM) is a promising candidate for large on-chip memories as a zero-leakage, high-density and non-volatile alternative to the present SRAM technology. Since memories are the dominating component of ...
Dynamic scratch-pad memory management with data pipelining for embedded systems
Advanced Topics on Scalable Computing

In this paper, we propose an effective data pipelining technique, SPDP (Scratch-Pad Data Pipelining), for dynamic scratch-pad memory (SPM) management with DMA (Direct Memory Access). Our basic idea is to overlap the execution of CPU instructions and DMA ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Design Automation of Electronic Systems

ACM Transactions on Design Automation of Electronic Systems Volume 12, Issue 2

April 2007

222 pages

ISSN:1084-4309

EISSN:1557-7309

DOI:10.1145/1230800

Issue’s Table of Contents

Copyright © 2007 ACM.

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

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 01 April 2007

Published in TODAES Volume 12, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
654
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mayer FBrandner JPhilippsen M(2023)Employing Polyhedral Methods to Reduce Data Movement in FPGA Stencil CodesLanguages and Compilers for Parallel Computing10.1007/978-3-031-31445-2_4(47-63)Online publication date: 10-May-2023
https://doi.org/10.1007/978-3-031-31445-2_4
Jung JPark DDo YPark JLee JGupta RShen X(2020)Overlapping host-to-device copy and computation using hidden unified memoryProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374531(321-335)Online publication date: 19-Feb-2020
https://dl.acm.org/doi/10.1145/3332466.3374531
Dave SKim YAvancha SLee KShrivastava A(2019)dMazeRunnerACM Transactions on Embedded Computing Systems10.1145/335819818:5s(1-27)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1145/3358198
Li WYang FZhu HZeng XZhou D(2019)An Efficient Memory Partitioning Approach for Multi-Pattern Data Access via Data ReuseACM Transactions on Reconfigurable Technology and Systems10.1145/330129612:1(1-22)Online publication date: 5-Feb-2019
https://dl.acm.org/doi/10.1145/3301296
Su JYang FZeng XZhou DChen J(2017)Efficient Memory Partitioning for Parallel Data Access in FPGA via Data ReuseIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.264883836:10(1674-1687)Online publication date: Oct-2017
https://doi.org/10.1109/TCAD.2017.2648838
Chen RWang YHu JLiu DShao ZGuan Y(2017)vFlash: Virtualized Flash for Optimizing the I/O Performance in Mobile DevicesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2016.261888136:7(1203-1214)Online publication date: Jul-2017
https://doi.org/10.1109/TCAD.2016.2618881
Qamar AMuslim FGregoretti FLavagno LLazarescu M(2017)High-Level Synthesis for Semi-Global Matching: Is the Juice Worth the Squeeze?IEEE Access10.1109/ACCESS.2016.26353785(8419-8432)Online publication date: 2017
https://doi.org/10.1109/ACCESS.2016.2635378
Khaldi DChapman BFinkel H(2016)Towards automatic HBM allocation using LLVMProceedings of the Third Workshop on LLVM Compiler Infrastructure in HPC10.5555/3018869.3018871(12-20)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.5555/3018869.3018871
Su JYang FZeng XZhou DChen DGreene J(2016)Efficient Memory Partitioning for Parallel Data Access via Data ReuseProceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/2847263.2847264(138-147)Online publication date: 21-Feb-2016
https://dl.acm.org/doi/10.1145/2847263.2847264
Khaldi DChapman B(2016)Towards Automatic HBM Allocation Using LLVM: A Case Study with Knights Landing2016 Third Workshop on the LLVM Compiler Infrastructure in HPC (LLVM-HPC)10.1109/LLVM-HPC.2016.007(12-20)Online publication date: Nov-2016
https://doi.org/10.1109/LLVM-HPC.2016.007
Show More Cited By

View Options

Login options

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

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents