Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleApril 2019
Beating OPT with Statistical Clairvoyance and Variable Size Caching
ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating SystemsPages 243–256https://doi.org/10.1145/3297858.3304067Caching techniques are widely used in today's computing infrastructure from virtual memory management to server cache and memory cache. This paper builds on two observations. First, the space utilization in cache can be improved by varying the cache ...
- research-articleFebruary 2016
Data-centric combinatorial optimization of parallel code
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel ProgrammingArticle No.: 38, Pages 1–2https://doi.org/10.1145/2851141.2851182Memory performance is one essential factor for tapping into the full potential of the massive parallelism of GPU. It has motivated some recent efforts in GPU cache modeling. This paper presents a new data-centric way to model the performance of a system ...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 8 - research-articleMarch 2013
HOTL: a higher order theory of locality
ASPLOS '13: Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systemsPages 343–356https://doi.org/10.1145/2451116.2451153The locality metrics are many, for example, miss ratio to test performance, data footprint to manage cache sharing, and reuse distance to analyze and optimize a program. It is unclear how different metrics are related, whether one subsumes another, and ...
Also Published in:
ACM SIGARCH Computer Architecture News: Volume 41 Issue 1ACM SIGPLAN Notices: Volume 48 Issue 4 - ArticleJune 2004
Metrics and models for reordering transformations
MSP '04: Proceedings of the 2004 workshop on Memory system performancePages 23–34https://doi.org/10.1145/1065895.1065899Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Run-time data, and iteration-reordering transformations have been shown to improve ...
