• Publications
  • Influence
CuSha: vertex-centric graph processing on GPUs
TLDR
CuSha is a CUDA-based graph processing framework that overcomes the above obstacle via use of two novel graph representations: G-Shards and Concatenated Windows. Expand
ABCD: eliminating array bounds checks on demand
TLDR
ABCD is a light-weight algorithm for elimination of Array Bounds Checks on Demand that can be applied to a set of frequently executed (hot) bounds checks, which makes it suitable for the dynamic-compilation setting, in which compile-time cost is constrained but hot statements are known. Expand
The BALLAST Methodology for Structured Partial Scan Design
TLDR
An efficient partial scan technique called Ballast (balanced structure scant test) is presented, which leads to a low area overhead and allows 100% coverage of irredundant faults. Expand
Locating faults through automated predicate switching
TLDR
By forcibly switching a predicate's outcome at runtime and altering the control flow, the program state can not only be inexpensively modified, but in addition it is often possible to bring the program execution to a successful completion (i.e., program produces the desired output). Expand
Frequent Value Locality and Value-Centric Data Cache Design
TLDR
A new data cache structure, the frequent value cache (FVC), is proposed, which employs a value-centric approach to caching data locations for exploiting the frequentvalue locality phenomenon. Expand
Fault localization using value replacement
TLDR
A value profile based approach for ranking program statements according to their likelihood of being faulty, which outperforms Tarantula which is the most effective prior approach for statement ranking based fault localization using the benchmark programs the authors studied. Expand
A methodology for controlling the size of a test suite
TLDR
A technique to select a representative set of test cases from a test suite that provides the same coverage as the entire test suite by identifying, and then eliminating, the redundant and obsolete test cases in the test suite is presented. Expand
Frequent value locality and its applications
TLDR
This work demonstrates that a small number of distinct values tend to occur very frequently in memory and demonstrates that the identity of frequent values remains stable over the entire execution of the program and these values are scattered fairly uniformly across the allocated memory. Expand
Precise dynamic slicing algorithms
TLDR
This paper shows that while precise slices can be orders of magnitude smaller than imprecise dynamic slices, for small number of slicing requests, the LP algorithm is faster than an imprecising dynamic slicing algorithm proposed by Agrawal and Horgan. Expand
Copy or Discard execution model for speculative parallelization on multicores
TLDR
This paper proposes the Copy or Discard (CorD) execution model in which the state of speculative parallel threads is maintained separately from the nonspeculative computation state, and presents an algorithm for profile-based speculative parallelization that is effective in extracting parallelism from sequential programs. Expand
...
1
2
3
4
5
...