Parallel programming with inductive synthesis

Authors:
Shaon Barman;Rastislav Bodik;Sagar Jain;Yewen Pu;Saurabh Srivastava;Nicholas Tung
Affiliations:
University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley
Venue:
HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
Year:
2011

Citing 9
Cited 0

Next-generation generic programming and its application to sparse matrix computations

Proceedings of the 14th international conference on Supercomputing
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
AutoBayes: a system for generating data analysis programs from statistical models

Journal of Functional Programming
Correctness-preserving derivation of concurrent garbage collection algorithms

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Combinatorial sketching for finite programs

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Scan primitives for GPU computing

Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Optimization principles and application performance evaluation of a multithreaded GPU using CUDA

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
From program verification to program synthesis

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automating string processing in spreadsheets using input-output examples

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.02

Visualization

Abstract

We show that program synthesis can generate GPU algorithms as well as their optimized implementations. Using the scan kernel as a case study, we describe our evolving synthesis techniques. Relying on our synthesizer, we can parallelize a serial problem by transforming it into a scan operation, synthesize a SIMD scan algorithm, and optimize it to reduce memory conflicts.