38. ASPLOS |
PnP: Pruning and Prediction for Point-To-Point Iterative Graph Analytics (2019)
|
37. ASPLOS |
KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations (2017)
|
36. ASPLOS |
CoRAL: Confined Recovery in Distributed Asynchronous Graph Processing (2017)
|
35. ASPLOS |
Efficient Sequential Consistency via Conflict Ordering (2012)
|
34. ASPLOS |
Frequent Value Locality and Value-Centric Data Cache Design (2000)
|
33. ASPLOS |
The Fuzzy Barrier: A Mechanism for High-Speed Synchronization of Processors (1989)
|
32. ISCA |
ECMon: Exposing Cache Events for Monitoring (2009)
|
31. ISCA |
Value Prediction in VLIW Machines (1999)
|
30. MICRO |
JetStream: Graph Analytics on Streaming Data with Event-Driven Hardware Accelerator (2021)
|
29. MICRO |
GraphPulse: An Event-Driven Hardware Accelerator for Asynchronous Graph Processing (2020)
|
28. MICRO |
Efficient Warp Execution in Presence of Divergence with Collaborative Context Collection (2015)
|
27. MICRO |
Copy Or Discard Execution Model For Speculative Parallelization On Multicores (2008)
|
26. MICRO |
Efficient Use of Invisible Registers in Thumb Code (2005)
|
25. MICRO |
Whole Execution Traces (2004)
|
24. MICRO |
Energy Efficient Frequent Value Data Cache Design (2002)
|
23. MICRO |
Frequent Value Compression in Data Caches (2000)
|
22. MICRO |
Dynamic Memory Disambiguation in the Presence of Out-of-order Store Issuing (1999)
|
21. MICRO |
Resource-Sensitive Profile-Directed Data Flow Analysis for Code Optimization (1997)
|
20. MICRO |
A Shape Matching Approach for Scheduling Fine-Grained Parallelism (192)
|
19. MICRO |
Executing Loops on a Fine-Grained MIMD Architecture (1991)
|
18. MICRO |
A Fine-grained MIMD Architecture based upon Register Channels (1990)
|
17. HPCA |
SENSS: Security Enhancement to Symmeteric Shared Memory Multiprocessors (2005)
|
16. HPCA |
Global Context-based Value Prediction (1999)
|
15. HPCA |
Distributed Path Reservation Algorithms for Multiplexed All-Optical
Interconnection Networks (1997)
|
14. ICSE |
Dynamic Slicing for Android (2019)
|
13. ICSE |
Locating Faults Through Automated Predicate Switching (2006)
|
12. ICSE |
Effective Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams (2004)
|
11. ICSE |
Precise Dynamic Slicing Algorithms (2003),
Recipient of ICSE 2003 Distinguished Paper Award
|
10. ICSE |
A Demand-Driven Analyzer for Data Flow Testing at the Integration Level (1996)
|
9. ASE |
Locating Faulty Code Using Failure-Inducing Chops (2005)
|
8. FSE |
Dynamic Slicing Long Running Programs through Execution Fast Forwarding (2006)
|
7. ESEC-FSE |
Matching Execution Histories of Program Versions (2005)
|
6. ESEC-FSE |
Comparison Checking: An Approach to Avoid Debugging of Optimized Code (1999)
|
5. ESEC-FSE |
Refining Data Flow Information using Infeasible Paths (1997)
|
4. FSE |
Hybrid Slicing: An Approach for Refining
Static Slices using Dynamic Information (1995)
|
3. ISSTA |
Fault Localization Using Value Replacement (2008)
|
2. ISSTA |
Dynamic Recognition of Synchronization Operations for Improved Data Race Detection (2008)
|
1. ISSTA |
Enabling Tracing of Long-Running Multithreaded Programs via Dynamic Execution Reduction (2007)
|