skip to main content
10.1145/3302516acmotherconferencesBook PagePublication PagesccConference Proceedingsconference-collections
CC 2019: Proceedings of the 28th International Conference on Compiler Construction
ACM2019 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
CC '19: 28th International Conference on Compiler Construction Washington DC USA February 16 - 17, 2019
ISBN:
978-1-4503-6277-1
Published:
16 February 2019
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 16 Feb 2025Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
SESSION: Keynote
invited-talk
The sparse tensor algebra compiler (keynote)

Tensor algebra is a powerful tool with applications in machine learning, data analytics, engineering, and science. Increasingly often the tensors are sparse, which means most components are zeros. To get the best performance, currently programmers are ...

SESSION: Vectors and Accelerators
research-article
PPOpenCL: a performance-portable OpenCL compiler with host and kernel thread code fusion

OpenCL offers code portability but no performance portability. Given an OpenCL program X specifically written for one platform P, existing OpenCL compilers, which usually optimize its host and kernel codes individually, often yield poor performance for ...

research-article
Open Access
Enabling prefix sum parallelism pattern for recurrences with principled function reconstruction

Much research work has been done to parallelize loops with recurrences over the last several decades. Recently, sampling-and-reconstruction method was proposed to parallelize a broad class of loops with recurrences in an automated fashion, with a ...

research-article
Open Access
Revec: program rejuvenation through revectorization

Modern microprocessors are equipped with Single Instruction Multiple Data (SIMD) or vector instructions which expose data level parallelism at a fine granularity. Programmers exploit this parallelism by using low-level vector intrinsics in their code. ...

SESSION: Effective Compilation
research-article
Public Access
To unify or not to unify: a case study on unified builds (in WebKit)

Unified builds are a simple but effective technique to reduce the build time of large software projects. Unified builds generate large compiler tasks by bundling multiple source files into one, resulting in a significant reduction in build time through ...

research-article
A static slicing method for functional programs and its incremental version

An effective static slicing technique for functional programs must have two features. Its handling of function calls must be context sensitive without being inefficient, and, because of the widespread use of algebraic datatypes, it must take into ...

research-article
Public Access
Codestitcher: inter-procedural basic block layout optimization

Modern software executes a large amount of code. Previous techniques of code layout optimization were developed one or two decades ago and have become inadequate to cope with the scale and complexity of new types of applications such as compilers, ...

SESSION: Embedded, IoT, and Web Programming
research-article
Low-cost deterministic C++ exceptions for embedded systems

The C++ programming language offers a strong exception mechanism for error handling at the language level, improving code readability, safety, and maintainability. However, current C++ implementations are targeted at general-purpose systems, often ...

research-article
Spinal code: automatic code extraction for near-user computation in fogs

In the Internet of Things (IoT) environments, cloud servers integrate various IoT devices including sensors and actuators, and provide new services that assist daily lives of users interacting with the physical world. While response time is a crucial ...

research-article
Property caches revisited

Property caches are a well-known technique invented over 30 years ago to improve dynamic object accesses. They have been adapted to JavaScript, which they have greatly contributed to accelerate. However, this technique is applicable only when some ...

research-article
Accelerating web application loading with snapshot of event and DOM handling

Reducing the loading time of a web app is important for a better user experience. The loading time includes a large amount of JavaScript execution, often composed of the execution of the global code in the script tags followed by the execution of event ...

SESSION: Static and Dynamic Analysis
research-article
GPU-accelerated fixpoint algorithms for faster compiler analyses

Inter-procedural data-flow analyses are slow. We parallelize these predicate propagation fixpoint algorithms efficiently on a GPU.

Our approach is (mostly) synchronization free even though the processed graphs in general are cyclic and have nodes with ...

research-article
Compare less, defer more: scaling value-contexts based whole-program heap analyses

The precision of heap analyses determines the precision of several associated optimizations, and has been a prominent area in compiler research. It has been shown that context-sensitive heap analyses are more precise than the insensitive ones, but their ...

research-article
Public Access
Valence: variable length calling context encoding

Many applications, including program optimizations, debugging tools, and event loggers, rely on calling context to gain additional insight about how a program behaves during execution. One common strategy for determining calling contexts is to use ...

research-article
Path sensitive MFP solutions in presence of intersecting infeasible control flow path segments

Data flow analysis computes Maximum Fix Point (MFP) solution which represents an over approximation of the data reaching a program point along all control flow paths (cfps). Some of these cfps may be infeasible; meaning, the necessary pre-condition for ...

SESSION: Scientific Computing Concerns
research-article
Automatic adaptive approximation for stencil computations

Approximate computing is necessary to meet deadlines in some compute-intensive applications like simulation. Building them requires a high level of expertise from the application designers as well as a significant development effort. Some application ...

research-article
Efficiency and expressiveness in UW-OpenMP

OpenMP uses the efficient ‘team of workers’ model, where workers are given chunks of tasks (iterations of a parallel-for-loop, or sections in a parallel-sections block) to execute, and worker (not tasks) can be synchronized using barriers. Thus, OpenMP ...

research-article
Open Access
Efficient concolic testing of MPI applications

Software testing is widely used in industry, but its application in the High Performance Computing area has been scarce. Concolic testing, that automates testing via generation of inputs, has been highly successful for desktop applications and thus ...

Contributors
  • University of Alberta

Index Terms

  1. Proceedings of the 28th International Conference on Compiler Construction

    Recommendations