Rajiv Gupta is a Distinguished Professor and the Amrik Singh Poonian Chair in Computer Science at UC Riverside where he is a member of the RIPLE research group. His research interests include: Programming, Compiler, Runtime & Architectural Support for Parallel & Distributed Heterogeneous Systems; and Software Tools for Monitoring and Managing Runtime Behavior. He has coauthored 308 papers and is a coinventor of 9 US patents. His H-index is 63 with over 14,000 citations. Rajiv has supervised PhD dissertations of 32 students including two winners of the ACM SIGPLAN Outstanding Doctoral Dissertation Award in Programming Languages -- (2009) Xiangyu Zhang, Purdue Univ. and (2001) Rastislav Bodik, Univ. of Washington. Five of his advisees are recipients of the NSF CAREER Award. Papers coauthored by Rajiv with his students have been selected for: inclusion in 20 Years of PLDI (1979-1999), SIGSOFT distinguished paper award in ICSE 2003, best paper award in PACT 2010, best paper award in HiPC 2020, best student paper award in LCPC 2015, the most original paper award in ICPP 2003, and outstanding paper award in ICECCS 1996. He received the UCR Doctoral Dissertation Advisor/Mentor Award (2012).

Rajiv is a Fellow of the ACM (2009), the IEEE (2008), and the AAAS (2011). He is a recipient of the NSF's Presidential Young Investigator Award (1991). Rajiv served on the Technical Advisory Group on Networking and Information Technology created by the US President's Council of Advisors on Science and Technology (PCAST) during its review of the Federal NITRD Program (2006-2007). He served as the Conference Chair for FCRC 2015; General Chair for PPoPP'20, ASPLOS'11 and PLDI'08 conferences; and Co-General Chair for CGO'05 conference. He also served as the Program Chair for PLDI'03, HPCA'03, LCTES'05, and CC'10 conferences; Program Co-Chair for CC'21 and HiPEAC'08 conferences; and Program Vice-Chair for HiPC'03 conference. Rajiv has served on program committees of major conferences in PL/Compilers & Computer Architecture including PLDI, POPL, PPoPP, CGO, ISCA, ASPLOS, MICRO, HPCA, ICS, PACT & HiPEAC. He served as an Associate Editor for ACM TACO & IEEE TC, and is currently serving on the boards of Journals of Parallel Computing & Computer Languages.

Current Projects

o   G R A S P ~~ Graph Analytics with Scalability & Performance   
o   Monitoring Clusters & Multicores for Debugging & Reliability  

Past Projects

o   S p i c e C ~~ Software Speculation for Irregular Parallelism  
o   Dynamic Program Analysis for Secure & Reliable Computing
o   Compiler Optimizations & Architectural Support                       

Publications, Patents & Funding

o   Complete List  ⇄  in Selected Venues  ⇄  in Selected Areas  ⇄  Patents  ⇄  Funding
o   MICRO Hall of Fame  ⇄  ASPLOS Hall of Fame

	GRAPH ANALYTICS ON SHARED-MEMORY & DISTRIBUTED SYSTEMS
BigData 2020 |	BEAD: Batched Evaluation of Iterative Graph-Queries with Evolving Analytics Demands
BigData 2019 |	MultiLyra: Scalable Distributed Evaluation of Batches of Iterative Graph Queries
ASPLOS 2019 |	PnP: Pruning and Prediction for Point-To-Point Iterative Graph Analytics
ASPLOS 2017 |	KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations
ASPLOS 2017 |	CoRAL: Confined Recovery in Distributed Asynchronous Graph Processing
TACO 2016 |	Synergistic Analysis of Evolving Graphs
USENIX ATC 2016 |	Load the Edges You Need: A Generic I/O Optimization for Distributive Disk-based Graph Algorithms
HPDC 2016 |	Efficient Processing of Large Graphs via Input Reduction
OOPSLA 2014 |	ASPIRE: Exploiting Asynchronous Parallelism in Iterative Algorithms using a Relaxed Consistency based DSM
	GRAPH ANALYTICS & OTHER IRREGULAR COMPUTATIONS ON ACCELERATORS
MICRO 2020 |	GraphPulse: An Event-Driven Hardware Acceleratorfor Asynchronous Graph Processing
EuroSys 2020 |	Subway: Minimizing Data Transfer during Out-of-GPU-Memory Graph Processing
ICS 2016 |	CuMAS: Data Transfer Aware Multi-Application Scheduling for Shared GPUs
IPDPS 2016 |	Eliminating Intra-warp Load Imbalance in Irregular Nested Patterns via Collaborative Task Engagement
MICRO 2015 |	Efficient Warp Execution in Presence of Divergence with Collaborative Context Collection
PACT 2015 |	Scalable SIMD-Efficient Graph Processing on GPUs   (download WS & VR)
PACT 2015 |	Stadium Hashing: Scalable and Flexible Hashing on GPUs
ICS 2015 |	PeerWave: Exploiting Wavefront Parallelism on GPUs with Peer-SM Synchronization
HPDC 2014 |	CuSha: Vertex-Centric Graph Processing on GPUs   (download )
TACO 2013 |	A Dynamic Self Scheduling Scheme for Heterogeneous Multiprocessor Architectures
	UNDERSTANDING & MANAGING RUNTIME BEHAVIOR
OOPSLA 2019 |	DProf: Distributed Profiler with Strong Guarantees
ICSE 2019 |	Dynamic Slicing for Android (download AndroidSlicer)
IPDPS 2018 |	COMPI: Concolic Testing for MPI Applications
SC 2017 |	ParaStack: Efficient Hang Detection for MPI Programs at Large Scale
HPDC 2016 |	Parallel Execution Profiles
TACO 2016 |	Tumbler: An Effective Load Balancing Technique for MultiCPU Multicore Systems
OOPSLA 2015 |	RAIVE: Runtime Assessment of Floating-Point Instability by Vectorization
PACT 2014 |	Shuffling: A Framework for Lock Contention Aware Thread Scheduling for Multicore Multiprocessor Systems
TACO 2013 |	ADAPT: A Framework for Coscheduling Multithreaded Programs
TACO 2012 |	Thread Tranquilizer: Dynamically Reducing Performance Variation
PACT 2011 |	No More Backstabbing...A Faithful Scheduling Policy for Multithreaded Programs
	MEMORY CONSISTENCY & DEPENDENCE MONITORING
SC 2014 |	Fence Scoping
ICS 2013 |	Address-aware Fences
ASPLOS 2012 |	Efficient Sequential Consistency via Conflict Ordering
TACO 2011 |	Dynamic Access Distance Driven Cache Replacement
PACT 2010 |	Efficient Sequential Consistency Using Conditional Fences
ISCA 2009 |	ECMon: Exposing Cache Events for Monitoring
VEE 2009 |	Architectural Support for Shadow Memory in Multiprocessors
	SOFTWARE SPECULATION FOR IRREGULAR COMPUTATIONS
PLDI 2012 |	Effective Parallelization of Loops in the Presence of I/O Operations
TACO 2012 |	PLDS: Partitioning Linked Data Structures for Parallelism
PPoPP 2011 |	SpiceC: Scalable Parallelism via implicit copying and explicit Commit
PPoPP 2011 |	Enhanced Speculative Parallelization Via Incremental Recovery
PLDI 2010 |	Supporting Speculative Parallelization in the Presence of Dynamic Data Structures
MICRO 2008 |	Copy Or Discard Execution Model For Speculative Parallelization On Multicores
	DEBUGGING AND FAULT LOCALIZATION
CGO 2014 |	DrDebug: Deterministic Replay based Cyclic Debugging with Dynamic Slicing   (download Replay & Slicing)
TOPLAS 2010 |	Execution Suppression: An Automated Iterative Technique for Locating Memory Errors
ISSTA 2008 |	Fault Localization Using Value Replacement
ISSTA 2008 |	Dynamic Recognition of Synchronization Operations for Improved Data Race Detection
PLDI 2007 |	Towards Locating Execution Omission Errors
PLDI 2006 |	Pruning Dynamic Slices With Confidence
ICSE 2006 |	Locating Faults Through Automated Predicate Switching
ASE 2005 |	Locating Faulty Code Using failure-Inducing Chops
	SCALABLE DYNAMIC ANALYSIS: TRACING AND SLICING
TACO 2007 |	Unified Control Flow and Dependence Traces
ISSTA 2007 |	Enabling Tracing of Long-Running Multithreaded Programs via Dynamic Execution Reduction
FSE 2006 |	Dynamic Slicing Long Running Programs through Execution Fast Forwarding
ESEC-FSE 2005 |	Matching Execution Histories of Program Versions
PACT 2005 |	Extended Whole Program Paths
TACO 2005 |	Whole Execution Traces and their Applications
TOPLAS 2005 |	Cost and Precision Tradeoffs of Dynamic Data Slicing Algorithms
ICSE 2004 |	Effective Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
PLDI 2004 |	Cost Effective Dynamic Program Slicing
MICRO 2004 |	Whole Execution Traces
ICSE 2003 |	Precise Dynamic Slicing Algorithms
PLDI 2001 |	Timestamped Whole Program Path Representation and its Applications
	COMPILER OPTIMIZATIONS
POPL 2003 |	Bitwidth Aware Global Register Allocation
PLDI 2000 |	ABCD: Eliminating Array Bounds Checks on Demand
PLDI 1999 |	Load-Reuse Analysis: Design and Evaluation
PLDI 1998 |	Complete Removal of Redundant Expressions
ICCL 1998 |	Path Profile Guided Partial Redundancy Elimination Using Speculation
PACT 1998 |	Capturing the Effects of Code Improving Transformations
PLDI 1997 |	Partial Dead Code Elimination using Slicing Transformations
PLDI 1997 |	Interprocedural Conditional Branch Elimination
PACT 1997 |	Path Profile Guided Partial Dead Code Elimination Using Predication
TOPLAS 1994 |	Efficient Register Allocation Via Coloring Using Clique Separators
LOPLAS 1994 |	Optimizing Array Bound Checks Using Flow Analysis
PACT 1994 |	Resource Spackling: A Framework for Integrating Register Allocation in Local and Global Schedulers
PACT 1993 |	URSA: A Unified ReSource Allocator for Registers and Functional Units in VLIW Architectures
PLDI 1990 |	A Fresh Look at Optimizing Array Bound Checks
PLDI 1989 |	Register Allocation via Clique Separators
	SCALABLE STATIC ANALYSIS
MICRO 1997 |	Resource-Sensitive Profile-Directed Data Flow Analysis for Code Optimization
ESEC-FSE 1997 |	Refining Data Flow Information using Infeasible Paths
TOPLAS 1997 |	A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis
POPL 1995 |	Demand-Driven Computation of Interprocedural Data Flow
PLDI 1993 |	A Practical Data Flow Framework for Array Reference Analysis and its Application in Optimizations
POPL 1992 |	Generalized Dominators and Post-Dominators
	ARCHITECTURES: EMBEDDED & VLIW
MICRO 2005 |	Efficient Use of Invisible Registers in Thumb Code
TECS 2005 |	Dynamic Coalescing for 16-bit Instructions
TODAES 2004 |	Frequent Value Encoding for Low Power Data Buses
MICRO 2002 |	Energy Efficient Frequent Value Data Cache Design
TECS 2002 |	Frequent Value Locality and its Applications
MICRO 2000 |	Frequent Value Compression in Data Caches
ASPLOS 2000 |	Frequent Value Locality and Value-Centric Data Cache Design
ISCA 1999 |	Value Prediction in VLIW Machines
PPEALS 1988 |	Compile-time Techniques for Efficient Utilization of Parallel Memories
	ARCHITECTURES: MIMD & SUPERSCALAR
HPCA 2005 |	SENSS: Security Enhancement to Symmeteric Shared Memory Multiprocessors
ICS 2001 |	Load and Store Reuse Using Register File Contents
MICRO 1999 |	Dynamic Memory Disambiguation in the Presence of Out-of-order Store Issuing
HPCA 1999 |	Global Context-based Value Prediction
PACT 1999 |	Caching and Predicting Branch Sequences for Improved Fetch Effectiveness
PACT 1998 |	Superscalar Execution with Direct Data Forwarding
HPCA 1997 |	Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks
MICRO 1992 |	A Shape Matching Approach for Scheduling Fine-Grained Parallelism
MICRO 1991 |	Executing Loops on a Fine-Grained MIMD Architecture
SC 1990 |	The Design of a RISC based Multiprocessor Chip
PPoPP 1990 |	Employing Register Channels for the Exploitation of Instruction Level Parallelism
MICRO 1990 |	A Fine-grained MIMD Architecture based upon Register Channels
ASPLOS 1989 |	The Fuzzy Barrier: A Mechanism for High-Speed Synchronization of Processors