The SCEAS System
Navigation Menu

Search the dblp DataBase


Milind Kulkarni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Milind Kulkarni, J. Benita Bommi
    Assertion-Based Verification for the SpaceCAKE Multiprocessor - A Case Study. [Citation Graph (0, 0)][DBLP]
    Haifa Verification Conference, 2005, pp:43-55 [Conf]
  2. Milind Kulkarni, Keshav Pingali
    Scheduling Issues in Optimistic Parallelization. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-7 [Conf]
  3. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
    Optimistic parallelism requires abstractions. [Citation Graph (0, 0)][DBLP]
    PLDI, 2007, pp:211-222 [Conf]

  4. Optimistic parallelism benefits from data partitioning. [Citation Graph (, )][DBLP]

  5. Lonestar: A suite of parallel irregular programs. [Citation Graph (, )][DBLP]

  6. On the Scalability of an Automatically Parallelized Irregular Application. [Citation Graph (, )][DBLP]

  7. How much parallelism is there in irregular applications? [Citation Graph (, )][DBLP]

  8. Structure-driven optimizations for amorphous data-parallel programs. [Citation Graph (, )][DBLP]

  9. Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications. [Citation Graph (, )][DBLP]

  10. Scheduling strategies for optimistic parallel execution of irregular programs. [Citation Graph (, )][DBLP]

  11. Fractal Image Compression Performance Analysis with Various Partitioning Methods of Square and Spiral Architecture. [Citation Graph (, )][DBLP]

  12. Optimistic parallelism requires abstractions. [Citation Graph (, )][DBLP]

Search in 0.077secs, Finished in 0.077secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002