检索结果-内蒙古大学图书馆

compiler optimizations for Parallel Programs 1

31st International Workshop on Languages and compilers for Parallel Computing (LCPC)

作者： Doerfert, Johannes Finkel, Hal Argonne Natl Lab Argonne Leadership Comp Facil 9700 S Cass Ave Argonne IL 60439 USA

ISBN: (数字)9783030346270

ISBN: (纸本)9783030346270;9783030346263

This paper outlines a research and development program to enhance modern compiler technology, and the LLVM compiler infrastructure specifically, to directly optimize parallel-programming-model constructs. The goal is to produce higher-quality code, and moreover, to remove abstraction penalties generally associated with such constructs. We believe that such abstraction penalties are increasing in importance due to C++ parallel-algorithms libraries and other performance-portability-motivated programming methods. In addition, we will discuss when, and more importantly when not, explicit parallelism-awareness is necessary within the compiler in order to enable the desired optimization capabilities.

关键词： Parallel programming LLVM OpenMP compiler optimizations Intermediate representation Programming models

来源：评论

学校读者我要写书评

暂无评论

compiler optimizations for Parallelizing General-Purpose Applications under Thread-Level Speculation 08

Compiler Optimizations for Parallelizing General-Purpose App...

引用

ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 08)

作者： Zhai, Antonia Wang, Shengyue Yew, Pen-Chung He, Guojin Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

No abstract available.

ISBN: (纸本)9781595939609

No abstract available.

关键词： Thread-Level Speculation Multicore systems compiler optimizations Parallelizing compiler

来源：评论

学校读者我要写书评

暂无评论

compiler optimizations for OpenMP 14th

Compiler Optimizations for OpenMP

引用

14th International Workshop on Open MP (IWOMP)

作者： Doerfert, Johannes Finkel, Hal Argonne Natl Lab Argonne Leadership Comp Facil 9700 S Cass Ave Argonne IL 60439 USA

ISBN: (纸本)9783319985213;9783319985206

Modern compilers support OpenMP as a convenient way to introduce parallelism into sequential languages like C/C++ and Fortran, however, its use also introduces immediate drawbacks. In many implementations, due to early outlining and the indirection though the OpenMP runtime, the front-end creates optimization barriers that are impossible to overcome by standard middle-end compiler passes. As a consequence, the OpenMP-annotated program constructs prevent various classic compiler transformations like constant propagation and loop invariant code motion. In addition, analysis results, especially alias information, is severely degraded in the presence of OpenMP constructs which can severely hurt performance. In this work we investigate to what degree OpenMP runtime aware compiler optimizations can mitigate these problems. We discuss several transformations that explicitly change the OpenMP enriched compiler intermediate representation. They act as stand-alone optimizations but also enable existing optimizations that were not applicable before. This is all done in the existing LLVM/Clang compiler toolchain without introducing a new parallel representation. Our optimizations do not only improve the execution time of OpenMP annotated programs but also help to determine the caveats for transformations on the current representation of OpenMP.

关键词： OpenMP compiler optimizations Alias analysis Variable privatization Barrier elimination Communication optimization

来源：评论

学校读者我要写书评

暂无评论

Understanding the behavior of compiler optimizations

引用

SOFTWARE-PRACTICE & EXPERIENCE 2006年第8期36卷 835-844页

作者： Lee, Han von Dincklage, Daniel Diwan, Amer Moss, J. Eliot B. Univ Colorado Dept Comp Sci Boulder CO 80309 USA Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

compiler optimizations are difficult to implement and add complexity to a compiler. For this reason, compiler writers are selective about implementing them: they implement only the ones that they believe will be beneficial. To support compiler writers in this, we describe a method for measuring the cost and benefits of compiler optimizations, both individually and in synergy with other optimizations. We demonstrate our method by presenting results for the optimizations implemented in the Jikes Research Virtual Machine on the PowerPC and IA32 platforms. Copyright (C) 2006 John Wiley & Sons, Ltd.

关键词： Java compiler optimizations performance evaluation of optimizations

来源：评论

学校读者我要写书评

暂无评论

One Flag to Rule Them All? On the Quest for compiler optimizations to Improve Fault Tolerance 19

One Flag to Rule Them All? On the Quest for Compiler Optimiz...

引用

19th European Dependable Computing Conference (EDCC)

作者： Thunig, Robin Johannfunke, Marcel Wang, Tianhao Schirmeier, Horst Tech Univ Dresden Chair Operating Syst Dresden Germany TU Dortmund Dept Comp Sci 12 Dortmund Germany

ISBN: (纸本)9798350360691;9798350360684

Soft errors pose a threat to all types of software-controlled electronic devices and can result in silent data corruptions (SDCs). compiler optimizations usually target program execution time or memory footprint. They are oblivious of the fault tolerance of the resulting code, yet they might still be beneficial in this regard. However, it is non-trivial to pick a SDC-minimizing subset from the plethora of compiler flags for an individual program. Ideally, a developer could collectively enable reliability-improving optimizations with a single compiler flag. In this paper, we analyze the impact of compiler optimizations on the occurrence of SDCs. We consider nearly all GCC optimizations on x86 under CPU-register faults. We show that the same compiler optimizations can have a positive or negative effect depending on the target program. We search for a beneficial flag combination using a genetic algorithm, accelerated by a machine-learning based SDC predictor. Our findings suggest that while this leads to an improvement over -O0 of 7.1%, -O3 is a good default alternative.

关键词： compiler optimizations fault tolerance genetic algorithm random forests silent data corruption soft error

来源：评论

学校读者我要写书评

暂无评论

Dominance-Based Duplication Simulation (DBDS) Code Duplication to Enable compiler optimizations 2018

Dominance-Based Duplication Simulation (DBDS) Code Duplicati...

引用

16th International Symposium on Code Generation and Optimization (CGO)

作者： Leopoldseder, David Stadler, Lukas Wurthinger, Thomas Eisl, Josef Simon, Doug Moessenboeck, Hanspeter Johannes Kepler Univ Linz Linz Austria Oracle Labs Linz Austria Oracle Labs Zurich Switzerland

ISBN: (纸本)9781450356176

compilers perform a variety of advanced optimizations to improve the quality of the generated machine code. However, optimizations that depend on the data flow of a program are often limited by control-flow merges. Code duplication can solve this problem by hoisting, i.e. duplicating, instructions from merge blocks to their predecessors. However, finding optimization opportunities enabled by duplication is a non-trivial task that requires compile-time intensive analysis. This imposes a challenge on modern (just-in-time) compilers: Duplicating instructions tentatively at every control flow merge is not feasible because excessive duplication leads to uncontrolled code growth and compile time increases. Therefore, compilers need to find out whether a duplication is beneficial enough to be performed. This paper proposes a novel approach to determine which duplication operations should be performed to increase performance. The approach is based on a duplication simulation that enables a compiler to evaluate different success metrics per potential duplication. Using this information, the compiler can then select the most promising candidates for optimization. We show how to map duplication candidates into an optimization cost model that allows us to trade-off between different success metrics including peak performance, code size and compile time. We implemented the approach on top of the GraalVM and evaluated it with the benchmarks Java DaCapo, Scala DaCapo, JavaScript Octane and a micro-benchmark suite, in terms of performance, compilation time and code size increase. We show that our optimization can reach peak performance improvements of up to 40% with a mean peak performance increase of 5.89%, while it generates a mean code size increase of 9.93% and mean compile time increase of 18.44%.

关键词： Code Duplication Tail Duplication compiler optimizations Just-In-Time Compilation Virtual Machines

来源：评论

学校读者我要写书评

暂无评论

Phase Directed compiler optimizations 23

Phase Directed Compiler Optimizations

引用

23rd IEEE International Conference on High Performance Computing (HiPC)

作者： Jain, Era Roy, Subhajit Indian Inst Technol Dept Comp Sci & Engn Kanpur Uttar Pradesh India Google Mountain View CA 94043 USA

ISBN: (纸本)9781509054114

Profile-guided optimizing compilers learn from representative executions of a program to "tune" transformations so as to benefit frequent paths. However, these optimizations view the whole run of a program in a monolithic manner. It is known that a program execution proceeds in phases-each phase corresponding to an identifiable set of control-flow behaviors. This implies that not all control-flows are hot (i.e. executed with a high frequency) all the times. Hence, if a program can switch among a set of hot paths for guiding the optimizations in the different phases, the optimizations may yield powerful results. We propose an algorithm that optimizes the clones of a function according to the different phase behaviors exhibited by the function, and dispatches its calls to the (potentially) most beneficial clone at runtime. This makes it possible to use profile information at a finer granularity than existing approaches. We start off by identifying critical functions that exhibit a high differential in its control-flow profiles, thereby exhibiting widely varying phase behavior. For these critical functions, we compile specialized clones that are tuned for each distinct phase behavior. Finally, we build a phase predictor that, at run-time, predicts the phase that a yet-to-be-executed function invocation would evoke (when executed), and guides the function invocation to the respective clone of the function. We build the predictor by learning a classifier over features extracted from the state of the program with the distinct phases acting as class labels. We demonstrate our algorithm by building a concrete phase-directed optimizer for register allocation (pdra) within the PBQP-based register allocator in the LLVM compiler infrastructure. We compare our allocator against the base allocator and a profile-guided allocator (pgra) that uses the profile information in a monolithic manner without extracting phase information.

关键词： compiler optimizations machine learning register allocation

来源：评论

学校读者我要写书评

暂无评论

Differential Testing of a Verification Framework for compiler optimizations (Case Study) 11

Differential Testing of a Verification Framework for Compile...

引用

IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE)

作者： Utting, Mark Webb, Brae J. Hayes, Ian J. Univ Queensland Sch ITEE Brisbane Qld Australia

ISBN: (纸本)9798350312638

We want to verify the correctness of optimization phases in the GraalVM compiler, which consist of many thousands of lines of complex Java code performing sophisticated graph transformations. We have built high-level models of the data structures and operations of the code using the Isabelle/HOL theorem prover, and can formally verify the correctness of those high-level operations. But the remaining challenge is: how can we be sure that those high-level operations accurately reflect what the Java code is doing? This paper addresses that issue by applying several different kinds of differential testing to validate that the formal model and the Java code have the same semantics. The lessons learned from applying these validation techniques should be applicable to other projects that are building formal models of real-world code.

关键词： differential testing validating specifications compiler optimizations GraalVM compiler Isabelle/HOL

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Effects of compiler optimizations on Mutation Testing at the compiler IR Level 27

Evaluating the Effects of Compiler Optimizations on Mutation...

引用

27th IEEE International Symposium on Software Reliability Engineering (ISSRE)

作者： Harir, Farah Shi, August Converse, Hayes Khurshid, Sarfraz Marinov, Darko Univ Illinois Dept Comp Sci Urbana IL 61801 USA Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781467390026

Software testing is one of the most widely used approaches for improving software reliability. The effectiveness of testing depends to a large extent on the quality of test suites. Researchers have developed various techniques to evaluate the quality of test suites. Of these techniques, mutation testing is generally considered to be the most advanced but also expensive. A key result of applying mutation testing to a given test suite is the mutation score representing the percentage of mutants killed by the test suite. Ideally the mutation score is computed ignoring the mutants that are semantically equivalent to the original code under test or to one another. In this paper, we investigate a new perspective on mutation testing: evaluating how standard compiler optimizations affect the cost and results of mutation testing performed at the compiler intermediate representation. Our study targets LLVM, a popular compiler infrastructure that supports multiple source and target languages. Our evaluation on 18 Coreutils programs discovers several interesting relations between the numbers of mutants (including the numbers on equivalent and duplicated mutants) and mutation scores on unoptimized and optimized programs.

关键词： mutation testing compiler optimizations LLVM

来源：评论

学校读者我要写书评

暂无评论

Reconciling compiler optimizations and WCET Estimation Using Iterative Compilation 40

Reconciling Compiler Optimizations and WCET Estimation Using...

引用

40th IEEE Real-Time Systems Symposium (RTSS)

作者： Dardaillon, Mickael Skalistis, Stefanos Puaut, Isabelle Derrien, Steven INSA IETR UMR 6164 F-35708 Rennes France Univ Rennes CNRS INRIA IRISA F-35708 Rennes France

ISBN: (纸本)9781728144030

Static Worst-Case Execution Time (WCET) estimation techniques operate upon the binary code of a program in order to provide the necessary input for schedulability analysis techniques. compilers used to generate this binary code include tens of optimizations, that can radically change the flow information of the program. Such information is hard to be maintained across optimization passes and may render automatic extraction of important flow information, such as loop bounds, impossible. Thus, compiler optimizations, especially the sophisticated optimizations of mainstream compilers, are typically avoided. In this work, we explore for the first time iterative-compilation techniques that reconcile compiler optimizations and static WCET estimation. We propose a novel learning technique that selects sequences of optimizations that minimize the WCET estimate of a given program. We experimentally evaluate the proposed technique using an industrial WCET estimation tool (AbsInt aiT) over a set of 46 benchmarks from four different benchmarks suites, including reference WCET benchmark applications, image processing kernels and telecommunication applications. Experimental results show that WCET estimates are reduced on average by 20.3% using the proposed technique, as compared to the best compiler optimization level applicable.

关键词： Worst-Case Execution Time Estimation compiler optimizations Iterative Compilation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：