Pointer-Chase Prefetcher for Linked Data Structures

01/20/2018
by   Nitish Kumar Srivastava, et al.
0

Caches only exploit spatial and temporal locality in a set of address referenced in a program. Due to dynamic construction of linked data-structures, they are difficult to cache as the spatial locality between the nodes is highly dependent on the data layout. Prefetching can play an important role in improving the performance of linked data-structures. In this project, a pointer chase mechanism along with compiler hints is adopted to design a prefetcher for linked data-structures. The design is evaluated against the baseline of processor with cache in terms of performance, area and energy

READ FULL TEXT
research
10/20/2021

Fast Bitmap Fit: A CPU Cache Line friendly memory allocator for single object allocations

Applications making excessive use of single-object based data structures...
research
03/14/2022

Automatic Compiler-Based Data Structure Generation

Optimizing compilers are mainly equipped to optimize control flow. The o...
research
05/12/2018

Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes

This paper considers the modelling and the analysis of the performance o...
research
11/18/2022

ACIC: Admission-Controlled Instruction Cache

The front end bottleneck in datacenter workloads has come under increase...
research
07/02/2019

Cache-Friendly Search Trees; or, In Which Everything Beats std::set

While a lot of work in theoretical computer science has gone into optimi...
research
04/30/2021

Speeding up Python-based Lagrangian Fluid-Flow Particle Simulations via Dynamic Collection Data Structures

Array-like collection data structures are widely established in Python's...
research
02/21/2019

Locality

The performance of modern computation is characterized by locality of re...

Please sign up or login with your details

Forgot password? Click here to reset