scholarly journals Organizing the Last Line of Defense before Hitting the Memory Wall for CMPs

2005 ◽  
Author(s):  
Chun Liu ◽  
A. Sivasubramaniam ◽  
M. Kandemir
Keyword(s):  
Memory Wall

Joint Management of CPU and NVDIMM for Breaking Down the Great Memory Wall

2020 ◽  
Vol 69 (5) ◽  
pp. 722-733
Author(s):  
Chun-Feng Wu ◽  
Yuan-Hao Chang ◽  
Ming-Chang Yang ◽  
Tei-Wei Kuo
Keyword(s):  
Memory Wall ◽  
Joint Management ◽  
Great Memory

Breaking down memory walls

2020 ◽  
Vol 14 (3) ◽  
pp. 241-254
Author(s):  
Chen Luo ◽  
Michael J. Carey
Keyword(s):  
Memory Management ◽  
Storage Systems ◽  
Memory Allocation ◽  
Adaptive Memory ◽  
Component Structure ◽  
Memory Wall ◽  
Buffer Cache ◽  
Management Architecture

Log-Structured Merge-trees (LSM-trees) have been widely used in modern NoSQL systems. Due to their out-of-place update design, LSM-trees have introduced memory walls among the memory components of multiple LSM-trees and between the write memory and the buffer cache. Optimal memory allocation among these regions is non-trivial because it is highly workload-dependent. Existing LSM-tree implementations instead adopt static memory allocation schemes due to their simplicity and robustness, sacrificing performance. In this paper, we attempt to break down these memory walls in LSM-based storage systems. We first present a memory management architecture that enables adaptive memory management. We then present a partitioned memory component structure with new flush policies to better exploit the write memory to minimize the write cost. To break down the memory wall between the write memory and the buffer cache, we further introduce a memory tuner that tunes the memory allocation between these two regions. We have conducted extensive experiments in the context of Apache AsterixDB using the YCSB and TPC-C benchmarks and we present the results here.

scholarly journals Data Processing and Information Classification: An In-Memory Approach

2020 ◽  
Author(s):  
Milena Andrighetti ◽  
Giovanna Turvani ◽  
Giulia Santoro ◽  
Marco Vacca ◽  
Andrea Marchesin ◽  
...  
Keyword(s):  
Information Society ◽  
Electronic Devices ◽  
Cmos Technology ◽  
Hardware Accelerator ◽  
Huge Amount ◽  
Memory Wall ◽  
Information Classification ◽  
Enormous Amount ◽  
Many Sources ◽  
Problem Data

To live in the information society means to be surrounded by billions of electronic devices full of sensors that constantly acquire data. This enormous amount of data must be processed and classified. A solution commonly adopted is to send these data to server farms to be remotely elaborated. The drawback is a huge battery drain due to high amount of information that must be exchanged. To compensate this problem data must be processed locally, near the sensor itself. But this solution requires huge computational capabilities. While microprocessors, even mobile ones, nowadays have enough computational power, their performance are severely limited by the Memory Wall problem. Memories are too slow, so microprocessors cannot fetch enough data from them, greatly limiting their performance. A solution is the Processing-In-Memory (PIM) approach. New memories are designed that are able to elaborate data inside them eliminating the Memory Wall problem. In this work we present an example of such system, using as a case of study the Bitmap Indexing algorithm. Such algorithm is used to classify data coming from many sources in parallel. We propose an hardware accelerator designed around the Processing-In-Memory approach, that is capable of implementing this algorithm and that can also be reconfigured to do other tasks or to work as standard memory. The architecture has been synthesized using CMOS technology. The results that we have obtained highlights that, not only it is possible to process and classify huge amount of data locally, but also that it is possible to obtain this result with a very low power consumption.

scholarly journals When Parallel Speedups Hit the Memory Wall

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 79225-79238
Author(s):  
Alex F. A. Furtunato ◽  
Kyriakos Georgiou ◽  
Kerstin Eder ◽  
Samuel Xavier-De-Souza
Keyword(s):  
Memory Wall

VASP hits the memory wall: Processors efficiency comparison

2019 ◽  
Vol 31 (19) ◽  
Author(s):  
Vladimir Stegailov ◽  
Grigory Smirnov ◽  
Vyacheslav Vecher
Keyword(s):  
Memory Wall ◽  
Efficiency Comparison

scholarly journals A New Embedded Key–Value Store for NVM Device Simulator

Micromachines ◽  
2020 ◽  
Vol 11 (12) ◽  
pp. 1075
Author(s):  
Tao Cai ◽  
Qingjian He ◽  
Dejiao Niu ◽  
Fuli Chen ◽  
Jie Wang ◽  
...  
Keyword(s):  
Operating System ◽  
Operating Systems ◽  
Management Strategy ◽  
Data Transfer ◽  
Data Layout ◽  
Kernel Space ◽  
Embedded Processor ◽  
Memory Wall ◽  
Non Volatile Memory ◽  
User Space

The non-volatile memory (NVM) device is a useful way to solve the memory wall in computers. However, the current I/O software stack in operating systems becomes a performance bottleneck for applications based on NVM devices, especially for key–value stores. We analyzed the characteristics of key–value stores and NVM devices and designed a new embedded key–value store for an NVM device simulator named PMEKV. The embedded processor in NVM devices was used to manage key–value pairs to reduce the data transfer between NVM devices and key–value applications. Meanwhile, it also cut down the data copy between the user space and the kernel space in the operating system to alleviate the I/O software stacks on the efficiency of key–value stores. The architecture, data layout, management strategy, new interface and log strategy of PMEKV are given. Finally, a prototype of PMEKV was implemented based on PMEM. We used YCSB to test and compare it with Redis, MongDB, and Memcache. Meanwhile, the Redis for PMEM named PMEM-Redis and PMEM-KV were also used to test and compared with PMEKV. The results show that PMEKV had the advantage of throughput and adaptability compared with the current key–value stores.

Mitigating Memory Wall Effects in High-Clock-Rate and Multicore CMOS 3-D Processor Memory Stacks

2009 ◽  
Vol 97 (1) ◽  
pp. 108-122 ◽  
Author(s):  
Philip Jacob ◽  
Aamir Zia ◽  
Okan Erdogan ◽  
Paul M. Belemjian ◽  
Jin-Woo Kim ◽  
...  
Keyword(s):  
Wall Effects ◽  
Clock Rate ◽  
Memory Wall
Sign in / Sign up

Export Citation Format

Share Document