Presentation Schedule and Readings

Mar 20, 22:  Cache-oblivious algorithms, HTA etc.: Jeevitha + Manoj

1. New abstractions for data-parallel programming, Brodman et al, HotPar 2009
2. An experimental comparison of cache-oblivious and cache-conscious programs, Yotov et al, SPAA 2007

Mar 27, 29:  Auto-tuning (ATLAS, FFTW) - Hemant + Kumar + Siddharth

1. Is search really necessary to generate high-performance BLAS? - http://www.cs.utexas.edu/~pingali/CS395T/2009fa/papers/ieee05.pdf
2. FFTW: An adaptive software architecture for the FFT - http://www.fftw.org/fftw-paper-icassp.pdf
   

Apr 3, 5: Large-scale data analysis - Nikhil + Hector

1. MapReduce - http://research.google.com/archive/mapreduce.html
2. HDFS - http://www.cs.utexas.edu/~nikhil/The_Hadoop_Distributed_File_System.pdf
   

Apr 10, 12: Synthesis - Tyler Smith + Martin Schatz

1. Tensor Contraction Engine - http://www.csc.lsu.edu/%7Egb/TCE/
2. Stencil compiler -http://www.cs.utexas.edu/~pingali/CS395T/2012sp/papers/stencilCompiler.pdf
   

Apr 17, 19: Approximate computing - Diego + Milad + Wei-Lun

1. Green: A Framework for Supporting Energy-conscious Programming using Controlled Approximation, Baek and Chilimbi, PLDI 2010.
2. Exploiting the  Forgiving Nature of Applications for Scalable Parallel Execution. Meng, Raghunathan, Chakradhar, and Byna, IPDPS 2010.
3. Dynamic knobs for power-aware computing. Hoffmann et al ASPLOS, 2011

Apr 24, 26: Parallel data structures - Jeffrey + Yilin

1. Transactional Memory Architectural Support for Lock-Free Data Structures, Maurice Herlihy, J. Eliot B. Moss ISCA 1993.
2. An efficient heuristic procedure for partitioning graphs, Kernighan and Lin, Bell System Technical Journal, 1970.