Implementation of a Cache Miss Calculator in LLVM/Polly

Joshi, Keyur and Upadrasta, Ramakrishna and Cohen, Albert (2017) Implementation of a Cache Miss Calculator in LLVM/Polly. In: The Fourth Workshop on the LLVM Compiler Infrastructure in HPC, 13 November 2017, Denver, Colorado, USA.

Full text not available from this repository. (Request a copy)

Abstract

We propose an LLVM pass to mathematically measure cache misses for Static Control Parts (SCoPs) of programs. Our implementation builds on top of the Polly infrastructure and has support for features such as LRU associativity, unknown array base addresses, and (some) approximation. We describe our preliminary results and limitations by using this pass on a selection of SCoPs. Finally we list directions for expanding and improving this work.

[error in script]

IITH Creators:	IITH Creators ORCiD Upadrasta, Ramakrishna UNSPECIFIED
Item Type:	Conference or Workshop Item (Paper)
Subjects:	Computer science
Divisions:	Department of Computer Science & Engineering
Depositing User:	Team Library
Date Deposited:	17 May 2019 04:23
Last Modified:	17 May 2019 04:23
URI:	http://raiithold.iith.ac.in/id/eprint/5207
Publisher URL:	https://llvm-hpc4-workshop.github.io/
Related URLs:

Actions (login required)

View Item

Statistics for this ePrint Item