NDLI: Exhaustive Optimization Phase Order Space Exploration

Please wait, while we are loading the content...

International Symposium on Code Generation and Optimization - Title Page

International Symposium on Code Generation and Optimization - Copyright

Message from the General Co-Chairs

Message from the Program Chair

Committees

Reviewers

Corporate Sponsors

A Cross-Architectural Interface for Code Cache Manipulation

Thread-Shared Software Code Caches

Tailoring Graph-coloring Register Allocation For Runtime Compilation

A Self-Repairing Prefetcher in an Event-Driven Dynamic Optimization Framework

Java JNI Bridge: A Framework for Mixed Native ISA Execution

Space-Efficient 64-bit Java Objects through Selective Typed Virtual Addressing

Experiences with Multi-threading and Dynamic Class Loading in a Java Just-In-Time Compiler

Dynamic Class Hierarchy Mutation

Online Phase Detection Algorithms

Region Monitoring for Local Phase Detection in Dynamic Optimization Systems

Selecting Software Phase Markers with Code Structure Analysis

Profiling over Adaptive Ranges

2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set

Constructing Virtual Architectures on a Tiled Processor

Compiling for EDGE Architectures

Data and Computation Transformations for Brook Streaming Applications on Multiprocessors

Compiler-directed Data Partitioning for Multicluster Processors

Inline Analysis: Beyond Selection Heuristics

Practical Structure Layout Optimization and Advice

Post Register Allocation Spill Code Optimization

A Compiler-Guided Approach for Reducing Disk Power Consumption by Exploiting Disk Access Locality

Optimizing Dynamic Binary Translation for SIMD Instructions

Multi-platform Auto-vectorization

Using Machine Learning to Focus Iterative Optimization

Exhaustive Optimization Phase Order Space Exploration

Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning

Software-Based Transparent and Comprehensive Control-Flow Error Detection

Compiler Optimizations to Reduce Security Overhead

BIRD: Binary Interpretation using Runtime Disassembly

Author Index

International Symposium on Code Generation and Optimization - Front Cover

Exhaustive Optimization Phase Order Space Exploration

Content Provider	ACM Digital Library
Author	Tyson, Gary S. Kulkarni, Prasad A. Davidson, Jack W. Whalley, David B.
Abstract	The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be applied in any order. These phases interact by enabling or disabling opportunities for other optimization phases to be applied. As a result, varying the order of applying optimization phases to a program can produce different code, with potentially significant performance variation amongst them. Complicating this problem further is the fact that there is no universal optimization phase order that will produce the best code, since the best phase order depends on the function being compiled, the compiler, and the target architecture characteristics. Moreover, finding the optimal optimization sequence for even a single function is hard as the space of attempted optimization phase sequences is huge and the interactions between different optimizations are poorly understood. Most previous studies performed to search for the most effective optimization phase sequence assume the optimization phase order search space to be extremely large, and hence consider exhaustive exploration of this space infeasible. In this paper we show that even though the attempted search space is extremely large, with careful and aggressive pruning it is possible to limit the actual search space with no loss of information so that it can be completely evaluated in a matter of minutes or a few hours for most functions. We were able to exhaustively enumerate all the possible function instances that can be produced by different phase orderings performed by our compiler for more than 98% of the functions in our benchmark suite. In this paper we describe the algorithm we used to make exhaustive search of the optimization phase order space possible. We then analyze this space to automatically calculate relationships between different phases. Finally, we show that the results of this analysis can be used to reduce the compilation time for a conventional batch compiler.
Starting Page	306
Ending Page	318
Page Count	13
File Format	PDF
ISBN	0769524990
DOI	10.1109/CGO.2006.15
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-03-26
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exhaustive optimization phase order space exploration

Practical exhaustive optimization phase order exploration and evaluation.

Exhaustive optimization phase order space exploration (2006)

Exhaustive optimization phase order space exploration (2006)

Evaluating heuristic optimization phase order search algorithms (2007)

Practical exhaustive optimization phase order exploration and evaluation

Hybrid performance analysis to accelerate compiler optimization space exploration for in-order processors

Efficient High Level Synthesis Exploration Methodology Combining Exhaustive and Gradient-Based Pruned Searching

Exploration of compiler optimization sequences using clustering-based selection

Exhaustive Optimization Phase Order Space Exploration

Similar Documents

Exhaustive optimization phase order space exploration

Practical exhaustive optimization phase order exploration and evaluation.

Exhaustive optimization phase order space exploration (2006)

Exhaustive optimization phase order space exploration (2006)

Evaluating heuristic optimization phase order search algorithms (2007)

Practical exhaustive optimization phase order exploration and evaluation

Hybrid performance analysis to accelerate compiler optimization space exploration for in-order processors

Efficient High Level Synthesis Exploration Methodology Combining Exhaustive and Gradient-Based Pruned Searching

Exploration of compiler optimization sequences using clustering-based selection

Exhaustive Optimization Phase Order Space Exploration