A lightweight infrastructure for graph analytics
- Donald Nguyen, Andrew Lenharth, K. Pingali
- Computer ScienceSymposium on Operating Systems Principles
- 3 November 2013
This paper argues that existing DSLs can be implemented on top of a general-purpose infrastructure that supports very fine-grain tasks, implements autonomous, speculative execution of these tasks, and allows application-specific control of task scheduling policies.
A quantitative study of irregular programs on GPUs
- Martin Burtscher, R. Nasre, K. Pingali
- Computer ScienceIEEE International Symposium on Workload…
- 4 November 2012
This paper defines two measures of irregularity called control-flow irregularity and memory-access irregularity, and investigates, using performance-counter measurements, how irregular GPU kernels differ from regular kernels with respect to these measures.
I-structures: data structures for parallel computing
- Arvind, R. Nikhil, K. Pingali
- Computer ScienceGraph Reduction
- 29 September 1986
It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures, and it is shown that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.
The tao of parallelism in algorithms
- K. Pingali, Donald Nguyen, Xin Sui
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 4 June 2011
It is suggested that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming.
Lonestar: A suite of parallel irregular programs
- Milind Kulkarni, Martin Burtscher, C. Cascaval, K. Pingali
- Computer ScienceIEEE International Symposium on Performance…
- 26 April 2009
The first five programs from the Lonestar benchmark suite are characterized, which target domains like data mining, survey propagation, and design automation, and it is shown that even such irregular applications often expose large amounts of parallelism in the form of amorphous data-parallelism.
Optimistic parallelism requires abstractions
- Milind Kulkarni, K. Pingali, B. Walter, Ganesh Ramanarayanan, K. Bala, L. Chew
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 15 June 2007
It is shown that Delaunay mesh generation and agglomerative clustering can be parallelized in a straight-forward way using the Galois approach, and results suggest that Galois is a practical approach to exploiting data parallelism in irregular programs.
The program structure tree: computing control regions in linear time
- Richard Johnson, David Pearson, K. Pingali
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 1 June 1994
A linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones) is given and it is shown how to use the algorithm to find control regions in linear time.
An Efficient CUDA Implementation of the Tree-Based Barnes Hut n-Body Algorithm
- Martin Burtscher, K. Pingali
- Computer Science
- 2011
Process decomposition through locality of reference
- Anne Rogers, K. Pingali
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 21 June 1989
A system which, given a sequential program and its domain decomposition, performs process decomposition so as to enhance spatial locality of reference and an application - generating code from shared-memory programs for the (distributed memory) Intel iPSC/2.
Data-centric multi-level blocking
- Induprakas Kodukula, Nawaaz Ahmed, K. Pingali
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 1 May 1997
This work presents a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy based on reasoning directly about the flow of data through the memory hierarchy, which permits a more direct solution to the problem of enhancing data locality.
...
...