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

RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search

  • Vani Nagarajan, Durga Mandarpu and Milind Kulkarni
  • International Conference on Supercomputing (ICS) 2023
  • June, 2023
  • Acceptance rate: 29%

RT-DBSCAN: Accelerating DBSCAN using Ray Tracing Hardware

  • Vani Nagarajan and Milind Kulkarni
  • International Parallel and Distributed Processing Symposium (IPDPS)
  • May, 2023
  • Acceptance rate: 26%

Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification

  • Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni and Roopsha Samanta
  • Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
  • April, 2023
  • Acceptance rate: 38%
  • Nominated for Best Paper

Coyote: A Compiler for Vectorizing Encrypted Arithmetic Circuits

  • Raghav Malik, Kabir Sheth and Milind Kulkarni
  • Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2023.
  • March, 2023
  • Acceptance rate: 21%

HyBF: A Hybrid Branch Fusion Strategy for Code Size Reduction

  • Rodrigo C. O. Rocha, Charitha Saumya, Kirshanthan Sundararajah, Pavlos Petoumenos, Milind Kulkarni and Michael O’Boyle
  • International Conference on Compiler Construction (CC)
  • February, 2022
  • Acceptance rate: 40%

Unirec: A Unimodular-like Framework for Nested Recursion and Loops

  • Kirshanthan Sundararajah, Charitha Saumya and Milind Kulkarni
  • Object-Oriented Programming Systems, Languages and Applications (OOPSLA) 2022
  • December, 2022
  • Acceptance rate: 31%

Cornucopia: A Framework for Feedback-Guided Generation of Binaries

  • Vidush Singhal, Akul Abhilash Pillai, Charitha Saumya, Milind Kulkarni and Aravind Machiry
  • International Conference on Automated Software Engineering (ASE)
  • October, 2022
  • Acceptance rate: 22%

SparseLNR: accelerating sparse tensor computations using loop nest restructuring

  • Adhitha Dias, Kirshanthan Sundararajah, Charitha Saumya and Milind Kulkarni
  • International Conference on Supercomputing (ICS)
  • June, 2022
  • Acceptance rate: 24%
  • Best Paper Award

DARM: Control-Flow Melding for SIMT Thread Divergence Reduction

  • Charitha Saumya, Kirshanthan Sundararajah and Milind Kulkarni
  • Code Generation and Optimization (CGO)
  • April, 2022
  • Acceptance rate: 27%

QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based Systems

  • Nouraldin Jaber, Christopher Wagner, Swen Jacobs, Milind Kulkarni and Roopsha Samanta
  • Object-Oriented Programming, Systems, Languages & Applications (OOPSLA)
  • October, 2021
  • Acceptance rate: 35%

HACCLE: Metaprogramming for Secure Multi-Party Computation

  • Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf and Milind Kulkarni
  • International Conference on Generative Programming: Concepts and Experiences (GPCE)
  • October, 2021
  • Acceptance rate: 50%

Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations

  • Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni and Ryan R. Newton
  • International Conference on Functional Programming (ICFP)
  • August, 2021
  • Acceptance rate: 33%

Vectorized Secure Evaluation of Decision Forests

  • Raghav Malik, Vidush Singhal, Benjamin Gottfried and Milind Kulkarni
  • Programming Languages Design and Implementation (PLDI)
  • June, 2021
  • Acceptance rate: 23%

Parameterized Verification of Systems with Global Synchronization and Guards

  • Nouraldin Jaber, Swen Jacobs, Christopher Wagner, Milind Kulkarni and Roopsha Samanta
  • International Conference on Computer-Aided Verification (CAV)
  • July, 2020
  • Acceptance rate: 27%

D2P: From Recursive Formulations to Distributed Memory Codes

  • Nikhil Hegde, Qifan Chang and Milind Kulkarni
  • The International Conference for High Performance Computing Networking, Storage, and Analysis (Supercomputing)
  • November, 2019
  • Acceptance rate: 23%

Efficient GPU Tree Walks for Effective Distributed N-Body Simulations

  • Jianqiao Liu, Michael Robson, Thomas Quinn and Milind Kulkarni
  • International Conference on Supercomputing (ICS)
  • June, 2019
  • Acceptance rate: 23%

Composable, Sound Transformations of Nested Recursion and Loops

  • Kirshanthan Sundararajah and Milind Kulkarni
  • Programming Languages Design and Implementation (PLDI)
  • June, 2019
  • Acceptance rate: 27%

Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees

  • Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton and Milind Kulkarni
  • Programming Languages Design and Implementation (PLDI)
  • June, 2019
  • Acceptance rate: 27%

LoCal: A Language for Programs Operating on Serialized Data

  • Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni and Ryan R. Newton
  • Programming Languages Design and Implementation (PLDI)
  • June, 2019
  • Acceptance rate: 27%

MULKSG: MULtiple K Simultaneous Graph Assembly

  • Christopher Wright, Sriram Krishnamoorthy and Milind Kulkarni
  • Algorithms in Computational Biology (AlCoB)
  • May, 2019
  • Acceptance rate: 52%

XSTRESSOR: Automatic Generation of Large-Scale Test Inputs by Inferring Path Conditions

  • Charitha Saumya, Jinkyu Koo, Saurabh Bagchi and Milind Kulkarni
  • International Conference on Software Testing, Verification and Validation (ICST)
  • April, 2019
  • Acceptance rate: 28%
  • IEEE TCSE Distinguished Paper Award

PySE: Automatic Worst-Case Test Generation by Reinforcement Learning

  • Jinkyu Koo, Charitha Saumya, Saurabh Bagchi and Milind Kulkarni
  • International Conference on Software Testing, Verification and Validation (ICST)
  • April, 2019
  • Acceptance rate: 28%

TreeFuser: A Framework for Analyzing and Fusing General Recursive Tree Traversals

  • Laith Sakka, Kirshanthan Sundararajah and Milind Kulkarni
  • Object-Oriented Programming, Systems, Languages & Applications (OOPSLA)
  • October, 2017
  • Acceptance rate: 30%

Scalable Genomic Assembly through Parallel de Bruijn Graph Construction for Multiple K-mers

  • Kanak Mahadik, Christopher Wright, Milind Kulkarni, Saurabh Bagchi and Somali Chaterji
  • Bioinformatics, Computational Biology, and Health Informatics (BCB)
  • August, 2017

Compiling Tree Transforms to Operate on Packed Representations

  • Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, and Ryan Newton
  • European Conference on Object Oriented Programming (ECOOP)
  • June, 2017
  • Acceptance rate: 33%

SPIRIT: A Framework for Creating Distributed Recursive Tree Applications

  • Nikhil Hegde, Jianqiao Liu, and Milind Kulkarni
  • International Conference on Supercomputing (ICS)
  • June, 2017
  • Acceptance rate: 16%

Treelogy: A Benchmark Suite for Tree Traversals

  • Nikhil Hegde, Jianqiao Liu, Kirshanthan Sundararajah and Milind Kulkarni
  • International Symposium on Performance Analysis of Systems and Software (ISPASS)
  • April, 2017
  • Acceptance rate: 30%

Locality Transformations for Nested Recursive Iteration Spaces

  • Kirshanthan Sundararajah, Laith Sakka and Milind Kulkarni
  • Architectural Support for Programming Languages and Operating Systems (ASPLOS)
  • April, 2017
  • Acceptance rate: 17%

Data Structure–Aware Heap Partitioning

  • Nouraldin Jaber and Milind Kulkarni
  • Compiler Construction (CC)
  • February, 2017
  • Acceptance rate: 25%

Exploiting Vector and Multicore Parallelism for Recursive Data- and Task-Parallel Programs

  • Bin Ren, Sriram Krishnamoorthy, Kunal Agrawal and Milind Kulkarni
  • Principles and Practice of Parallel Programming (PPoPP)
  • February, 2017
  • Acceptance rate: 22%

Processor-Oblivious Record and Replay

Legato: End-to-End Bounded Region Serializability Using Commodity Hardware Transactional Memory

  • Aritra Sengupta, Man Cao, Michael Bond and Milind Kulkarni
  • International Symposium on Code Generation and Optimization (CGO)
  • February, 2017
  • Acceptance rate: 22%

SARVAVID: A Domain Specific Language for Developing Scalable Computational Genomics Applications

  • Kanak Mahadik, Chris Wright, Jinyi Zhang, Milind Kulkarni, Saurabh Bagchi and Somali Chaterji
  • International Conference on Supercomputing (ICS)
  • June, 2016
  • Acceptance rate: 24%

Hybrid CPU-GPU Scheduling and Execution of Tree Traversals

  • Jianqiao Liu, Nikhil Hegde and Milind Kulkarni
  • International Conference on Supercomputing (ICS)
  • June, 2016
  • Acceptance rate: 24%

Toward Efficient Strong Memory Model Support for the Java Platform via Hybrid Synchronization

  • Aritra Sengupta, Man Cao, Michael Bond and Milind Kulkarni
  • Principles and Practice of Programming in Java (PPPJ)
  • September, 2015
  • Acceptance rate: 56%

Efficient Deterministic Replay of Multithreaded Executions in a Managed Language Virtual Machine

  • Michael Bond, Milind Kulkarni, Man Cao, Meisam Fathi Salmi and Jipeng Huang
  • Principles and Practice of Programming in Java (PPPJ)
  • September, 2015
  • Acceptance rate: 56%

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

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

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

Challenges in Firmware Re-Hosting, Emulation, and Analysis

  • Christopher Wright, William A. Moeglein, Saurabh Bagchi, Milind Kulkarni and Abraham Clements
  • ACM Computing Surveys
  • January, 2021

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

  • Bin Ren, Shruthi Balakrishna, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal and Milind Kulkarni
  • ACM Transactions on Parallel Computing
  • June, 2019

Processor-Oblivious Record and Replay

  • Robert Utterback, Kunal Agrawal, I-Ting Angelina Lee and Milind Kulkarni
  • ACM Transactions on Parallel Computing
  • June, 2019

A-RESCUE 2.0. A High Fidelity, Parallel, Agent-based Evacuation Simulator

  • Hemant Gehlot, Xianyuan Zhan, Xinwu Qian, Christopher Thompson, Milind Kulkarni and Satish Ukkusuri
  • Journal of Computing in Civil Engineering (JCCE)
  • March, 2019

Exploiting Semantics of Temporal Multi-scale Methods to Optimize Multi-level Mesh Partitioning

  • M. Hasan Jamal, Arun Prakash and Milind Kulkarni
  • International Journal for Numerical Methods in Engineering (IJNME)
  • September, 2017

An Experimental Study of Self-optimizing Dense Linear Algebra Software [Invited Paper]

  • Milind Kulkarni and Keshav Pingali
  • Proceedings of the IEEE
  • 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)
  • September, 2015

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

Evaluating Performance of Task and Data Coarsening in Concurrent Collections

  • Chenyang Liu and Milind Kulkarni
  • 29th International Workshop on Languages and Compilers for Parallel Computing (LCPC)
  • September, 2016

Locality-aware Task-parallel Execution on GPUs

  • Jad Hbeika and Milind Kulkarni
  • 29th International Workshop on Languages and Compilers for Parallel Computing (LCPC)
  • September, 2016

Optimizing the LULESH Stencil Code using Concurrent Collections

  • Chenyang Liu and Milind Kulkarni
  • 5th International Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance Computing (WOLF-HPC)
  • November, 2015

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.

Position Paper: Programming Language Support for Analyzing Non-Persistent Data

  • Yung-Hsiang Lu, Milind Kulkarni, and Xiaojin Zhu
  • IEEE Symposium on Technologies for Homeland Security
  • May, 2016

Position Paper: Beyond Big Data-Rethinking Programming Languages for Non-Persistent Data

  • Milind Kulkarni and Yung-Hsiang Lu
  • International Conference on Cloud Computing and Big Data (CCBD)
  • November, 2015

Poster: Exploiting Domain Knowledge to Optimize Mesh Partitioning for Multi-Scale Methods

  • M. Hasan Jamal, Arun Prakash and Milind Kulkarni
  • International Conference for High Performance Computing, Networking, Storage and Analysis (Supercomputing)
  • November, 2015

Poster: MANGO: scalable modularity for transparently elastic cloud applications

  • Wei-Chiu Chuang, Charles Killian and Milind Kulkarni
  • Networked Systems Design and Implementation (NSDI)
  • May, 2015

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

  • Nabeel AlSaber and Milind Kulkarni
  • Principles and Practices of Parallel Programming (PPoPP)
  • February, 2015
  • Superseded by ICS 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