CGO 2018
31 papers
- A compiler for cyber-physical digital microfluidic biochips
- Analyzing and optimizing task granularity on the JVM
- AutoPA: automatically generating active driver from original passive driver code
- Automating efficient variable-grained resiliency for low-power IoT systems
- Biological computation (keynote)
- CUDAAdvisor: LLVM-based runtime profiling for modern GPUs
- CVR: efficient vectorization of SpMV on x86 processors
- CollectionSwitch: a framework for efficient and dynamic collection selection
- Conflict-free vectorization of associative irregular applications with recent SIMD architectural advances
- DeLICM: scalar dependence removal at zero memory cost
- Dominance-based duplication simulation (DBDS): code duplication to enable compiler optimizations
- High performance stencil code generation with lift
- Lightweight detection of cache conflicts
- Local memory-aware kernel perforation
- Look-ahead SLP: auto-vectorization in the presence of commutative operations
- Loop transformations leveraging hardware prefetching
- May-happen-in-parallel analysis with static vector clocks
- Optimal DNN primitive selection with partitioned boolean quadratic programming
- Poker: permutation-based SIMD execution of intensive tree search by path encoding
- Program generation for small-scale linear algebra applications
- Qubit allocation
- Register allocation for Intel processor graphics
- Resilient decentralized Android application repackaging detection using logic bombs
- SGXElide: enabling enclave code secrecy via self-modification
- SIMD intrinsics on managed language runtimes
- Scalable concurrency debugging with distributed graph processing
- Synthesizing an instruction selection rule library from semantic specifications
- Synthesizing programs that expose performance bottlenecks
- The generalized matrix chain algorithm
- Transforming loop chains via macro dataflow graphs
- nAdroid: statically detecting ordering violations in Android applications