DOCSLIB.ORG

Stash: Have Your Scratchpad and Cache It Too ∗ Rakesh Komuravelli† Matthew D

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Stash: Have Your Scratchpad and Cache It Too ∗ Rakesh Komuravelli† Matthew D Stash: Have Your Scratchpad and Cache It Too ∗ Rakesh Komuravelli† Matthew D. Sinclair† Johnathan Alsop† Muhammad Huzaifa† Maria Kotsifakou† Prakalp Srivastava† Sarita V. Adve†‡ Vikram S. Adve†‡ † University of Illinois at Urbana-Champaign ‡ École Polytechnique Fédérale de Lausanne [email protected] Abstract the memory hierarchy is expected to become a dominant con- Heterogeneous systems employ specialization for energy sumer of energy as technology continues to scale [18, 22]. efficiency. Since data movement is expected to be a dominant Thus, efficient data movement is essential for energy efficient consumer of energy, these systems employ specialized mem- heterogeneous systems. ories (e.g., scratchpads and FIFOs) for better efficiency for To provide efficient data movement, modern heterogeneous targeted data. These memory structures, however, tend to exist systems use specialized memories; e.g., scratchpads and FI- in local address spaces, incurring significant performance and FOs. These memories often provide better efficiency for spe- energy penalties due to inefficient data movement between the cific access patterns but they also tend to exist in disjoint, global and private spaces. We propose an efficient heteroge- private address spaces. Transferring data to/from these pri- neous memory system where specialized memory components vate address spaces incurs inefficiencies that can negate the are tightly coupled in a unified and coherent address space. benefits of specialization. We propose an efficient heteroge- This paper applies these ideas to a system with CPUs and neous memory system where specialized memory components GPUs with scratchpads and caches. are tightly coupled in a unified and coherent address space. We introduce a new memory organization, stash, that com- Although industry has recently transitioned to more tightly bines the benefits of caches and scratchpads without incurring coupled heterogeneous systems with a single unified address their downsides. Like a scratchpad, the stash is directly ad- space and coherent caches [1, 3, 20], specialized components dressed (without tags and TLB accesses) and provides compact such as scratchpads are still within private, incoherent address storage. Like a cache, the stash is globally addressable and spaces. visible, providing implicit data movement and increased data In this paper, we focus on heterogeneous systems with reuse. We show that the stash provides better performance CPUs and GPUs where the GPUs access both coherent caches and energy than a cache and a scratchpad, while enabling and private scratchpads. We propose a new memory organiza- new use cases for heterogeneous systems. For 4 microbench- tion, stash, that combines the performance and energy benefits marks, which exploit new use cases (e.g., reuse across GPU of caches and scratchpads. Like a scratchpad, the stash pro- compute kernels), compared to scratchpads and caches, the vides compact storage and does not have conflict misses or stash reduces execution cycles by an average of 27% and 13% overheads from tags and TLB accesses. Like a cache, the respectively and energy by an average of 53% and 35%. For stash is globally addressable and visible, enabling implicit, 7 current GPU applications, which are not designed to exploit on-demand, and coherent data movement and increasing data the new features of the stash, compared to scratchpads and reuse. Table 1 compares caches and scratchpads (Section 2 caches, the stash reduces cycles by 10% and 12% on average discusses the stash). (max 22% and 31%) respectively, and energy by 16% and 32% on average (max 30% and 51%). 1.1. Caches 1. Introduction Caches are a common memory organization in modern sys- Specialization is a natural path to energy efficiency. There tems. Their software transparency makes them easy to pro- has been a significant amount of work on compute specializa- gram, but caches have several inefficiencies: tion and it seems clear that future systems will support some Indirect, hardware-managed addressing: Cache loads and collection of heterogeneous compute units (CUs). However, stores specify addresses that hardware must translate to deter- mine the physical location of the accessed data. This indirect ∗This work was supported in part by Intel Corporation through the Illi- nois/Intel Parallelism Center at Illinois, the National Science Foundation under addressing implies that each cache access (a hit or a miss) grants CCF-1018796 and CCF-1302641, a Qualcomm Innovation Fellowship incurs (energy) overhead for TLB lookups and tag compar- for Komuravelli and Sinclair, and by the Center for Future Architectures Re- isons. Virtually tagged caches do not require TLB lookups search (C-FAR), one of the six centers of STARnet, a Semiconductor Research on hits, but they incur additional overhead, including dealing Corporation program sponsored by MARCO and DARPA. with synonyms, page mapping and protection changes, and Permission to make digital or hard copies of all or part of this work for cache coherence [8]. Furthermore, the indirect, hardware- personal or classroom use is granted without fee provided that copies are not managed addressing also results in unpredictable hit rates 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 due to cache conflicts, causing pathological performance (and of this work owned by others than ACM must be honored. Abstracting with energy) anomalies, a notorious problem for real-time systems. credit is permitted. To copy otherwise, or republish, to post on servers or to Inefficient, cache line based storage: Caches store data at redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. fixed cache line granularities which wastes SRAM space when ISCA ’15, June 13 - 17, 2015, Portland, OR, USA a program does not access the entire cache line (e.g., when a c 2015 ACM. ISBN 978-1-4503-3402-0/15/06...$15.00 program phase traverses an array of large objects but accesses DOI: http://dx.doi.org/10.1145/2749469.2750374 only one field in each object). Feature Benefit Cache Scratchpad Stash No address translation hardware access 7 3 3 Directly addressed (if physically tagged) (on hits) No tag access 7 3 3 No conflict misses 7 3 3 Compact storage Efficient use of SRAM storage 7 3 3 Implicit data movement from/to structure Global addressing No pollution of other memories 3 7 3 On-demand loads into structures Lazy writebacks to global address space (AS) Global visibility 3 7 3 Reuse across compute kernels and application phases Table 1: Comparison of cache, scratchpad, and stash. 1.2. Scratchpads scratchpad copy and then writes back the result to aosA. The Scratchpads (referred to as shared memory in CUDA) are local bottom of Figure 1a shows some of the corresponding steps memories that are managed in software, either by the program- in hardware. First, the hardware must explicitly copy fieldX mer or through compiler support. Unlike caches, scratchpads into the scratchpad. To achieve this, the application issues are directly addressed so they do not have overhead from TLB an explicit load of the corresponding global address to the lookups or tag comparisons (this provides significant savings: L1 cache (event 1). On an L1 miss, the hardware brings 34% area and 40% power [7] or more [26]). Direct addressing fieldX’s cache line into the L1, polluting it as a result (events also eliminates the pathologies of conflict misses and has a 2 and 3). Next, the hardware sends the data value from the fixed access latency (100% hit rate). Scratchpads also provide L1 to the core’s register (event 4). Finally, the application compact storage since the software only brings useful data issues an explicit store instruction to write the value from into the scratchpad. These features make scratchpads appeal- the register into the corresponding scratchpad address (event ing, especially for real-time systems [5, 37, 38]. However, 5). At this point, the scratchpad has a copy of fieldX and scratchpads also have some inefficiencies: the application can finally access the data (events 6 and 7). Not Globally Addressable: Scratchpads use a separate ad- Once the application is done modifying the data, the dirty dress space disjoint from the global address space, with no scratchpad data is explicitly written back to the global address hardware mapping between the two. Thus, extra instructions space, requiring loads from the scratchpad and stores into the must explicitly move data between the two spaces, incurring cache (not shown in the figure). performance and energy overhead. Furthermore, in current We refer to this scratchpad usage mode, where data is moved systems the additional loads and stores typically move data via explicitly from/to the global space, as the global-unmapped the core’s L1 cache and its registers, polluting these resources mode. Scratchpads can also be used in temporary mode for and potentially evicting (spilling) useful data. Scratchpads private, temporary values. Temporary values do not require also do not perform well for applications with on-demand global address loads or writebacks because they are discarded loads because today’s scratchpads preload all elements. In after their use (they trigger only events 6 and 7). applications with control/data dependent accesses, only a few 1.3. Stash of the preloaded elements will be accessed. Not Globally Visible: A scratchpad is visible only to its local To address the inefficiencies of caches and scratchpads we CU. Thus dirty data in the scratchpad must be explicitly writ- introduce a new memory organization, stash, which combines ten back to the corresponding global address before it can be the best properties of the cache and scratchpad organizations. used by other CUs. Further, all global copies in the scratchpad Similar to a scratchpad, the stash is software managed, directly must be freshly loaded if they could have been written by addressable, and can compactly map non-contiguous global other CUs.
Load more

Recommended publications
  • Analyzing the Benefits of Scratchpad Memories for Scientific Matrix
    The Pennsylvania State University The Graduate School Department of Computer Science and Engineering ANALYZING THE BENEFITS OF SCRATCHPAD MEMORIES FOR SCIENTIFIC MATRIX COMPUTATIONS A Thesis in Computer Science and Engineering by Bryan Alan Cover c 2008 Bryan Alan Cover Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science May 2008 The thesis of Bryan Alan Cover was reviewed and approved* by the following: Mary Jane Irwin Evan Pugh Professor of Computer Science and Engineering Thesis Co-Advisor Padma Raghavan Professor of Computer Science and Engineering Thesis Co-Advisor Raj Acharya Professor of Computer Science and Engineering Head of the Department of Computer Science and Engineering *Signatures are on file in the Graduate School. iii Abstract Scratchpad memories (SPMs) have been shown to be more energy efficient, have faster access times, and take up less area than traditional hardware-managed caches. This, coupled with the predictability of data presence and reduced thermal properties, makes SPMs an attractive alternative to cache for many scientific applications. In this work, SPM based systems are considered for a variety of different functions. The first study performed is to analyze SPMs for their thermal and area properties on a conven- tional RISC processor. Six performance optimized variants of architecture are explored that evaluate the impact of having an SPM in the on-chip memory hierarchy. Increasing the performance and energy efficiency of both dense and sparse matrix-vector multipli- cation on a chip multi-processor are also looked at. The efficient utilization of the SPM is ensured by profiling the application for the data structures which do not perform well in traditional cache.
    [Show full text]
  • Memory Architectures 13 Preeti Ranjan Panda
    Memory Architectures 13 Preeti Ranjan Panda Abstract In this chapter we discuss the topic of memory organization in embedded systems and Systems-on-Chips (SoCs). We start with the simplest hardware- based systems needing registers for storage and proceed to hardware/software codesigned systems with several standard structures such as Static Random- Access Memory (SRAM) and Dynamic Random-Access Memory (DRAM). In the process, we touch upon concepts such as caches and Scratchpad Memories (SPMs). In general, the emphasis is on concepts that are more generally found in SoCs and less on general-purpose computing systems, although this distinction is not very clearly defined with respect to the memory subsystem. We touch upon implementations of these ideas in modern research and commercial scenarios. In this chapter, we also point out issues arising in the context of the memory architectures that become exported as problems to be addressed by the compiler and system designer. Acronyms ALU Arithmetic-Logic Unit ARM Advanced Risc Machines CGRA Coarse Grained Reconfigurable Architecture CPU Central Processing Unit DMA Direct Memory Access DRAM Dynamic Random-Access Memory GPGPU General-Purpose computing on Graphics Processing Units GPU Graphics Processing Unit HDL Hardware Description Language PCM Phase Change Memory P.R. Panda () Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, India e-mail: [email protected] © Springer Science+Business Media Dordrecht 2017 411 S. Ha, J. Teich (eds.), Handbook of Hardware/Software Codesign, DOI 10.1007/978-94-017-7267-9_14 412 P.R. Panda SoC System-on-Chip SPM Scratchpad Memory SRAM Static Random-Access Memory STT-RAM Spin-Transfer Torque Random-Access Memory SWC Software Cache Contents 13.1 Motivating the Significance of Memory....................................
    [Show full text]
  • Gpgpus: Overview Pedagogically Precursor Concepts UNIVERSITY of ILLINOIS at URBANA-CHAMPAIGN
    GPGPUs: Overview Pedagogically precursor concepts UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN © 2018 L. V. Kale at the University of Illinois Urbana-Champaign Precursor Concepts: Pedagogical • Architectural elements that, at least pedagogically, are precursors to understanding GPGPUs • SIMD and vector units. • We have already seen those • Large scale “Hyperthreading” for latency tolerance • Scratchpad memories • High BandWidth memory L.V.Kale 2 Tera MTA, Sun UltraSPARC T1 (Niagara) • Tera computers, With Burton Smith as a co-founder (1987) • Precursor: HEP processor (Denelcor Inc.), 1982 • First machine Was MTA • MTA-1, MTA-2, MTA-3 • Basic idea: • Support a huge number of hardWare threads (128) • Each With its oWn registers • No Cache! • Switch among threads on every cycle, thus tolerating DRAM latency • These threads could be running different processes • Such processors are called “barrel processors” in literature • But they sWitched to the “next thread” alWays.. So your turn is 127 clocks aWay, always • Was especially good for highly irregular accesses L.V.Kale 3 Scratchpad memory • Caches are complex and can cause unpredictable impact on performance • Scratchpad memories are made from SRAM on chip • Separate part of the address space • As fast or faster than caches, because no tag-matching or associative search • Need explicit instructions to bring data into scratchpad from memory • Load/store instructions exist betWeen registers and scratchpad • Example: IBM/Toshiba/Sony cell processor used in PS/3 • 1 PPE, and 8 SPE cores • Each SPE core has 256 KiB scratchpad • DMA is mechanism for moving data betWeen scratchpad and external DRAM L.V.Kale 4 High BandWidth Memory • As you increase compute capacity of processor chips, the bandWidth to DRAM comes under pressure • Many past improvements (e.g.
    [Show full text]
  • Hardware and Software Optimizations for GPU Resource Management
    Hardware and Software Optimizations for GPU Resource Management A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Vishwesh Jatala to the DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY KANPUR, INDIA December, 2018 ii Scanned by CamScanner Abstract Graphics Processing Units (GPUs) are widely adopted across various domains due to their massive thread level parallelism (TLP). The TLP that is present in the GPUs is limited by the number of resident threads, which in turn depends on the available resources in the GPUs { such as registers and scratchpad memory. Recent GPUs aim to improve the TLP, and consequently the throughput, by increasing the number of resources. Further, the improvements in semiconductor fabrication enable smaller feature sizes. However, for smaller feature sizes, the leakage power is a significant part of the total power consumption. In this thesis, we provide hardware and software solutions that aim towards the two problems of GPU design: improving throughput and reducing leakage energy. In the first work of the thesis, we focus on improving the performance of GPUs by effective resource management. In GPUs, resources (registers and scratchpad memory) are allocated at thread block level granularity, as a result, some of the resources may not be used up completely and hence will be wasted. We propose an approach that shares the resources of SM to utilize the wasted resources by launching more thread blocks in each SM. We show the effectiveness of our approach for two resources: registers and scratchpad memory (shared memory). On evaluating our approach experimentally with 19 kernels from several benchmark suites, we observed that kernels that underutilize register resource show an average improvement of 11% with register sharing.
    [Show full text]
  • Improving Memory Subsystem Performance Using Viva: Virtual Vector Architecture
    Improving Memory Subsystem Performance using ViVA: Virtual Vector Architecture Joseph Gebis12,Leonid Oliker12, John Shalf1, Samuel Williams12,Katherine Yelick12 1 CRD/NERSC, Lawrence Berkeley National Laboratory Berkeley, CA 94720 2 CS Division, University of California at Berkeley, Berkeley, CA 94720 fJGebis, LOliker, JShalf, SWWilliams, [email protected] Abstract. The disparity between microprocessor clock frequencies and memory latency is a primary reason why many demanding applications run well below peak achievable performance. Software controlled scratchpad memories, such as the Cell local store, attempt to ameliorate this discrepancy by enabling precise control over memory movement; however, scratchpad technology confronts the programmer and compiler with an unfamiliar and difficult programming model. In this work, we present the Virtual Vector Architecture (ViVA), which combines the memory semantics of vector computers with a software-controlled scratchpad memory in order to provide a more effective and practical approach to latency hiding. ViVA requires minimal changes to the core design and could thus be eas- ily integrated with conventional processor cores. To validate our approach, we implemented ViVA on the Mambo cycle-accurate full system simulator, which was carefully calibrated to match the performance on our underlying PowerPC Apple G5 architecture. Results show that ViVA is able to deliver significant per- formance benefits over scalar techniques for a variety of memory access pat- terns as well as two important memory-bound compact kernels, corner turn and sparse matrix-vector multiplication — achieving 2x–13x improvement compared the scalar version. Overall, our preliminary ViVA exploration points to a promis- ing approach for improving application performance on leading microprocessors with minimal design and complexity costs, in a power efficient manner.
    [Show full text]
  • A Dynamic Scratchpad Memory Unit for Predictable Real-Time Embedded Systems
    A Dynamic Scratchpad Memory Unit for Predictable Real-Time Embedded Systems by Saud Wasly A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Applied Science in Electrical and Computer Engineering Waterloo, Ontario, Canada, 2012 c Saud Wasly 2012 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Scratch-pad memory is a popular alternative to caches in real-time embedded systems due to its advantages in terms of timing predictability and power consumption. However, dynamic management of scratch-pad content is challenging in multitasking environments. To address this issue, this thesis proposes the design of a novel Real-Time Scratchpad Memory Unit (RSMU). The RSMU can be integrated into existing systems with minimal architectural modifications. Furthermore, scratchpad management is performed at the OS level, requiring no application changes. In conjunction with a two-level scheduling scheme, the RSMU provides strong timing guarantees to critical tasks. Demonstration and evaluation of the system design is provided on an embedded FPGA platform. iii Acknowledgements My great gratitude is to Allah the only god, the Almighty who guided me in every step of this work with his infinite graciousness and bounties. I would like to thank all the kind people around me who made this possible, to only some of whom it is possible to give particular mention here.
    [Show full text]
  • Architectural Exploration of Heterogeneous Memory Systems Marcos Horro, Gabriel Rodr´Iguez, Juan Tourino,˜ Mahmut T
    1 Architectural exploration of heterogeneous memory systems Marcos Horro, Gabriel Rodr´ıguez, Juan Tourino,˜ Mahmut T. Kandemir Abstract—Heterogeneous systems appear as a viable design whether an access presents reuse that is easily exploitable alternative for the dark silicon era. In this paradigm, a processor by a regular cache, or whether the LRU algorithm and cache chip includes several different technological alternatives for im- conflicts make it advisable to manually allocate the variable plementing a certain logical block (e.g., core, on-chip memories) which cannot be used at the same time due to power constraints. to a scratchpad to better take advantage of the available The programmer and compiler are then responsible for select- locality. Taking into account the hardware characteristics of ing which of the alternatives should be used for maximizing the different available memory modules, access and transfer performance and/or energy efficiency for a given application. costs for each possible allocation are calculated, and a final This paper presents an initial approach for the exploration of allocation is decided considering also memory sizes and power different technological alternatives for the implementation of on-chip memories. It hinges on a linear programming-based budgets. model for theoretically comparing the performance offered by the This paper is organized as follows. Section II introduces available alternatives, namely SRAM and STT-RAM scratchpads scratchpad memories. Section III analyzes the gem5 frame- or caches. Experimental results using a cycle-accurate simulation work and discusses the simulation of scratchpad memories tool confirm that this is a viable model for implementation into in the system.
    [Show full text]
  • Designing Scratchpad Memory Architecture with Emerging STT-RAM Memory Technologies
    Designing Scratchpad Memory Architecture with Emerging STT-RAM Memory Technologies Peng Wang,1 Guangyu Sun,1 Tao Wang,1 Yuan Xie,2 Jason Cong1,3,4 1Center for Energy-Efficient Computing and Applications, School of EECS, Peking University, Beijing, 100871, China 2Computer Science and Engineering Department, Pennsylvania State University, PA 16802, USA 3Computer Science Department, University of California, Los Angeles, CA 90095, USA 4UCLA/PKU Joint Research Institute in Science and Engineering {wang_peng, gsun, wangtao}@pku.edu.cn, [email protected], [email protected] Abstract—Scratchpad memories (SPMs) have been widely used major drawback we need to overcome. Unlike SRAM, in in embedded systems to achieve comparable performance with which read and write operations consume the same time and better energy efficiency when compared to caches. Spin-transfer energy, a write operation of STT-RAM needs much longer torque RAM (STT-RAM) is an emerging nonvolatile memory latency and higher energy than a read operation. Moreover, technology that has low-power and high-density advantages over the latency and energy of write operations in conventional SRAM. In this study we explore and evaluate a series of STT-RAM are several times larger than those of SRAM. scratchpad memory architectures consisting of STT-RAM. The Since on-chip memory is nearest to CPU in the memory experimental results reveal that with optimized design, STT- hierarchy, reducing the access latency of on-chip memory is RAM is an effective alternative to SRAM for scratchpad critical to performance. memory in low-power embedded systems. New STT-RAM device cell designs have been developed I.
    [Show full text]
  • 5. Embedded Systems Dilemma of Chip Memory Diversity By
    International Journal of Engineering, Pure and Applied Sciences, Vol. 1, No. 1, 2016 Embedded Systems Dilemma of Chip Memory Diversity by Scratchpad Memory for Cache On-chip Memory Ravi Kumar Sharma Research Scholar, Department of Computer Application, Surya World University, Rajpura , India Email: [email protected] Abstract: -The aim of this paper is the problem of chip memory selection for computationally intensive applications by proposing scratch pad memory as an alternative to cache. Area and energy for different scratch pad and cache size are computed using CACTI tools while performance was evaluated using the trace results. In this paper, an algorithm integrated into a compiler is presented which analyses the application and selects program and data parts which are placed into the scratchpad. Comparisons against a cache solution show remarkable advantages between 12% and 43% in energy consumption for designs of the same memory size. Key Words-Scratchpad Memory, Cache Memory, CACTI, Compiler, Memory. 1. INTRODUCTION The salient feature of portable devices is light Experimental environment requires the use of a weight and low power consumption. Applications in packing algorithm (which is a compiler support) multimedia, video processing, speech to map the elements onto the scratchpad memory. processing[1], DSP applications and wireless Finally, we report the performance and energy communication require efficient memory design consumption for different cache and scratchpad since on chip memory occupies more than 50% of sizes, for the various applications. We include the the total chip area [2]. This will typically reduce main memory energy consumption to study the the energy consumption of the memory unit, complete system energy requirements.
    [Show full text]
  • Application-Specific Memory Management in Embedded Systems Using Software-Controlled Caches
    CSAIL Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Application-Specific Memory Management in Embedded Systems Using Software-Controlled Caches Derek Chiou, Prabhat Jain, Larry Rudolph, Srinivas Devadas In the proceedings of the 37th Design Automation Conference Architecture, 2000, June Computation Structures Group Memo 448 The Stata Center, 32 Vassar Street, Cambridge, Massachusetts 02139 ApplicationSp ecic Memory Management for Emb edded Systems Using SoftwareControlled Caches Derek Chiou, Prabhat Jain, Larry Rudolph, and Srinivas Devadas Department of EECS Massachusetts Institute of Technology Cambridge, MA 02139 he and scratchpad memory onchip since each addresses ABSTRACT cac We prop ose a way to improve the p erformance of embed a dierent need Caches are transparent to software since ded pro cessors running dataintensive applications byallow they are accessed through the same address space as the ing software to allo cate onchip memory on an application larger backing storage They often improveoverall software sp ecic basis Onchip memory in the form of cache can p erformance but are unpredictable Although the cache re be made to act like scratchpad memory via a novel hard placement hardware is known predicting its p erformance ware mechanism which we call column caching Column dep ends on accurately predicting past and future reference caching enables dynamic cache partitioning in software by patterns Scratchpad memory is addressed via an indep en mapping data regions to a sp ecied
    [Show full text]
  • FPGA Implementation of a Configurable Cache/Scratchpad
    FPGA Implementation of a Configurable Cache/Scratchpad Memory with Virtualized User-Level RDMA Capability George Kalokerinos, Vassilis Papaefstathiou, George Nikiforos, Stamatis Kavadias, Manolis Katevenis, Dionisios Pnevmatikatos and Xiaojun Yang Institute of Computer Science, FORTH, Heraklion, Crete, Greece – member of HiPEAC {george,papaef,nikiforg,kavadias,kateveni,pnevmati,yxj}@ics.forth.gr Abstract—We report on the hardware implementation of a advances in parallel programming and runtime systems [4][5] local memory system for individual processors inside future allow the use of explicit communication with minimal burden chip multiprocessors (CMP). It intends to support both implicit to the programmers, who merely have to identify the input communication, via caches, and explicit communication, via di- rectly accessible local (”scratchpad”) memories and remote DMA and output data sets of their tasks. (RDMA). We provide run-time configurability of the SRAM Our goal is to provide unified hardware support for both im- blocks near each processor, so that part of them operates as 2nd plicit and explicit communication. To achieve low latency, we level (local) cache, while the rest operates as scratchpad. We also integrate our mechanisms close to the processor, in the upper strive to merge the communication subsystems required by the cache levels, unlike traditional RDMA which is implemented cache and scratchpad into one integrated Network Interface (NI) and Cache Controller (CC), in order to economize on circuits. at the level of the I/O bus. We provide configurability of the The processor communicates with the NI in user-level, through local SRAM blocks that are next to each core, so that they virtualized command areas in scratchpad; through a similar operate either as cache or scratchpad, or as a dynamic mix mechanism, the NI also provides efficient support for synchro- of the two.
    [Show full text]
  • Compiler-Directed Scratchpad Memory Management Via Graph Coloring
    Compiler-Directed Scratchpad Memory Management via Graph Coloring Lian Li, Hui Feng and Jingling Xue University of New South Wales Scratchpad memory (SPM), a fast on-chip SRAM managed by software, is widely used in embed- ded systems. This paper introduces a general-purpose compiler approach, called memory coloring, to assign static data aggregates such as arrays and structs in a program to an SPM. The novelty of this approach lies in partitioning the SPM into a pseudo register file (with interchangeable and aliased registers), splitting the live ranges of data aggregates to create potential data transfer statements between SPM and off-chip memory, and finally, adapting an existing graph coloring algorithm for register allocation to assign the data aggregates to the pseudo register file. Our experimental results using a set of 10 C benchmarks from MediaBench and MiBench show that our methodology is capable of managing SPMs efficiently and effectively for large embedded appli- cations. In addition, our SPM allocator can obtain close to optimal solutions when evaluated and compared against an existing heuristics-based SPM allocator and an ILP-based SPM allocator. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors—compilers; optimization; B.3.2 [Memory Structures]: Design Styles—Primary memory; C.3 [Special- Purpose And Application-Based Systems]: Real Time and Embedded Systems General Terms: Algorithms, Languages, Experimentation, Performance Additional Key Words and Phrases: Scratchpad memory, software-managed cache, memory allo- cation, graph coloring, memory coloring, live range splitting, register coalescing 1. INTRODUCTION Scratchpad memory (SPM) is a fast on-chip SRAM managed by software (the application and/or compiler).
    [Show full text]