#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2003

2017

- This year (2)
- Last 5 years (19)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Martin Burtscher, Rupesh Nasre, Keshav Pingali
- IISWC
- 2012

GPUs have been used to accelerate many regular applications and, more recently, irregular applications in which the control flow and memory access patterns are data-dependent and statically unpredictable. This paper defines two measures of irregularity called control-flow irregularity and memory-access irregularity, and investigates, using… (More)

- Rupesh Nasre, Martin Burtscher, Keshav Pingali
- 2013 IEEE 27th International Symposium on…
- 2013

Irregular algorithms are algorithms with complex main data structures such as directed and undirected graphs, trees, etc. A useful abstraction for many irregular algorithms is its operator formulation in which the algorithm is viewed as the iterated application of an operator to certain nodes, called active nodes, in the graph. Each operator application,… (More)

- Rupesh Nasre, Martin Burtscher, Keshav Pingali
- PPOPP
- 2013

There is growing interest in using GPUs to accelerate graph algorithms such as breadth-first search, computing page-ranks, and finding shortest paths. However, these algorithms do not modify the graph structure, so their implementation is relatively easy compared to general graph algorithms like mesh generation and refinement, which <i>morph</i> the… (More)

- Rupesh Nasre, Martin Burtscher, Keshav Pingali
- GPGPU@ASPLOS
- 2013

Atomic instructions are a key ingredient of codes that operate on irregular data structures like trees and graphs. It is well known that atomics can be expensive, especially on massively parallel GPUs, and are often on the critical path of a program. In this paper, we present two high-level methods to eliminate atomics in irregular programs. The first… (More)

- Sandeep Putta, Rupesh Nasre
- CC
- 2012

Pointer analysis is one of the most important static analyses during compilation. While several enhancements have been made to scale pointer analysis, the work on parallelizing the analysis itself is still in infancy. In this article, we propose a parallel version of context-sensitive inclusion-based points-to analysis for C programs. Our analysis makes use… (More)

- Rupesh Nasre, R. Govindarajan
- CGO
- 2011

Pervasive use of pointers in large-scale real-world applications continues to make points-to analysis an important optimization-enabler. Rapid growth of software systems demands a scalable pointer analysis algorithm. A typical inclusion-based points-to analysis iteratively evaluates constraints and computes a points-to solution until a fixpoint. In each… (More)

- Rupesh Nasre
- TACO
- 2013

Compilation of real-world programs often requires hours. The term <i>nightly build</i> known to industrial researchers is an artifact of long compilation times. Our goal is to reduce the absolute analysis times for large C codes (of the order of millions of lines). Pointer analysis is one of the key analyses performed during compilation. Its scalability is… (More)

- Rupesh Nasre
- ISMM
- 2012

Points-to analysis is a key compiler analysis. Several memory related optimizations use points-to information to improve their effectiveness. Points-to analysis is performed by building a constraint graph of pointer variables and dynamically updating it to propagate more and more points-to information across its subset edges. So far, the structure of the… (More)

- Unnikrishnan C., Rupesh Nasre, Y. N. Srikant
- TACO
- 2015

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy—even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error… (More)

- Rupesh Nasre
- MSPC
- 2011

It has been established that achieving a points-to analysis that is scalable in terms of analysis time typically involves trading off analysis precsision and/or memory. In this paper, we propose a novel technique to approximate the solution of an inclusion-based points-to analysis. The technique is based on intelligently approximating pointer- and… (More)