Cracking Intel Sandy Bridge's Cache Hash Function

08/15/2015
by   Zhipeng Wei, et al.
0

On Intel Sandy Bridge processor, last level cache (LLC) is divided into cache slices and all physical addresses are distributed across the cache slices using an hash function. With this undocumented hash function existing, it is impossible to implement cache partition based on page coloring. This article cracks the hash functions on two types of Intel Sandy processors by converting the problem of cracking the hash function to the problem of classifying data blocks into different groups based on eviction relationship existing between data blocks that are mapped to the same cache set. Based on the cracking result, this article proves that it's possible to implement cache partition based on page coloring on cache indexed by hashing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2020

Flushgeist: Cache Leaks from Beyond the Flush

Flushing the cache, using instructions like clflush and wbinvd, is commo...
research
04/11/2023

An Associativity Threshold Phenomenon in Set-Associative Caches

In an α-way set-associative cache, the cache is partitioned into disjoin...
research
03/22/2019

A WCET-aware cache coloring technique for reducing interference in real-time systems

The predictability of a system is the condition to give saferbound on wo...
research
11/12/2017

Strongly Secure and Efficient Data Shuffle On Hardware Enclaves

Mitigating memory-access attacks on the Intel SGX architecture is an imp...
research
11/03/2022

MUSTACHE: Multi-Step-Ahead Predictions for Cache Eviction

In this work, we propose MUSTACHE, a new page cache replacement algorith...
research
01/05/2021

Modeling the Linux page cache for accurate simulation of data-intensive applications

The emergence of Big Data in recent years has resulted in a growing need...

Please sign up or login with your details

Forgot password? Click here to reset