Carnegie Mellon

Program Generation with Spiral: Beyond Transforms

This work was supported by DARPA DESA program, NSF-NGS/ITR, NSF-ACR, Mercury Inc., and Intel

Franz Franchetti, Daniel Mcfarlin, Frédéric de Mesmay, Hao Shen, Tomasz W. Włodarczyk, Srinivas Chellappa, Marek R. Telgarsky, Peter A. Milder, Yevgen Voronenko, Qian Yu, James C. Hoe, José M. F. Moura, Markus Püschel

Electrical and Computer EngineeringCarnegie Mellon University

Carnegie Mellon

Vision Behind Spiral

Numerical problem

Computing platform

algorithm selection

compilation

hu

man

eff

ort

auto

mat

ed

implementationC program

auto

mat

edalgorithm selection

compilation

implementation

Numerical problem

Computing platform

Current Future

C code a singularity: Compiler hasno access to high level information

Challenge: conquer the high abstraction level for complete automation

Carnegie Mellon

Main Idea: Program Generation

νpμ

Architectural parameter:Vector length, #processors, …

rewritingdefines

Kernel: problem size, algorithm choice

picksearch

abstraction abstraction

Model: common abstraction= spaces of matching formulas

architecturespace

algorithmspace

optimization

Carnegie Mellon

Expressing Kernels as Operator FormulasViterbi DecoderMatrix-Matrix Multiplication

JPEG 2000 (Wavelet, EBCOT) Synthetic Aperture Radar (SAR)interpolation 2D iFFTmatched

filteringpreprocessing

convolutionalencoder

Viterbidecoder

010001 11 10 00 01 10 01 11 00 01000111 10 01 01 10 10 11 00

JPEG 2000 Compression

DWT quantization entropy coding(EBCOT + MQ)

= £

£