Keshav Pingali - Selected Publications#

1. Optimistic parallelism requires abstractions. M. Kulkarni et al., ACM PLDI 2007.

2. The TAO of parallelism in algorithms. K. Pingali et al., ACM PLDI 2011.

3. Process decomposition through locality of reference. A.. Rogers and K. Pingali, ACM PLDI 1989.

4. A lightweight infrastructure for graph analytics. D. Nguyen et al., ACM SOSP 2013.

5. A quantitative study of irregular programs on GPUs. M. Burtscher et al., IEEE IISWC 2012.

6. The program structure tree: Computing control regions in linear time. R. Johnson et al., ACM PLDI 1994.

7. Data-centric multi-level blocking. I. Kodukula et al., ACM PLDI 1997.

8. Automated application-level checkpointing of MPI programs. G. Bronevetsky et al., ACM PPoPP 2003.

9. A comparison of empirical and model-driven optimization. K. Yotov et al., ACM PLDI 2003.

10. Lonestar: A suite of parallel irregular programs. M. Kulkarni et al., IEEE ISPASS 2009.