#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2016

- This year (0)
- Last 5 years (16)
- Last 10 years (22)

#### 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
- 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
- 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)

- B. Aditya, Soumen Chakrabarti, +5 authors S. Sudarshan
- ICDE
- 2003

- 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)

- 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, Kaushik Rajan, R. Govindarajan, Uday P. Khedker
- APLAS
- 2009

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a… (More)

- Rupesh Nasre, R. Govindarajan
- SAS
- 2010

The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advances, the trade-off between precision and scalability still remains a key issue. In this work, we propose a novel formulation of the points-to analysis as a system of linear… (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)

- Sandeep Putta, Rupesh Nasre
- CC
- 2012