NDLI: Optimistic loop optimization

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

Legato: end-to-end bounded region serializability using commodity hardware transactional memory

TwinKernels: an execution model to improve GPU hardware scheduling at compile time

Synthesizing benchmarks for predictive modeling

Pointer disambiguation via strict inequalities

Clairvoyance: look-ahead compile-time scheduling

Incremental whole program optimization and compilation

Discovery and exploitation of general reductions: a constraint based approach

Automatic detection of extended data-race-free regions

Taming warp divergence

Formalizing the concurrency semantics of an LLVM fragment

A collaborative dependence analysis framework

Phase-aware optimization in approximate computing

Optimizing function placement for large-scale data-center applications

Parallel associative reductions in halide

FinePar: irregularity-aware fine-grained workload partitioning on integrated architectures

Dynamic buffer overflow detection for GPGPUs

ThinLTO: scalable and incremental LTO

Characterizing data organization effects on heterogeneous memory architectures

A space- and energy-efficient code Compression/Decompression technique for coarse-grained reconfigurable architectures

Minimizing the cost of iterative compilation with active learning

Optimistic loop optimization

Lift: a functional data-parallel IR for high-performance GPU code generation

Automatic generation of fast BLAS3-GEMM: a portable compiler approach

Cross-ISA machine emulation for multicores

Removing checks in dynamically typed languages through efficient profiling

Software prefetching for indirect memory accesses

Optimistic loop optimization

Content Provider	ACM Digital Library
Author	Hack, Sebastian Grosser, Tobias Doerfert, Johannes
Abstract	Compilers use static analyses to justify program optimizations. As every optimization must preserve the semantics of the original program, static analysis typically fall-back to conservative approximations. Consequently, the set of states for which the optimization is invalid is overapproximated and potential optimization opportunities are missed. Instead of justifying the optimization statically, a compiler can also synthesize preconditions that imply the correctness of the optimizations and are checked at the runtime of the program. In this paper, we present a framework to collect, generalize, and simplify assumptions based on Presburger arithmetic. We introduce different assumptions necessary to enable a variety of complex loop transformations and derive a (close to) minimal set of preconditions to validate them at runtime. Our evaluation shows that the runtime verification introduces negligible overhead and that the assumptions we propose almost always hold true. On a large benchmark set including SPEC and NPB our technique increases the number of modeled non-trivial loop nests by a factor of 3.9x . .
Starting Page	292
Ending Page	304
Page Count	13
File Format	PDF
ISBN	9781509049318
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-02-04
Access Restriction	Subscribed
Subject Keyword	Polyhedral model Static analysis Program versioning Presburger precondition
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

The Z-Polyhedral Model (2007)

POSTER: Hybrid Data Dependence Analysis for Loop Transformations

Simplifying reductions

The Z-polyhedral model

Program Analysis with Presburger Integer Formulae

A recommender for conflict resolution support in optimistic model versioning

Program analysis with presburger integer formulae.

A Fast and Precise Static Loop Analysis based on Abstract (2009)

Verifying eventual consistency of optimistic replication systems

Optimistic loop optimization

Similar Documents

The Z-Polyhedral Model (2007)

POSTER: Hybrid Data Dependence Analysis for Loop Transformations

Simplifying reductions

The Z-polyhedral model

Program Analysis with Presburger Integer Formulae

A recommender for conflict resolution support in optimistic model versioning

Program analysis with presburger integer formulae.

A Fast and Precise Static Loop Analysis based on Abstract (2009)

Verifying eventual consistency of optimistic replication systems

Optimistic loop optimization