Harshavardhan Simhadri

Contact
harshas@cs.cmu.edu
GHC 9003
412-268-4751 (O)
412-999-4940 (M)

My research interests are in the areas of Parallel and I/O-efficient
algorithms for large data sets, and theoretical and practical aspects of
Parallel Computing with an emphasis on scheduling for locality.

Working Drafts

• Experimental Analysis of Space-Bounded Schedulers
  (with Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons and Aapo Kyrola)
  

Position Papers

• Cost Models for Locality in Parallel Programs
  (with Guy E. Blelloch, Jeremy T. Fineman and Phillip B. Gibbons)
  

Publications (DBLP)

• Brief announcement: the problem based benchmark suite
  ACM SPAA '12 (with Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, and Kanat Tangwongsan)
  
• Parallel and I/O efficient set covering algorithms
  ACM SPAA '12 (with Guy E. Blelloch and Kanat Tangwongsan)
  
• Scheduling Irregular Parallel Computations on Hierarchical Caches
  ACM SPAA '11 (with Guy E. Blelloch, Jeremy T. Fineman and Phillip B. Gibbons)
  Tech Report: CMU-CS-10-154 (pdf)
  
• Low Depth Cache Oblivious Algorithms
  Tech Report: CMU-CS-09-134 (with Guy E. Blelloch and Phillip B. Gibbons)
  ACM SPAA '10
• Combinable Memory-Block Transactions
  ACM SPAA '08 (with Guy E. Blelloch and Phillip B. Gibbons)
  
• Towards optimal and efficient perfectly secure message transmission
  Theory of Cryptography Conference 2007 (with Mattias Fitzi, Mathew Franklin and Juan Garay)

Teaching Assistant

• 15-750: Graduate Algorithms (Spring 2011)
• 15-499: Parallel Algorithms (Spring 2009)

Earlier
2003-2007, Undergrad at IIT Madras, Major: CS, Minor: Physics.