 | 2011 |
| 22 |  | Kanad Sinha,
Milind Kulkarni:
Techniques for Fine-Grained, Multi-site Computation Offloading.
CCGRID 2011: 184-194 |
| 21 |  | Bowen Zhou,
Milind Kulkarni,
Saurabh Bagchi:
Vrisha: using scaling properties of parallel programs for bug detection and localization.
HPDC 2011: 85-96 |
| 20 |  | Sunghwan Yoo,
Hyojeong Lee,
Charles Edwin Killian,
Milind Kulkarni:
InContext: simple parallelism for distributed applications.
HPDC 2011: 97-108 |
| 19 |  | Mohammad Sajjad Hossain,
A. B. M. Alim Al Islam,
Milind Kulkarni,
Vijay Raghunathan:
μSETL: A set based programming abstraction for wireless sensor networks.
IPSN 2011: 354-365 |
| 18 |  | Youngjoon Jo,
Milind Kulkarni:
Enhancing locality for recursive traversals of recursive structures.
OOPSLA 2011: 463-482 |
| 17 |  | Keshav Pingali,
Donald Nguyen,
Milind Kulkarni,
Martin Burtscher,
Muhammad Amber Hassaan,
Rashid Kaleem,
Tsung-Hsien Lee,
Andrew Lenharth,
Roman Manevich,
Mario Méndez-Lojo,
Dimitrios Prountzos,
Xin Sui:
The tao of parallelism in algorithms.
PLDI 2011: 12-25 |
| 16 |  | Milind Kulkarni,
Donald Nguyen,
Dimitrios Prountzos,
Xin Sui,
Keshav Pingali:
Exploiting the commutativity lattice.
PLDI 2011: 542-555 |
| 15 |  | Youngjoon Jo,
Milind Kulkarni:
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms.
SPAA 2011: 263-264 |
| 2010 |
| 14 |  | Derek L. Schuff,
Milind Kulkarni,
Vijay S. Pai:
Accelerating multicore reuse distance analysis with sampling and parallelization.
PACT 2010: 53-64 |
| 13 |  | Mario Méndez-Lojo,
Donald Nguyen,
Dimitrios Prountzos,
Xin Sui,
Muhammad Amber Hassaan,
Milind Kulkarni,
Martin Burtscher,
Keshav Pingali:
Structure-driven optimizations for amorphous data-parallel programs.
PPOPP 2010: 3-14 |
| 12 |  | Youngjoon Jo,
Milind Kulkarni:
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications.
SPAA 2010: 183-185 |
| 11 |  | Milind Kulkarni,
Vijay S. Pai,
Derek L. Schuff:
Towards architecture independent metrics for multicore performance analysis.
SIGMETRICS Performance Evaluation Review 38(3): 10-14 (2010) |
| 2009 |
| 10 |  | Milind Kulkarni,
Martin Burtscher,
Calin Cascaval,
Keshav Pingali:
Lonestar: A suite of parallel irregular programs.
ISPASS 2009: 65-76 |
| 9 |  | Milind Kulkarni,
Martin Burtscher,
Rajasekhar Inkulu,
Keshav Pingali,
Calin Cascaval:
How much parallelism is there in irregular applications?
PPOPP 2009: 3-14 |
| 8 |  | Milind Kulkarni,
Keshav Pingali,
Bruce Walter,
Ganesh Ramanarayanan,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism requires abstractions.
Commun. ACM 52(9): 89-97 (2009) |
| 2008 |
| 7 |  | Milind Kulkarni,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism benefits from data partitioning.
ASPLOS 2008: 233-243 |
| 6 |  | Gandhali Kulkarni,
Milind Kulkarni,
Manikrao Dhore:
Fractal Image Compression Performance Analysis with Various Partitioning Methods of Square and Spiral Architecture.
IPCV 2008: 86-91 |
| 5 |  | Martin Burtscher,
Milind Kulkarni,
Dimitrios Prountzos,
Keshav Pingali:
On the Scalability of an Automatically Parallelized Irregular Application.
LCPC 2008: 109-123 |
| 4 |  | Milind Kulkarni,
Patrick Carribault,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Scheduling strategies for optimistic parallel execution of irregular programs.
SPAA 2008: 217-228 |
| 2007 |
| 3 |  | Milind Kulkarni,
Keshav Pingali:
Scheduling Issues in Optimistic Parallelization.
IPDPS 2007: 1-7 |
| 2 |  | Milind Kulkarni,
Keshav Pingali,
Bruce Walter,
Ganesh Ramanarayanan,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism requires abstractions.
PLDI 2007: 211-222 |
| 2005 |
| 1 |  | Milind Kulkarni,
J. Benita Bommi:
Assertion-Based Verification for the SpaceCAKE Multiprocessor - A Case Study.
Haifa Verification Conference 2005: 43-55 |