Papers for Projects

Cache Oblivious Algorithms

Cache Oblivous Algorithms : Frigo et al provide an overview of several cache oblivious algorithms
Cache Oblivious Sorting : Vinther's Master's thesis on cache-oblivious sorting algorithms
Survey Paper : Demaine provides a survey of cache oblivious algorithms
Thesis : Olsen and Skov's Masters thesis on the implementation of cache oblivious and a comparison to cache-aware algorithms

Data Locality and Parallelization for Ray-Tracing

SIGGRAPH : A SIGGRAPH site with several links providing an overview of ray-tracing.
SIGGRAPH 1997 paper : Pharr et al paper describes a method of performing ray tracing in a cache-coherent manner.
International Journal of Parallel Programming paper : Kodukula and Pingali paper discusses "data-shackling," a method of achieving locality enhancing transforms by examining data flow.

Data Structure Invariance and Automatic Repair

OOPSLA 2003 paper : Demsky and Rinard discuss the use of data structure invariants to allow for run time detection and repair of errors in data structures.

Compiler Driven Phase Detection

ISCA 2003 paper : Sherwood, Sair and Calder paper giving an introduction to hardware based phase detection.
ASPLOS 2004 paper : Shen, Zhong and Ding propose an alternate method of performing phase detection.

Provably Correct Compilers

PLDI 2003 paper : Lerner, Millstein and Chambers describe a technique for proving the soundness of compiler optimizations
POPL 2005 paper : Lerner et al describe Rhodium, a language for writing compiler optimizations in a manner that can automatically be proven sound.

Adaptive Sorting

CGO 2004 paper : Li, Garzaran and Padua discuss performing an ATLAS-like search to produce a dynamically-tuned library for sorting.
CGO 2005 paper : Li, Garzaran and Padua discuss using genetic algorithms to optimize sorting.
ALENEX 2004 presentation : Brodal, Fagerberg and Vinther discuss cache-oblivious sorting algorithms

Cache-conscious Data Placement

ASPLOS '98 paper : Calder et al discuss a compiler-driven method that utilizes profiling to determine address locations to minimize data misses in the cache.
PLDI '99 paper : Chilimbi, Hill and Larus explores two techniques for improving the spatial and temporal locality of pointer-based data structures.

Additional reading material

Application-level fault-tolerance

PPoPP 2003 paper : Bronovetsky et al paper describes co-ordination protocol for application-level FT
Paper on extending protocol to MPI collective operations : submitted to ICS 2003
CS 717 papers : This site has a lot of papers on fault-tolerance that we found useful when learning about FT

Monday, April 04, 2005 02:12:53 PM Last modified: Thursday, March 27, 2003 02:06:31 PM