2014 LLVM Compiler Infrastructure in HPC最新文献

筛选
英文 中文
Architecture-Independent Modeling of Intra-Node Data Movement 节点内数据移动的体系结构独立建模
2014 LLVM Compiler Infrastructure in HPC Pub Date : 2014-11-16 DOI: 10.1109/LLVM-HPC.2014.6
E. Anger, S. Yalamanchili, S. Pakin, P. McCormick
{"title":"Architecture-Independent Modeling of Intra-Node Data Movement","authors":"E. Anger, S. Yalamanchili, S. Pakin, P. McCormick","doi":"10.1109/LLVM-HPC.2014.6","DOIUrl":"https://doi.org/10.1109/LLVM-HPC.2014.6","url":null,"abstract":"A primary concern of future high performance systems is the way data movement is managed; the sheer scale of data to be processed directly affects the achievable performance these systems can attain. However, the increasingly complex but inherently symbiotic relationships between upcoming scientific applications and high-performance architectures necessitate increasingly informative and flexible tools to ensure performance goals are met.In this work we develop a memory-hierarchy model that quantifies a given application's cache behavior. What makes this work unique is that we instrument code at compile time, gather architecture-independent data at run time using a generic memory-hierarchy model, and delay selecting a particular cache hierarchy (levels, sizes, and associativities) to a post-processing step, where cache performance can be derived rapidly without having to re-run a slow cache simulator. We show that this approach is capable of predicting cache misses to within 13% of what is predicted by a traditional, high-fidelity, but slow cache simulator.","PeriodicalId":327591,"journal":{"name":"2014 LLVM Compiler Infrastructure in HPC","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133686410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PACXX: Towards a Unified Programming Model for Programming Accelerators Using C++14 用c++ 14实现加速器的统一编程模型
2014 LLVM Compiler Infrastructure in HPC Pub Date : 2014-11-16 DOI: 10.1109/LLVM-HPC.2014.9
Michael Haidl, S. Gorlatch
{"title":"PACXX: Towards a Unified Programming Model for Programming Accelerators Using C++14","authors":"Michael Haidl, S. Gorlatch","doi":"10.1109/LLVM-HPC.2014.9","DOIUrl":"https://doi.org/10.1109/LLVM-HPC.2014.9","url":null,"abstract":"We present PACXX -- a unified programming model for programming many-core systems that comprise accelerators like Graphics Processing Units (GPUs). One of the main difficulties of the current GPU programming is that two distinct programming models are required: the host code for the CPU is written in C/C++ with the restricted, C-like API for memory management, while the device code for the GPU has to be written using a device-dependent, explicitly parallel programming model, e.g., OpenCL or CUDA. This leads to long, poorly structured and error-prone codes. In PACXX, both host and device programs are written in the same programming language -- the newest C++14 standard, with all modern features including type inference (auto), variadic templates, generic lambda expressions, as well as STL containers and algorithms. We implement PACXX by a custom compiler (based on the Clang front-end and LLVM IR) and a runtime system, that together perform major tasks of memory management and data synchronization automatically and transparently for the programmer. We evaluate our approach by comparing it to CUDA and OpenCL regarding program size and target performance.","PeriodicalId":327591,"journal":{"name":"2014 LLVM Compiler Infrastructure in HPC","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121232945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Coordinating GPU Threads for OpenMP 4.0 in LLVM 在LLVM中协调openmp4.0的GPU线程
2014 LLVM Compiler Infrastructure in HPC Pub Date : 2014-11-16 DOI: 10.1109/LLVM-HPC.2014.10
C. Bertolli, S. Antão, A. Eichenberger, K. O'Brien, Zehra Sura, A. Jacob, Tong Chen, Olivier Sallenave
{"title":"Coordinating GPU Threads for OpenMP 4.0 in LLVM","authors":"C. Bertolli, S. Antão, A. Eichenberger, K. O'Brien, Zehra Sura, A. Jacob, Tong Chen, Olivier Sallenave","doi":"10.1109/LLVM-HPC.2014.10","DOIUrl":"https://doi.org/10.1109/LLVM-HPC.2014.10","url":null,"abstract":"GPUs devices are becoming critical building blocks of High-Performance platforms for performance and energy efficiency reasons. As a consequence, parallel programming environment such as OpenMP were extended to support offloading code to such devices. OpenMP compilers are faced with offering an efficient implementation of device-targeting constructs. One main issue in implementing OpenMP on a GPU is related to efficiently supporting sequential and parallel regions, as GPUs are only optimized to execute highly parallel workloads. Multiple solutions to this issue were proposed in previous research. In this paper, we propose a method to coordinate threads in an NVIDIA GPU that is both efficient and easily integrated as part of a compiler. To support our claims, we developed CUDA programs that mimic multiple coordination schemes and we compare their performances. We show that a scheme based on dynamic parallelism performs poorly compared to inspector-executor schemes that we introduce in this paper. We also discuss how to integrate these schemes to the LLVM compiler infrastructure.","PeriodicalId":327591,"journal":{"name":"2014 LLVM Compiler Infrastructure in HPC","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 63
Towards Providing Low-Overhead Data Race Detection for Large OpenMP Applications 为大型OpenMP应用程序提供低开销的数据竞争检测
2014 LLVM Compiler Infrastructure in HPC Pub Date : 2014-11-16 DOI: 10.1109/LLVM-HPC.2014.7
Joachim Protze, Simone Atzeni, D. Ahn, M. Schulz, G. Gopalakrishnan, Matthias S. Müller, I. Laguna, Zvonimir Rakamaric, Gregory L. Lee
{"title":"Towards Providing Low-Overhead Data Race Detection for Large OpenMP Applications","authors":"Joachim Protze, Simone Atzeni, D. Ahn, M. Schulz, G. Gopalakrishnan, Matthias S. Müller, I. Laguna, Zvonimir Rakamaric, Gregory L. Lee","doi":"10.1109/LLVM-HPC.2014.7","DOIUrl":"https://doi.org/10.1109/LLVM-HPC.2014.7","url":null,"abstract":"Neither static nor dynamic data race detection methods, by themselves, have proven to be sufficient for large HPC applications, as they often result in high runtime overheads and/or low race-checking accuracy. While combined static and dynamic approaches can fare better, creating such combinations, in practice, requires attention to many details. Specifically, existing state-of-the-art dynamic race detectors are aimed at low-level threading models, and cannot handle high-level models such as OpenMP. Further, they do not provide mechanisms by which static analysis methods can target selected regions of code with sufficient precision. In this paper, we present our solutions to both challenges. Specifically, we identify patterns within OpenMP runtimes that tend to mislead existing dynamic race checkers and provide mechanisms that help establish an explicit happens-before relation to prevent such misleading checks. We also implement a fine-grained blacklist mechanism to allow a runtime analyzer to exclude regions of code at line number granularity. We support race checking by adapting ThreadSanitizer, a mature data-race checker developed at Google that is now an integral part of Clang and GCC; and we have implemented our techniques within the state-of-the-art Intel OpenMP Runtime. Our results demonstrate that these techniques can significantly improve runtime analysis accuracy and overhead in the context of data race checking of OpenMP applications.","PeriodicalId":327591,"journal":{"name":"2014 LLVM Compiler Infrastructure in HPC","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126118801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
SamplePGO - The Power of Profile Guided Optimizations without the Usability Burden SamplePGO -配置文件引导优化的力量,没有可用性负担
2014 LLVM Compiler Infrastructure in HPC Pub Date : 2014-11-16 DOI: 10.1109/LLVM-HPC.2014.8
Diego Novillo
{"title":"SamplePGO - The Power of Profile Guided Optimizations without the Usability Burden","authors":"Diego Novillo","doi":"10.1109/LLVM-HPC.2014.8","DOIUrl":"https://doi.org/10.1109/LLVM-HPC.2014.8","url":null,"abstract":"Profile-guided optimizations (PGO) offer more optimization opportunities that are typically hard to obtain with static heuristics and techniques. In several application domains, significant performance can be gained by using runtime profiles to guide optimization. However, traditional PGO techniques that rely on compiler instrumentation are difficult enough to use that they have not become very popular.This paper describes SamplePGO, an LLVM implementation of a profile-guided technique that addresses the usability problem. Instead of using compiler-generated instrumentation to generate profiles, it relies on profile information gathered by external sampling profilers. These profilers use commonly available hardware counters to inspect the execution of a program.In our experience with large applications in video/image processing, logs processing, web search and ads, we have obtained, in our GCC implementation, performance improvements of up to 30% using SamplePGO over statically optimized code.While the LLVM implementation is fully functional as of LLVM 3.5, not many optimization passes in LLVM make use of profile information. Therefore, the speedups we have been able to obtain using LLVM are much more modest (up to 5% over statically optimized code).","PeriodicalId":327591,"journal":{"name":"2014 LLVM Compiler Infrastructure in HPC","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124450196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书