When possible, links to papers are provided through the ACM's "Author-izer" service, which grants free access to papers through the ACM Digital Library.

Conferences

Efficient Execution of Recursive Programs on Commodity Vector Hardware

  • Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal and Milind Kulkarni
  • Programming Languages Design and Implementation (PLDI)
  • June, 2015
  • Acceptance rate: 19%

Tree Dependence Analysis

  • Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu and Milind Kulkarni
  • Programming Languages Design and Implementation (PLDI)
  • June, 2015
  • Acceptance rate: 19%

Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability

  • Aritra Sengupta, Swarnendu Biswas, Minjia Zhang, Michael D. Bond and Milind Kulkarni
  • Architectural Support for Programming Languages and Operating Systems (ASPLOS)
  • March, 2015
  • Acceptance rate: 17%

Orion: Scaling Genomic Sequence Matching with Fine-Grained Parallelization

  • Kanak Mahadik, Somali Chaterji, Bowen Zhou, Milind Kulkarni and Saurabh Bagchi
  • The International Conference for High Performance Computing, Networking, Storage and Analysis (Supercomputing)
  • November, 2014
  • Acceptance rate: 21%

General transformations for GPU execution of tree traversals

  • Michael Goldfarb, Youngjoon Jo and Milind Kulkarni
  • The International Conference for High Performance Computing, Networking, Storage and Analysis (Supercomputing)
  • November, 2013
  • Acceptance rate: 20%

Octet: Capturing and Controlling Cross-Thread Dependences Efficiently

  • Michael D. Bond, Milind Kulkarni, Man Cao, Minjia Zhang, Meisam Fathi Salmi, Swarnendu Biswas, Aritra Sengupta and Jipeng Huang
  • Object-Oriented Programming, Systems, Languages & Applications (OOPSLA)
  • October, 2013
  • Acceptance rate: 25%

EventWave: Programming Model and Runtime Support for Tightly-Coupled Elastic Cloud Applications

  • Wei-Chiu Chuang, Bo Sang, Sunghwan Yoo, Rui Gu, Charles Killian and Milind Kulkarni
  • Symposium on Cloud Computing (SoCC)
  • October, 2013
  • Acceptance rate: 20%

Automatic Vectorization of Tree Traversals

  • Youngjoon Jo, Michael Goldfarb and Milind Kulkarni
  • Parallel Architectures and Compilation Techniques (PACT)
  • September, 2013
  • Acceptance rate: 17%

WuKong: Automatically Detecting and Localizing Bugs that Manifest at Large System Scales

  • Bowen Zhou, Jonathan Too, Milind Kulkarni and Saurabh Bagchi
  • Symposium on High Performance Parallel and Distributed Computing (HPDC)
  • June, 2013
  • Acceptance rate: 15%

Exploiting Domain Knowledge to Optimize Parallel Computational Mechanics Codes

  • Chenyang Liu, Hasan Jamal, Milind Kulkarni, Arun Prakash and Vijay Pai
  • International Conference on Supercomputing (ICS)
  • June, 2013
  • Acceptance rate: 21%

SemCache: Semantics-aware Caching for Efficient GPU Offloading

  • Nabeel AlSaber and Milind Kulkarni
  • International Conference on Supercomputing (ICS)
  • June, 2013
  • Acceptance rate: 21%

Automatically Enhancing Locality for Tree Traversals with Traversal Splicing

  • Youngjoon Jo and Milind Kulkarni
  • Object-Oriented Programming, Systems, Languages & Applications (OOPSLA)
  • October, 2012
  • Acceptance rate: 25%

Enhancing Locality for Recursive Traversals of Recursive Structures

  • Youngjoon Jo and Milind Kulkarni
  • Object-Oriented Programming, Systems, Languages & Applications (OOPSLA)
  • October, 2011
  • Acceptance rate: 37%

InContext: Simple Parallelism for Distributed Applications

  • Sungwhan Yoo, Hyojeong Lee, Charles Killian and Milind Kulkarni
  • Symposium on High Performance Parallel and Distributed Computing (HPDC)
  • June, 2011
  • Acceptance rate: 13%

Vrisha: Using Scaling Properties of Parallel Programs for Bug Detection and Localization

  • Bowen Zhou, Milind Kulkarni and Saurabh Bagchi
  • Symposium on High Performance Parallel and Distributed Computing (HPDC)
  • June, 2011
  • Acceptance rate: 13%

The Tao of Parallelism in Algorithms

  • Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Mendez-Lojo, Dimitrios Prountzos, Xin Sui
  • Programming Languages Design and Implementation (PLDI)
  • June, 2011
  • Acceptance rate: 23%

Exploiting the Commutativity Lattice

  • Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui and Keshav Pingali
  • Programming Languages Design and Implementation (PLDI)
  • June, 2011
  • Acceptance rate: 23%

Techniques for fine-grained, multi-site computation offloading

  • Kanad Sinha and Milind Kulkarni
  • International Symposium on Cluster, Cloud, and Grid Computing (CCGrid)
  • May, 2011
  • Acceptance rate: 29%

μSETL: A Set Based Programming Abstraction for Wireless Sensor Networks

  • Mohammad S. Hossain, A. B. M. Alim al Islam, Milind Kulkarni and Vijay Raghunathan
  • Information Processing in Sensor Networks (IPSN)
  • April, 2011
  • Acceptance rate: 21%

Accelerating Multicore Reuse Distance Analysis with Sampling and Parallelization

  • Derek Schuff, Milind Kulkarni and Vijay Pai
  • Parallel Architectures and Compilation Techniques (PACT)
  • September, 2010
  • Acceptance rate: 17%

Structure-driven Optimizations for Amorphous Data-Parallel Programs

  • Mario Mendez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassan, Milind Kulkarni, Martin Burtscher and Keshav Pingali
  • Principles and Practices of Parallel Programming (PPoPP)
  • January, 2010
  • Acceptance rate: 17%
  • Nominated for Best Paper

Lonestar: A Suite of Parallel Irregular Programs

  • Milind Kulkarni, Martin Burtscher, Keshav Pingali and Calin Cascaval
  • International Symposium on Performance Analysis of Systems and Software (ISPASS)
  • April, 2009
  • Acceptance rate: 29%

How Much Parallelism is There in Irregular Applications?

  • Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali and Calin Cascaval
  • Principles and Practices of Parallel Programming (PPoPP)
  • February, 2009
  • Acceptance rate: 24%

Fast Agglomerative Clustering for Rendering

  • Bruce Walter, Kavita Bala, Milind Kulkarni and Keshav Pingali
  • Interactive Ray-tracing Symposium (RT)
  • August, 2008
  • Acceptance rate: 52%

Scheduling Strategies for Optimistic Parallel Execution of Irregular Programs

  • Milind Kulkarni, Patrick Carribault Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala and L. Paul Chew
  • Symposium on Parallelism in Algorithms and Architectures (SPAA)
  • Acceptance rate: 28%
  • June, 2008

Optimistic Parallelism Benefits From Data Partitioning

  • Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala and L. Paul Chew
  • Architectural Support for Programming Languages and Operating Systems (ASPLOS)
  • March, 2008
  • Acceptance rate: 24%

Optimistic Parallelization Requires Abstractions

  • Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala and Paul Chew
  • Programming Languages Design and Implementation (PLDI)
  • June, 2007
  • Acceptance rate: 25%

Journals

An Experimental Study of Self-optimizing Dense Linear Algebra Software

  • Milind Kulkarni and Keshav Pingali
  • Proceedings of the IEEE, Volume 96, Issue 5. Special Issue on Cutting Edge Computing: Using New Commodity Architectures [Invited Paper]
  • March, 2008

Magazines

Debugging High-Performance Computing Applications at Massive Scales

  • Ignacio Laguna, Dong H. Ahn, Bronis R. de Supinski, Todd Gamblin, Gregory L. Lee, Martin Schulz, Saurabh Bagchi, Milind Kulkarni, Bowen Zhou, Zhezhe Chen and Feng Qin
  • Communications of the ACM (CACM)
  • Accepted for publication

Optimistic Parallelism Requires Abstractions

  • Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala and Paul Chew
  • Research Highlights, Communications of the ACM (CACM)
  • September, 2009

Workshops

Programming Model Support for Dependable, Elastic Cloud Applications

  • Wei-Chiu Chuang, Bo Sang, Charles Killian and Milind Kulkarni
  • 8th Workshop on Hot Topics in System Dependability (HotDep)
  • October, 2012
  • Acceptance rate: 42%

Abhranta: Localizing Bugs that Manifest at Large System Scales

  • Bowen Zhou, Milind Kulkarni and Saurabh Bagchi
  • 8th Workshop on Hot Topics in System Dependability (HotDep)
  • October, 2012
  • Acceptance rate: 42%
  • Partly superseded by HPDC 2013

Towards Architecture Independent Metrics for Multicore Performance Analysis

  • Milind Kulkarni, Vijay Pai and Derek Schuff
  • Third Workshop on Hot Topics in Measurement & Modeling of Computer Systems (HotMetrics)
  • June, 2010
  • Acceptance rate: 37%
  • Also appeared in ACM SIGMETRICS Performance Evaluation Review, 38(3):10–14

On the Scalability of an Automatically Parallelized Irregular Application

  • Martin Burtscher, Milind Kulkarni, Dimitrios Prountzos and Keshav Pingali
  • 21st Annual Workshop on Languages and Compilers for Parallel Computing (LCPC)
  • July-August, 2008
  • Acceptance rate: 51%

Using Transactions in Delaunay Mesh Generation

  • Milind Kulkarni, Keshav Pingali and L. Paul Chew
  • Workshop on Transactional Memory Workloads (WTW)
  • June, 2006

Posters, Brief announcements, etc.

Poster: SemCache++: Semantics-Aware Caching for Efficient Multi-GPU Offloading

  • Nabeel AlSaber and Milind Kulkarni
  • Principles and Practices of Parallel Programming (PPoPP)
  • February, 2015

Poster: WuKong: Locating Bugs that Manifest at Large System Scales

  • Bowen Zhou, Milind Kulkarni and Saurabh Bagchi
  • Principles and Practices of Parallel Programming (PPoPP)
  • February, 2013
  • Superseded by HPDC 2013

Brief Announcement: Locality-enhancing Transformations for Tree Traversal Algorithms

  • Youngjoon Jo and Milind Kulkarni
  • Symposium on Parallelism in Algorithms and Architectures (SPAA)
  • June, 2011
  • Superseded by OOPSLA 2011

Brief Announcement: Locality-aware Load Balancing for Speculatively-parallelized Irregular Applications

  • Youngjoon Jo and Milind Kulkarni
  • Symposium on Parallelism in Algorithms and Architectures (SPAA)
  • June, 2010

Scheduling Issues in Optimistic Parallelization

  • Milind Kulkarni and Keshav Pingali
  • NSF Next Generation Software (NGS) Workshop
  • March, 2007

Tech Reports

Tracking Conflicting Accesses Efficiently for Record and Replay

  • Michael D. Bond and Milind Kulkarni
  • Ohio State University, Department of Computer Science and Engineering
  • Report# OSU-CISRC-2/12-TR01
  • February, 2012

Automatically Enhancing Locality for Tree Traversals with Traversal Splicing

  • Youngjoon Jo and Milind Kulkarni
  • Purdue University, School of Electrical and Computer Engineering
  • Report# TR-ECE-12-03
  • February, 2012
  • Partly superseded by OOPSLA 2012

Locality-enhancing loop transformations for parallel tree traversal algorithms

  • Youngjoon Jo and Milind Kulkarni
  • Purdue University, School of Electrical and Computer Engineering
  • Report# TR-ECE-11-03
  • February, 2011
  • Partly superseded by OOPSLA 2011

Defining and Implementing Commutativity Conditions for Parallel Execution

  • Milind Kulkarni, Dimitrios Prountzos, Donald Nguyen and Keshav Pingali
  • Purdue University, School of Electrical and Computer Engineering
  • Report# TR-ECE-09-11
  • August, 2009
  • Partly superseded by PLDI 2011(a)

Amorphous Data-parallelism in Irregular Algorithms

  • Keshav Pingali, Milind Kulkarni, Donald Nguyen, Martin Burtscher, Mario Mendez-Lojo, Dimitrios Prountzos, Xin Sui and Zifei Zhong
  • The University of Texas at Austin, Department of Computer Sciences
  • Report# TR-09-05
  • February, 2009
  • Partly superseded by PLDI 2011(b)

Miscellaneous

Programming Model and Software for Exploiting Parallelism in Irregular Programs

  • Keshav Pingali and Milind Kulkarni
  • U.S. Patent, #8,863,104
  • Issued October, 2014

The Galois System: Optimistic Parallelization of Irregular Applications

  • Milind Kulkarni
  • Ph.D. Dissertation, Department of Computer Science, Cornell University
  • August, 2008