BibSLEIGH — Vivek

Travelled to:

1 × Austria
1 × Czech Republic
1 × Estonia
1 × Italy
1 × Portugal
18 × USA
2 × Germany
2 × India
2 × Sweden
2 × United Kingdom
3 × Canada
3 × China
3 × France

Collaborated with:

∅ R.Barik J.Zhao K.Knobe Z.Budimlic R.Surendran S.M.Imam J.L.Hennessy J.Choi V.A.Saraswat R.Raman J.Shirako S.Chaudhuri S.Chandra R.Bodík D.Grove S.Imam I.Pechtchanski J.Harris R.Thekkath R.Cytron J.Ferrante M.G.Burke C.v.Praun M.T.Vechev E.Yahav R.Lublinerman J.Torrellas B.Gropp J.H.Moreno K.Olukotun M.Joyner M.G.Nanda J.Maessen R.Gupta S.J.Fink E.Schonberg K.Gharachorloo A.Hayashi E.M.Westbrook Y.Guo Y.Zhao V.Cavé S.Agarwal R.K.Shyamasundar M.Hind E.G.Mercer P.Anderson N.Vrvilo D.Majeti K.S.Meel J.M.Mellor-Crummey A.S.Sbîrlea Y.Zou J.Cong Y.Zhang V.C.Sreedhar W.Zhu G.R.Gao T.Zhou M.R.Jantz P.A.Kulkarni K.A.Doshi K.Lee A.Loginov R.O'Callahan M.Sridharan W.C.Hsieh D.Shields T.Cogumbreiro F.Martins Vasco T. Vasconcelos Max Grossman K.Sharma N.Fauzia L.Pouchet J.Ramanujam P.Sadayappan W.Lee R.Barua M.Frank D.Srikrishna J.Babb S.P.Amarasinghe O.Zinenko S.Verdoolaege C.Reddy T.Grosser A.C.0001 P.Charles C.Grothoff C.Donawa A.Kielstra K.Ebcioglu

Talks about:

parallel (23) program (15) analysi (8) array (7) model (6) task (6) optim (5) structur (4) schedul (4) automat (4)

Person: Vivek Sarkar

DBLP: Sarkar:Vivek

Facilitated 5 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1998

1996

1992

1990

1989

1988

1986

2015

2016

2017

2018

2019

2016

2017

Wrote 52 papers:

ECOOP-2015-ImamS #parallel #programming: The Eureka Programming Model for Speculative Task Parallelism (SI, VS), pp. 421–444.
CC-2014-SurendranBZS #array #using: Inter-iteration Scalar Replacement Using Array SSA Form (RS, RB, JZ, VS), pp. 40–60.
ECOOP-2014-ImamS #parallel #scheduling: Cooperative Scheduling of Parallel Tasks with General Synchronization Patterns (SMI, VS), pp. 618–643.
PLDI-2014-SurendranRCMS #parallel #source code #testing: Test-driven repair of data races in structured parallel programs (RS, RR, SC, JMMC, VS), p. 3.
OOPSLA-2013-ZhaoLBCS #parallel: Isolation for nested task parallelism (JZ, RL, ZB, SC, VS), pp. 571–588.
CC-2012-ShirakoSFPRSS #bound: Analytical Bounds for Optimal Tile Size Selection (JS, KS, NF, LNP, JR, PS, VS), pp. 101–121.
ECOOP-2012-WestbrookZBS #parallel: Practical Permissions for Race-Free Parallelism (EMW, JZ, ZB, VS), pp. 614–639.
LCTES-2012-SbirleaZBCS #data flow #platform #programming: Mapping a data-flow programming model onto heterogeneous platforms (ASS, YZ, ZB, JC, VS), pp. 61–70.
OOPSLA-2012-ImamS #parallel: Integrating task parallelism with actors (SMI, VS), pp. 753–772.
PLDI-2012-RamanZSVY #concurrent #detection #parallel #precise #scalability: Scalable and precise dynamic datarace detection for structured parallelism (RR, JZ, VS, MTV, EY), pp. 531–542.
CC-2011-JoynerBS #analysis #array #bound: Subregion Analysis and Bounds Check Elimination for High Level Arrays (MJ, ZB, VS), pp. 246–265.
OOPSLA-2011-LublinermanZBCS: Delegated isolation (RL, JZ, ZB, SC, VS), pp. 885–902.
HPCA-2010-TorrellasGSMO #challenge: Extreme scale computing: Challenges and opportunities (JT, BG, VS, JHM, KO), p. 1.
PPoPP-2010-GuoZCS #adaptation #manycore #named #scalability: SLAW: a scalable locality-aware adaptive work-stealing scheduler for multi-core systems (YG, YZ, VC, VS), pp. 341–342.
PPoPP-2010-TorrellasGMOS #challenge: Extreme scale computing: challenges and opportunities (JT, BG, JHM, KO, VS), pp. 101–102.
SAS-2010-VechevYRS #automation #parallel #source code #verification: Automatic Verification of Determinism for Structured Parallel Programs (MTV, EY, RR, VS), pp. 455–471.
CC-2009-Sarkar #challenge #optimisation #parallel #source code: Challenges in Code Optimization of Parallel Programs (VS), p. 1.
CGO-2008-Sarkar #optimisation #parallel #source code: Code optimization of parallel programs: evolutionary vs. revolutionary approaches (VS), p. 1.
PPoPP-2008-ChandraSSB #analysis #data type #distributed #locality #type inference: Type inference for locality analysis of distributed data structures (SC, VAS, VS, RB), pp. 11–22.
CC-2007-SarkarB #linear: Extended Linear Scan: An Alternate Foundation for Global Register Allocation (VS, RB), pp. 141–155.
PPoPP-2007-AgarwalBSS #analysis #source code: May-happen-in-parallel analysis of X10 programs (SA, RB, VS, RKS), pp. 183–193.
PPoPP-2007-SaraswatSP #architecture #concurrent #named #programming: X10: concurrent programming for modern architectures (VAS, VS, CvP), p. 271.
PPoPP-2007-ZhangSZSG #concurrent: Optimized lock assignment and allocation: a method for exploiting concurrency among critical sections (YZ, VCS, WZ, VS, GRG), pp. 146–147.
CC-2006-BarikS: Enhanced Bitwidth-Aware Register Allocation (RB, VS), pp. 263–276.
OOPSLA-2005-CharlesGSDKEPS #approach #clustering #named #object-oriented: X10: an object-oriented approach to non-uniform cluster computing (PC, CG, VAS, CD, AK, KE, CvP, VS), pp. 519–538.
OOPSLA-2004-NandaCS #execution #web #web service: Decentralizing execution of composite web services (MGN, SC, VS), pp. 170–187.
PLDI-2002-ChoiLLOSS #concurrent #detection #object-oriented #parallel #performance #precise #source code #thread: Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs (JDC, KL, AL, RO, VS, MS), pp. 258–269.
OOPSLA-2001-PechtchanskiS #analysis #framework #interprocedural: Dynamic Optimistic Interprocedural Analysis: A Framework and an Application (IP, VS), pp. 195–210.
PASTE-2001-MaessenSG #java #program analysis #safety #virtual machine: Program analysis for safety guarantees in a Java virtual machine written in Java (JWM, VS, DG), pp. 62–65.
PLDI-2000-BodikGS #array #bound #named: ABCD: eliminating array bounds checks on demand (RB, RG, VS), pp. 321–333.
SAS-2000-FinkKS #analysis #array: Unified Analysis of Array and Object References in Strongly Typed Languages (SJF, KK, VS), pp. 155–174.
PASTE-1999-ChoiGHS #analysis #exception #java #modelling #performance #precise #source code: Efficient and Precise Modeling of Exceptions for the Analysis of Java Programs (JDC, DG, MH, VS), pp. 21–31.
ASPLOS-1998-LeeBFSBSA #parallel #scheduling: Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine (WL, RB, MF, DS, JB, VS, SPA), pp. 46–57.
OOPSLA-1998-HarrisS #distributed #internet #lightweight #object-oriented: Lightweight Object-Oriented Shared Variables for Distributed Applications on the Internet (JH, VS), pp. 296–309.
POPL-1998-KnobeS #array #parallel: Array SSA Form and Its Use in Parallelization (KK, VS), pp. 107–120.
SAS-1998-SarkarK #array #constant: Enabling Sparse Constant Propagation of Array Elements via Array SSA Form (VS, KK), pp. 33–56.
CC-1996-ChoiSS #incremental: Incremental Computation of Static Single Assignment Form (JDC, VS, ES), pp. 223–237.
PLDI-1992-SarkarT #framework: A General Framework for Iteration-Reordering Loop Transformations (VS, RT), pp. 175–187.
PLDI-1990-CytronFS #dependence: Compact Representations for Control Dependence (RC, JF, VS), pp. 337–351.
PLDI-1990-Sarkar #order #parallel: Instruction Reordering for Fork-Join Parallelism (VS), pp. 322–336.
PLDI-1989-Sarkar #execution: Determining Average Program Execution Times and their Variance (VS), pp. 298–312.
LFP-1988-GharachorlooSH #approach #performance: A Simple and Efficient Implmentation Approach for Single Assignment Languages (KG, VS, JLH), pp. 259–268.
PPEALS-1988-BurkeCFHSS #automation #empirical #parallel: Automatic Discovery of Parallelism: A Tool and an Experiment (MGB, RC, JF, WCH, VS, DS), pp. 77–84.
LFP-1986-SarkarH #clustering #parallel #source code: Partitioning Parallel Programs for Macro-Dataflow (VS, JLH), pp. 202–211.
ASE-2015-MercerAVS #model checking #parallel #source code #using: Model Checking Task Parallel Programs Using Gradual Permissions (N) (EGM, PA, NV, VS), pp. 535–540.
CC-2016-MajetiMBS #architecture #automation #cpu #generative #gpu #kernel #layout: Automatic data layout generation and kernel mapping for CPU+GPU architectures (DM, KSM, RB, VS), pp. 240–250.
CC-2017-ShirakoHS #gpu #parallel #using: Optimized two-level parallelization for GPU accelerators using the polyhedral model (JS, AH, VS), pp. 22–33.
CC-2018-ZhaoBS #analysis #parallel #points-to: Parallel sparse flow-sensitive points-to analysis (JZ, MGB, VS), pp. 59–70.
CC-2018-ZinenkoVRSGS0 #locality #modelling #parallel #scheduling: Modeling the conflicting demands of parallelism and Temporal/Spatial locality in affine scheduling (OZ, SV, CR, JS, TG, VS, AC0), pp. 3–13.
CC-2019-ZhouJKDS #encoding #named: Valence: variable length calling context encoding (TZ, MRJ, PAK, KAD, VS), pp. 147–158.
OOPSLA-2016-SurendranS #automation #parallel #synthesis: Automatic parallelization of pure method calls via conditional future synthesis (RS, VS), pp. 20–38.
OOPSLA-2017-CogumbreiroSMSV #concurrent #parallel #source code #why: Deadlock avoidance in parallel programs with futures: why parallel tasks should not wait for strangers (TC, RS, FM, VS, VTV, MG), p. 26.