Discamus continentiam augere, luxuriam coercere
Home -> Publications
Home
  Publications
    
all years
    2019
    2018
    2017
    2016
    2015
    2014
    2013
    2012
    2011
    2010
    2009
    2008
    2007
    2006
    2005
    2004
    theses
    techreports
    presentations
    edited volumes
    conferences
  Awards
  Research
  Teaching
  BLOG
  Miscellaneous
  Full CV [pdf]






  Events








  Past Events





Publications of Torsten Hoefler
Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

T. Gysi, T. Grosser, L. Brandner, T. Hoefler:

 A Fast Analytical Model of Fully Associative Caches

(In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, presented in Phoenix, AZ, USA, pages 816--829, ACM, ISBN: 978-1-4503-6712-7, Jun. 2019)

Abstract

While the cost of computation is an easy to understand local property, the cost of data movement on cached architectures depends on global state, does not compose, and is hard to predict. As a result, programmers often fail to consider the cost of data movement. Existing cache models and simulators provide the missing information but are computationally expensive. We present a lightweight cache model for fully associative caches with least recently used (LRU) replacement policy that gives fast and accurate results. We count the cache misses without explicit enumeration of all memory accesses by using symbolic counting techniques twice: 1) to derive the stack distance for each memory access and 2) to count the memory accesses with stack distance larger than the cache size. While this technique seems infeasible in theory, due to non-linearities after the first round of counting, we show that the counting problems are sufficiently linear in practice. Our cache model often computes the results within seconds and contrary to simulation the execution time is mostly problem size independent. Our evaluation measures modeling errors below 0.6% on real hardware. By providing accurate data placement information we enable memory hierarchy aware software development.

Documents

download article:
download slides:
 

BibTeX

@inproceedings{gysi-haystack,
  author={T. Gysi and T. Grosser and L. Brandner and T. Hoefler},
  title={{A Fast Analytical Model of Fully Associative Caches}},
  year={2019},
  month={Jun.},
  pages={816--829},
  booktitle={Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation},
  location={Phoenix, AZ, USA},
  publisher={ACM},
  isbn={978-1-4503-6712-7},
  source={http://www.unixer.de/~htor/publications/},
}

serving: 34.231.21.123:59914© Torsten Hoefler