research-article

Open access

Data-centric combinatorial optimization of parallel code

Authors:

Hao Luo,

Guoyang Chen,

Pengcheng Li,

Chen Ding,

Xipeng ShenAuthors Info & Claims

PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Article No.: 38, Pages 1 - 2

https://doi.org/10.1145/2851141.2851182

Published: 27 February 2016 Publication History

PDF eReader

Abstract

Memory 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 with heterogeneous memory resources. The new model is composable, meaning it can predict the performance difference due to placing data differently by profiling the execution just once.

References

[1]

G. Chen, B. Wu, D. Li, and X. Shen. PORPLE: An extensible optimizer for portable data placement on GPU. In Proceedings of MICRO, 2014.

Digital Library

Google Scholar

[2]

P. J. Denning. The working set model for program behaviour. Communications of the ACM, 11(5):323--333, 1968.

Digital Library

Google Scholar

[3]

C. Ding and T. Chilimbi. All-window profiling of concurrent executions. In Proceedings of PPoPP, 2008. Poster paper.

Digital Library

Google Scholar

[4]

X. Xiang, B. Bao, T. Bai, C. Ding, and T. M. Chilimbi. All-window profiling and composable models of cache sharing. In Proceedings of PPoPP, pages 91--102, 2011.

Digital Library

Google Scholar

[5]

X. Xiang, C. Ding, H. Luo, and B. Bao. HOTL: a higher order theory of locality. In Proceedings of ASPLOS, pages 343--356, 2013.

Digital Library

Google Scholar

Cited By

View all

Li PGuo YGu Y(2022)Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning ApproachSC22: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41404.2022.00091(1-15)Online publication date: Nov-2022
https://doi.org/10.1109/SC41404.2022.00091
Li PLuo HDing CSinger JXu H(2019)Timescale functions for parallel memory allocationProceedings of the 2019 ACM SIGPLAN International Symposium on Memory Management10.1145/3315573.3329987(64-78)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3315573.3329987
Li PPronovost CWilson WTait BZhou JDing CCriswell JBahar IHerlihy MWitchel ELebeck A(2019)Beating OPT with Statistical Clairvoyance and Variable Size CachingProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3297858.3304067(243-256)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3297858.3304067
Show More Cited By

Index Terms

Data-centric combinatorial optimization of parallel code
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Modeling methodologies

Recommendations

Data-centric combinatorial optimization of parallel code
PPoPP '16

Memory 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 ...
Uniform lease vs. LRU cache: analysis and evaluation
ISMM 2021: Proceedings of the 2021 ACM SIGPLAN International Symposium on Memory Management

Lease caching is a new technique that provides greater control of the cache than what is allowed in conventional caches. The simplest control is uniform lease (UL), which means that all leases are identical in length. The UL cache is prescriptive and ...
HOTL: a higher order theory of locality
ASPLOS '13

The 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 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

February 2016

420 pages

ISBN:9781450340922

DOI:10.1145/2851141

General Chair:
Rafael Asenjo
University of Málaga, Spain
,
Program Chair:
Tim Harris
Oracle Labs, Cambridge, UK

ACM SIGPLAN Notices Volume 51, Issue 8
PPoPP '16
August 2016
405 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/3016078
Editor:
Matthew Fluet
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

PPoPP '16

Sponsor:

PPoPP '16: 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

March 12 - 16, 2016

Barcelona, Spain

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
527
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li PGuo YGu Y(2022)Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning ApproachSC22: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41404.2022.00091(1-15)Online publication date: Nov-2022
https://doi.org/10.1109/SC41404.2022.00091
Li PLuo HDing CSinger JXu H(2019)Timescale functions for parallel memory allocationProceedings of the 2019 ACM SIGPLAN International Symposium on Memory Management10.1145/3315573.3329987(64-78)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3315573.3329987
Li PPronovost CWilson WTait BZhou JDing CCriswell JBahar IHerlihy MWitchel ELebeck A(2019)Beating OPT with Statistical Clairvoyance and Variable Size CachingProceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3297858.3304067(243-256)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3297858.3304067
Chen DLiu FDing CPai S(2018)Locality analysis through static parallel samplingACM SIGPLAN Notices10.1145/3296979.319240253:4(557-570)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192402
Chen DLiu FDing CPai SFoster JGrossman D(2018)Locality analysis through static parallel samplingProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192402(557-570)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192402
Li PChakrabarti DDing CYuan L(2017)Adaptive Software Caching for Efficient NVRAM Data Persistence2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2017.83(112-122)Online publication date: May-2017
https://doi.org/10.1109/IPDPS.2017.83
Li PLuo HDing C(2016)Rethinking a heap hierarchy as a cache hierarchy: a higher-order theory of memory demand (HOTM)ACM SIGPLAN Notices10.1145/3241624.292670851:11(111-121)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/3241624.2926708
Li PLuo HDing CFlood CZhang Z(2016)Rethinking a heap hierarchy as a cache hierarchy: a higher-order theory of memory demand (HOTM)Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management10.1145/2926697.2926708(111-121)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2926697.2926708

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Data-centric combinatorial optimization of parallel code

Uniform lease vs. LRU cache: analysis and evaluation

HOTL: a higher order theory of locality