BibSLEIGH — Milind

Travelled to:

1 × China
1 × India
1 × Turkey
11 × USA

Collaborated with:

Y.Jo K.Pingali B.Zhou S.Bagchi N.AlSaber D.Nguyen D.Prountzos X.Sui M.Burtscher G.Ramanarayanan B.Walter K.Bala L.P.Chew A.Sengupta S.Biswas M.Zhang M.D.Bond Y.Weijiang S.Balakrishna J.Liu J.Too S.Yoo H.Lee C.E.Killian M.A.Hassaan M.Méndez-Lojo B.Ren S.Krishnamoorthy K.Agrawal R.Inkulu C.Cascaval M.Cao M.F.Salmi J.Huang R.Kaleem T.Lee A.Lenharth R.Manevich

Talks about:

parallel (7) local (4) travers (3) program (3) recurs (3) effici (3) scale (3) bug (3) structur (2) optimist (2)

Person: Milind Kulkarni

DBLP: Kulkarni:Milind

Contributed to:

2015

2013

2012

2011

2010

2009

2008

2007

Wrote 17 papers:

ASPLOS-2015-SenguptaBZBK #bound #dynamic analysis #hybrid: Hybrid Static: Dynamic Analysis for Statically Bounded Region Serializability (AS, SB, MZ, MDB, MK), pp. 561–575.
PLDI-2015-RenJKAK #execution #hardware #performance #recursion #source code: Efficient execution of recursive programs on commodity vector hardware (BR, YJ, SK, KA, MK), pp. 509–520.
PLDI-2015-WeijiangBLK #analysis #dependence: Tree dependence analysis (YW, SB, JL, MK), pp. 314–325.
PPoPP-2015-AlSaberK #multi #performance #semantics: SemCache++: semantics-aware caching for efficient multi-GPU offloading (NA, MK), pp. 255–256.
HPDC-2013-ZhouTKB #automation #debugging #detection #named #scalability: WuKong: automatically detecting and localizing bugs that manifest at large system scales (BZ, JT, MK, SB), pp. 131–142.
OOPSLA-2013-BondKCZSBSH #dependence #named #thread: OCTET: capturing and controlling cross-thread dependences efficiently (MDB, MK, MC, MZ, MFS, SB, AS, JH), pp. 693–712.
PPoPP-2013-ZhouKB #debugging #effectiveness #named #scalability: WuKong: effective diagnosis of bugs at large system scales (BZ, MK, SB), pp. 317–318.
OOPSLA-2012-JoK #automation #locality #traversal: Automatically enhancing locality for tree traversals with traversal splicing (YJ, MK), pp. 355–374.
HPDC-2011-YooLKK #distributed #named #parallel: InContext: simple parallelism for distributed applications (SY, HL, CEK, MK), pp. 97–108.
HPDC-2011-ZhouKB #debugging #detection #locality #named #parallel #scalability #source code #using: Vrisha: using scaling properties of parallel programs for bug detection and localization (BZ, MK, SB), pp. 85–96.
OOPSLA-2011-JoK #locality #recursion #traversal: Enhancing locality for recursive traversals of recursive structures (YJ, MK), pp. 463–482.
PLDI-2011-KulkarniNPSP #commutative: Exploiting the commutativity lattice (MK, DN, DP, XS, KP), pp. 542–555.
PLDI-2011-PingaliNKBHKLLMMPS #algorithm #parallel: The tao of parallelism in algorithms (KP, DN, MK, MB, MAH, RK, THL, AL, RM, MML, DP, XS), pp. 12–25.
PPoPP-2010-Mendez-LojoNPSHKBP #optimisation #source code: Structure-driven optimizations for amorphous data-parallel programs (MML, DN, DP, XS, MAH, MK, MB, KP), pp. 3–14.
PPoPP-2009-KulkarniBIPC #how #parallel #question: How much parallelism is there in irregular applications? (MK, MB, RI, KP, CC), pp. 3–14.
ASPLOS-2008-KulkarniPRWBC #clustering #parallel: Optimistic parallelism benefits from data partitioning (MK, KP, GR, BW, KB, LPC), pp. 233–243.
PLDI-2007-KulkarniPWRBC #abstraction #parallel: Optimistic parallelism requires abstractions (MK, KP, BW, GR, KB, LPC), pp. 211–222.