2009 |
94 | EE | Milind Kulkarni,
Martin Burtscher,
Rajeshkar Inkulu,
Keshav Pingali,
Calin Cascaval:
How much parallelism is there in irregular applications?
PPOPP 2009: 3-14 |
93 | EE | Mary Hall,
David A. Padua,
Keshav Pingali:
Compiler research: the next 50 years.
Commun. ACM 52(2): 60-67 (2009) |
2008 |
92 | EE | Milind Kulkarni,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism benefits from data partitioning.
ASPLOS 2008: 233-243 |
91 | EE | Keshav Pingali:
Data-parallel abstractions for irregular programs.
Conf. Computing Frontiers 2008: 117-118 |
90 | EE | Martin Burtscher,
Milind Kulkarni,
Dimitrios Prountzos,
Keshav Pingali:
On the Scalability of an Automatically Parallelized Irregular Application.
LCPC 2008: 109-123 |
89 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Radu Rugina,
Sally A. McKee:
Compiler-enhanced incremental checkpointing for OpenMP applications.
PPOPP 2008: 275-276 |
88 | EE | Milind Kulkarni,
Patrick Carribault,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Scheduling strategies for optimistic parallel execution of irregular programs.
SPAA 2008: 217-228 |
87 | EE | Keshav Pingali:
Parallel and Vector Programming Languages.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
2007 |
86 | EE | Milind Kulkarni,
Keshav Pingali:
Scheduling Issues in Optimistic Parallelization.
IPDPS 2007: 1-7 |
85 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Radu Rugina:
Compiler-Enhanced Incremental Checkpointing.
LCPC 2007: 1-15 |
84 | EE | Milind Kulkarni,
Keshav Pingali,
Bruce Walter,
Ganesh Ramanarayanan,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism requires abstractions.
PLDI 2007: 211-222 |
83 | EE | Kamen Yotov,
Thomas Roeder,
Keshav Pingali,
John A. Gunnels,
Fred G. Gustavson:
An experimental comparison of cache-oblivious and cache-conscious programs.
SPAA 2007: 93-104 |
82 | EE | Kathryn S. McKinley,
Keshav Pingali:
Editorial: A changing of the guard.
ACM Trans. Program. Lang. Syst. 29(6): (2007) |
2006 |
81 | EE | Greg Bronevetsky,
Keshav Pingali,
Paul Stodghill:
Experimental evaluation of application-level checkpointing for OpenMP programs.
ICS 2006: 2-13 |
80 | EE | Keshav Pingali,
Paul Stodghill:
A distributed system based on web services for computational science simulations.
ICS 2006: 297-306 |
79 | EE | Greg Bronevetsky,
Rohit Fernandes,
Daniel Marques,
Keshav Pingali,
Paul Stodghill:
Recent advances in checkpoint/recovery systems.
IPDPS 2006 |
78 | EE | John A. Gunnels,
Fred G. Gustavson,
Keshav Pingali,
Kamen Yotov:
Is Cache-Oblivious DGEMM Viable?
PARA 2006: 919-928 |
77 | EE | Rohit Fernandes,
Keshav Pingali,
Paul Stodghill:
Mobile MPI programs in computational grids.
PPOPP 2006: 22-31 |
2005 |
76 | | Keshav Pingali,
Katherine A. Yelick,
Andrew S. Grimshaw:
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2005, June 15-17, 2005, Chicago, IL, USA
ACM 2005 |
75 | EE | Kamen Yotov,
Keshav Pingali,
Paul Stodghill:
Think globally, search locally.
ICS 2005: 141-150 |
74 | EE | Daniel Marques,
Greg Bronevetsky,
Rohit Fernandes,
Keshav Pingali,
Paul Stodghill:
Optimizing Checkpoint Sizes in the C3 System.
IPDPS 2005 |
73 | EE | Sébastien Donadio,
James C. Brodman,
Thomas Roeder,
Kamen Yotov,
Denis Barthou,
Albert Cohen,
María Jesús Garzarán,
David A. Padua,
Keshav Pingali:
A Language for the Compact Representation of Multiple Program Versions.
LCPC 2005: 136-151 |
72 | EE | Kamen Yotov,
Sandra Jackson,
Tyler Steele,
Keshav Pingali,
Paul Stodghill:
Automatic Measurement of Instruction Cache Capacity.
LCPC 2005: 230-243 |
71 | EE | Arkady Epshteyn,
María Jesús Garzarán,
Gerald DeJong,
David A. Padua,
Gang Ren,
Xiaoming Li,
Kamen Yotov,
Keshav Pingali:
Analytic Models and Empirical Search: A Hybrid Approach to Code Optimization.
LCPC 2005: 259-273 |
70 | EE | Kamen Yotov,
Keshav Pingali,
Paul Stodghill:
Automatic measurement of memory hierarchy parameters.
SIGMETRICS 2005: 181-192 |
2004 |
69 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Peter K. Szwed,
Martin Schulz:
Application-level checkpointing for shared memory programs.
ASPLOS 2004: 235-247 |
68 | EE | Keshav Pingali,
Paul Stodghill:
O'SOAP - A Web Services Framework for DDDAS Applications.
International Conference on Computational Science 2004: 797-804 |
67 | EE | Martin Schulz,
Greg Bronevetsky,
Rohit Fernandes,
Daniel Marques,
Keshav Pingali,
Paul Stodghill:
Implementation and Evaluation of a Scalable Application-Level Checkpoint-Recovery Scheme for MPI Programs.
SC 2004: 38 |
66 | EE | Kevin Barker,
Andrey N. Chernikov,
Nikos Chrisochoides,
Keshav Pingali:
A Load Balancing Framework for Adaptive and Asynchronous Applications.
IEEE Trans. Parallel Distrib. Syst. 15(2): 183-192 (2004) |
65 | EE | Vijay Menon,
Keshav Pingali:
Look Left, Look Right, Look Left Again: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring.
International Journal of Parallel Programming 32(6): 501-523 (2004) |
2003 |
64 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Paul Stodghill:
Collective operations in application-level fault-tolerant MPI.
ICS 2003: 234-243 |
63 | EE | L. Paul Chew,
Nikos Chrisochoides,
S. Gopalsamy,
Gerd Heber,
Anthony R. Ingraffea,
Edward Luke,
Joaquim B. Cavalcante Neto,
Keshav Pingali,
Alan M. Shih,
Bharat K. Soni,
Paul Stodghill,
David S. Thompson,
Stephen A. Vavasis,
Paul A. Wawrzynek:
Computational Science Simulations Based on Web Services.
International Conference on Computational Science 2003: 299-308 |
62 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Paul Stodghill:
C3: A System for Automating Application-Level Checkpointing of MPI Programs.
LCPC 2003: 357-373 |
61 | EE | Kamen Yotov,
Xiaoming Li,
Gang Ren,
Michael Cibulskis,
Gerald DeJong,
María Jesús Garzarán,
David A. Padua,
Keshav Pingali,
Paul Stodghill,
Peng Wu:
A comparison of empirical and model-driven optimization.
PLDI 2003: 63-76 |
60 | EE | Greg Bronevetsky,
Daniel Marques,
Keshav Pingali,
Paul Stodghill:
Automated application-level checkpointing of MPI programs.
PPOPP 2003: 84-94 |
59 | EE | Vijay Menon,
Keshav Pingali,
Nikolay Mateev:
Fractal symbolic analysis.
ACM Trans. Program. Lang. Syst. 25(6): 776-813 (2003) |
58 | EE | Gianfranco Bilardi,
Keshav Pingali:
Algorithms for computing the static single assignment form.
J. ACM 50(3): 375-425 (2003) |
2002 |
57 | EE | Guang R. Gao,
Kevin B. Theobald,
Ziang Hu,
Haiping Wu,
Jizhu Lu,
Keshav Pingali,
Paul Stodghill,
Thomas L. Sterling,
Rick Stevens,
Mark Hereld:
Next Generation System Software for Future High-End Computing Systems.
IPDPS 2002 |
56 | | Kevin Barker,
Nikos Chrisochoides,
Jeffrey Dobbelaere,
Démian Nave,
Keshav Pingali:
Date movement and control substrate for parallel adaptive applications.
Concurrency and Computation: Practice and Experience 14(2): 77-101 (2002) |
2001 |
55 | EE | Vladimir Kotlyar,
David Bau,
Induprakas Kodukula,
Keshav Pingali,
Paul Stodghill:
Solving Alignment Using Elementary Linear Algebra.
Compiler Optimizations for Scalable Parallel Systems Languages 2001: 385-412 |
54 | EE | Jens Knoop,
Manish Gupta,
Keshav Pingali,
Michael F. P. O'Boyle:
Topic 04: Compilers for High Performance.
Euro-Par 2001: 204-206 |
53 | EE | Nikolay Mateev,
Vijay Menon,
Keshav Pingali:
Fractal symbolic analysis.
ICS 2001: 38-49 |
52 | | Induprakas Kodukula,
Keshav Pingali:
Data-Centric Transformations for Locality Enhancement.
International Journal of Parallel Programming 29(3): 319-364 (2001) |
51 | | Nawaaz Ahmed,
Nikolay Mateev,
Keshav Pingali:
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests.
International Journal of Parallel Programming 29(5): 493-544 (2001) |
2000 |
50 | EE | Nawaaz Ahmed,
Keshav Pingali:
Automatic Generation of Block-Recursive Codes.
Euro-Par 2000: 368-378 |
49 | EE | Nikolay Mateev,
Vijay Menon,
Keshav Pingali:
Left-Looking to Right-Looking and Vice Versa: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring.
Euro-Par 2000: 379-388 |
48 | EE | Nawaaz Ahmed,
Nikolay Mateev,
Keshav Pingali:
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests.
ICS 2000: 141-152 |
47 | EE | Nikolay Mateev,
Keshav Pingali,
Paul Stodghill,
Vladimir Kotlyar:
Next-generation generic programming and its application to sparse matrix computations.
ICS 2000: 88-99 |
46 | EE | Bruce Carter,
Chuin-Shan Chen,
L. Paul Chew,
Nikos Chrisochoides,
Guang R. Gao,
Gerd Heber,
Anthony R. Ingraffea,
Roland Krause,
Chris Myers,
Démian Nave,
Keshav Pingali,
Paul Stodghill,
Stephen A. Vavasis,
Paul A. Wawrzynek:
Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.
IPDPS Workshops 2000: 443-449 |
45 | EE | Nawaaz Ahmed,
Nikolay Mateev,
Keshav Pingali,
Paul Stodghill:
A Framework for Sparse Matrix Code Synthesis from High-level Specifications.
SC 2000 |
44 | EE | Kevin B. Theobald,
Gagan Agrawal,
Rishi Kumar,
Gerd Heber,
Guang R. Gao,
Paul Stodghill,
Keshav Pingali:
Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path.
SC 2000 |
43 | EE | Nawaaz Ahmed,
Nikolay Mateev,
Keshav Pingali:
Tiling Imperfectly-Nested Loop Nests.
SC 2000 |
42 | EE | Nikolay Mateev,
Vijay Menon,
Keshav Pingali:
Fractal Symbolic Analysis
CoRR cs.PL/0001009: (2000) |
1999 |
41 | EE | Vijay Menon,
Keshav Pingali:
A case for source-level transformations in MATLAB.
DSL 1999: 53-65 |
40 | EE | Vijay Menon,
Keshav Pingali:
High-level semantic optimization of numerical codes.
International Conference on Supercomputing 1999: 434-443 |
39 | EE | Induprakas Kodukula,
Keshav Pingali,
Robert Cox,
Dror E. Maydan:
An experimental evaluation of tiling and shackling for memory hierarchy management.
International Conference on Supercomputing 1999: 482-491 |
1997 |
38 | | Nikos Chrisochoides,
Induprakas Kodukula,
Keshav Pingali:
Data Movement and Control Substrate for Parallel Scientific Computing.
CANPC 1997: 256-268 |
37 | | Vladimir Kotlyar,
Keshav Pingali,
Paul Stodghill:
A Relational Approach to the Compilation of Sparse Matrix Programs.
Euro-Par 1997: 318-327 |
36 | EE | Vladimir Kotlyar,
Keshav Pingali:
Sparse Code Generation for Imperfectly Nested Loops with Dependences.
International Conference on Supercomputing 1997: 188-195 |
35 | EE | Nikos Chrisochoides,
Induprakas Kodukula,
Keshav Pingali:
Compiler and Run-Time Support for Semi-Structured Applications.
International Conference on Supercomputing 1997: 229-236 |
34 | | Induprakas Kodukula,
Nawaaz Ahmed,
Keshav Pingali:
Data-centric Multi-level Blocking.
PLDI 1997: 346-357 |
33 | | Vladimir Kotlyar,
Keshav Pingali,
Paul Stodghill:
Compiling Parallel Sparse Code for User-Defined Data Structures.
PPSC 1997 |
32 | EE | Keshav Pingali,
Gianfranco Bilardi:
Optimal Control Dependence Computation and the Roman Chariots Problem.
ACM Trans. Program. Lang. Syst. 19(3): 462-491 (1997) |
1996 |
31 | | Gianfranco Bilardi,
Keshav Pingali:
Generalized Dominance and Control Dependence.
PLDI 1996: 291-300 |
1995 |
30 | | Keshav Pingali,
Utpal Banerjee,
David Gelernter,
Alexandru Nicolau,
David A. Padua:
Languages and Compilers for Parallel Computing, 7th International Workshop, LCPC'94, Ithaca, NY, USA, August 8-10, 1994, Proceedings
Springer 1995 |
29 | | Vladimir Kotlyar,
Keshav Pingali,
Paul Stodghill:
Automatic Parallelization of the Conjugate Gradient Algorithm.
LCPC 1995: 480-499 |
28 | | Keshav Pingali,
Gianfranco Bilardi:
APT: A Data Structure for Optimal Control Dependence Computation.
PLDI 1995: 32-46 |
1994 |
27 | | David Bau,
Induprakas Kodukula,
Vladimir Kotlyar,
Keshav Pingali,
Paul Stodghill:
Solving Alignment Using Elementary Linear Algebra.
LCPC 1994: 46-60 |
26 | | Richard Johnson,
David Pearson,
Keshav Pingali:
The Program Structure Tree: Computing Control Regions in Linear Time.
PLDI 1994: 171-185 |
25 | EE | Anne Rogers,
Keshav Pingali:
Compiling for Distributed Memory Architectures.
IEEE Trans. Parallel Distrib. Syst. 5(3): 281-298 (1994) |
1993 |
24 | EE | Mayan Moudgill,
Keshav Pingali,
Stamatis Vassiliadis:
Register renaming and dynamic speculation: an alternative approach.
MICRO 1993: 202-213 |
23 | | Richard Johnson,
Keshav Pingali:
Dependence-Based Program Analysis.
PLDI 1993: 78-89 |
22 | EE | Wei Li,
Keshav Pingali:
Access Normalization: Loop Restructuring for NUMA Compilers.
ACM Trans. Comput. Syst. 11(4): 353-375 (1993) |
1992 |
21 | | Wei Li,
Keshav Pingali:
Access Normalization: Loop Restructuring for NUMA Compilers.
ASPLOS 1992: 285-295 |
20 | | Wei Li,
Keshav Pingali:
A Singular Loop Transformation Framework Based on Non-Singular Matrices.
LCPC 1992: 391-405 |
19 | | Radha Jagadeesan,
Keshav Pingali:
Abstract Semantics for a Higher-Order Functional Language with Logic Variables.
POPL 1992: 355-366 |
18 | | Wei Li,
Keshav Pingali:
Loop Transformations for NUMA Machines.
SIGPLAN Workshop 1992: 9-12 |
1991 |
17 | | Richard Johnson,
Wei Li,
Keshav Pingali:
An Executable Representation of Distance and Direction.
LCPC 1991: 122-136 |
16 | | Keshav Pingali,
Micah Beck,
Richard Johnson,
Mayan Moudgill,
Paul Stodghill:
Dependence Flow Graphs: An Algebraic Approach to Program Dependencies.
POPL 1991: 67-78 |
15 | EE | Radha Jagadeesan,
Keshav Pingali,
Prakash Panangaden:
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables.
ACM Trans. Program. Lang. Syst. 13(4): 577-625 (1991) |
14 | | Micah Beck,
Richard Johnson,
Keshav Pingali:
From Control Flow to Dataflow.
J. Parallel Distrib. Comput. 12(2): 118-129 (1991) |
13 | | Keshav Pingali,
Kattamuri Ekanadham:
Accumulators: New Logic Variable Abstractions for Functional Languages.
Theor. Comput. Sci. 81(2): 201-221 (1991) |
1990 |
12 | | Keshav Pingali,
Anne Rogers:
Compiling for Locality.
ICPP (2) 1990: 142-146 |
11 | | Micah Beck,
Keshav Pingali:
From Control Flow to Dataflow.
ICPP (2) 1990: 43-52 |
10 | | Micah Beck,
Keshav Pingali,
Alexandru Nicolau:
Static Scheduling for Dynamic Dataflow Machines.
J. Parallel Distrib. Comput. 10(4): 279-288 (1990) |
1989 |
9 | | Radha Jagadeesan,
Prakash Panangaden,
Keshav Pingali:
A Fully Abstract Semantics for a Functional Language with Logic Variables
LICS 1989: 294-303 |
8 | | Anne Rogers,
Keshav Pingali:
Process Decomposition Through Locality of Reference.
PLDI 1989: 69-80 |
7 | EE | Arvind,
Rishiyur S. Nikhil,
Keshav Pingali:
I-Structures: Data Structures for Parallel Computing.
ACM Trans. Program. Lang. Syst. 11(4): 598-632 (1989) |
1988 |
6 | | Keshav Pingali,
Kattamuri Ekanadham:
Accumulators: A New Logic Variable Abstractions for Functional Languages.
FSTTCS 1988: 377-399 |
5 | EE | Keshav Pingali:
Lazy evaluation and the logic variable.
ICS 1988: 560-572 |
1986 |
4 | | Arvind,
Rishiyur S. Nikhil,
Keshav Pingali:
I-structures: Data structures for parallel computing.
Graph Reduction 1986: 336-369 |
3 | EE | Keshav Pingali,
Arvind:
Efficient Demand-Driven Evaluation - Part 2.
ACM Trans. Program. Lang. Syst. 8(1): 109-139 (1986) |
2 | | Keshav Pingali,
Arvind:
Clarification of ``Feeding Inputs on Demand'' in Efficient Demand-Driven Evaluation - Part 1.
ACM Trans. Program. Lang. Syst. 8(1): 140-141 (1986) |
1985 |
1 | EE | Keshav Pingali,
Arvind:
Efficient Demand-Driven Evaluation - Part 1.
ACM Trans. Program. Lang. Syst. 7(2): 311-333 (1985) |