Optimizing Read-Once Data Flow in Big-Data Applications
| Autor: | Avinoam Kolodny, Mattan Erez, Gil Shomron, Tomer Y. Morad, Uri Weiser |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
010302 applied physics
Hardware_MEMORYSTRUCTURES Memory hierarchy Computer science Uniform memory access Registered memory Memory bandwidth 02 engineering and technology computer.software_genre 01 natural sciences 020202 computer hardware & architecture Non-uniform memory access Hardware and Architecture 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Interleaved memory Operating system Computing with Memory Cache computer |
| Zdroj: | IEEE Computer Architecture Letters. 16:68-71 |
| ISSN: | 1556-6056 |
| DOI: | 10.1109/lca.2016.2520927 |
| Popis: | Memory hierarchies in modern computing systems work well for workloads that exhibit temporal data locality. Data that is accessed frequently is brought closer to the computing cores, allowing faster access times, higher bandwidth, and reduced transmission energy. Many applications that work on big data, however, read data only once. When running these applications on modern computing systems, data that is not reused is nevertheless transmitted and copied into all memory hierarchy levels, leading to energy and bandwidth waste. In this paper we evaluate workloads dealing with read-once data and measure their energy consumption. We then modify the workloads so that data that is known to be used only once is transferred directly from storage into the CPU's last level cache, effectively bypassing DRAM and avoiding keeping unnecessary copies of the data. Our measurements on a real system show savings of up to 5 Watts in server power and up to 3.9 percent reduction in server energy when 160 GB of read-once data bypasses DRAM. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|