- Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path
- Compiling Imperfectly-nested Sparse Matrix Codes with Dependencies
- A Distributed System Based on Web Services for Computational Science Simulations
- Dependence-Based Program Analysis Richard Johnson
- LOCALITY ENHANCEMENT OF IMPERFECTLY-NESTED LOOP NESTS
- Resolving and Applying Constraint Queries on Context-Sensitive Analyses
- Parallel Programming Languages Keshav Pingali,
- Collisions of SHA-0 and Reduced SHA-1 Eli Biham1,
- Applications of Storage Mapping Optimization to Register Promotion
- Computational Science Simulations based on Web , Nikos Chrisochoides5
- Using Transactions in Delaunay Mesh Generation Milind Kulkarni
- Exploiting the Commutativity Lattice Milind Kulkarni
- Synthesizing Concurrent Schedulers for Irregular Algorithms
- An Executable Representation of Distance and Direction Richard Johnson
- Exploring Application Performance: a New Tool For a Static/Dynamic Approach Lamia Djoudi
- Automatic Generation of Block-Recursive Codes Nawaaz Ahmed and Keshav Pingali
- Synthesizing Transformations for Locality Enhancement
- Ordered vs. Unordered: a Comparison of Parallelism and Work-efficiency in Irregular Algorithms
- The Tao of Parallelism in Algorithms Keshav Pingali1,3, Donald Nguyen1, Milind Kulkarni5,
- AN END-TO-END SYSTEM FOR MODEL CHECKING OVER CONTEXT-SENSITIVE ANALYSES
- X-Ray: A Tool for Automatic Measurement of Hardware Parameters
- A RELATIONAL APPROACH TO THE AUTOMATIC GENERATION OF SEQUENTIAL
- Implementation and Evaluation of a Scalable Application-level Checkpoint-Recovery Scheme for MPI
- Fast Agglomerative Clustering for Rendering Bruce Walter
- Tiling Imperfectly-nested Loop Nests Nawaaz Ahmed, Nikolay Mateev and Keshav Pingali,
- Data-centric Multi-level Blocking Induprakas Kodukula, Nawaaz Ahmed, and Keshav Pingali
- On the Scalability of an Automatically Parallelized Irregular Application
- Branch Strategies to Optimize Decision Trees for Wide-Issue Architectures
- Is Search Really Necessary to Generate High-Performance BLAS?
- Fractal Symbolic Analysis Vijay Menon, Intel Corporation,
- Mobile MPI Programs in Computational Grids Rohit Fernandes, Keshav Pingali, Paul Stodghill
- Application-level Checkpointing for Shared Memory Greg Bronevetsky, Daniel Marques, Keshav Pingali
- An Experimental Comparison of Cache-oblivious and Cache-aware Programs
- Data Movement and Control Substrate for parallel scienti c computing?
- A Comparison of Empirical and Model-driven Optimization Kamen Yotov2
- Automated Application-level Checkpointing of MPI Programs Greg Bronevetsky, Daniel Marques, Keshav Pingali, Paul Stodghill
- The Program Structure Tree: Computing Control Regions in Linear Time Richard Johnson David Pearson Keshav Pingali
- The Nullable, First and Follows sets are as follows: Nullable = E,F,D
- I-Structures: Data Structures for Parallel Computing Arvindy (MIT)
- Compiler and run-time support for semi-structured applications Nikos Chrisochoides, Induprakas Kodukula, and Keshav Pingali
- An Experimental Evaluation of Tiling and Shackling for Memory Hierarchy Induprakas Kodukula, Keshav Pingali Robert Cox, Dror Maydan
- From Control Flow To Dataflow Keshav Pingali
- An Optimizing Compiler for Batches of Temporal Logic James Ezick
- Machine Learning-Based Prefetch Optimization for Data Center Applications
- Parallel Graph Partitioning on Multicore Architectures
- How Much Parallelism is There in Irregular Applications? Milind Kulkarni, Martin Burtscher,
- An Experimental Study of Self-Optimizing Dense Linear
- Optimistic Parallelism Requires Abstractions Milind Kulkarni ,
- A Language for the Compact Representation of Multiple Program Versions
- Automatic Measurement of Instruction Cache Capacity
- Think Globally, Search Locally Kamen Yotov, Keshav Pingali, Paul Stodghill,
- Automatic Measurement of Memory Hierarchy Parameters Kamen Yotov, Keshav Pingali, Paul Stodghill
- Collective Operations in an Application-level Fault Tolerant MPI System Greg Bronevetsky, Daniel Marques, Keshav Pingali, Paul Stodghill
- Algorithms for Computing the Static Single Assignment Form
- Look Left, Look Right, Look Left Again: An Application of Fractal Symbolic Analysis
- !"$#&%')(01243563879A@BC4DEGF'HPIQRSD 7T3UV "W)XP%' YXX(0422435Ia`
- Data-centric Transformations for Locality Enhancement
- Fractal Symbolic Analysis Nikolay Mateev
- A Framework for Sparse Matrix Code Synthesis from High-level Specifications
- Next-generation Generic Programming and its Application to Sparse Matrix Computations
- Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests
- Parallel FEM Simulation of Crack Propagation on the AC3 Velocity Cluster
- High-Level Semantic Optimization of Numerical Codes Vijay Menon and Keshav Pingali
- Compiling Parallel Code for Sparse Matrix Applications Vladimir Kotlyar Keshav Pingali Paul Stodghill
- A Relational Approach to the Compilation of Sparse Matrix Programs ?
- Compiling Parallel Sparse Code for User-De ned Data Structures y
- Optimal Control Dependence Computation and the Roman Chariots Problem
- A Framework for Generalized Control Dependence Gianfranco Bilardi Keshav Pingali
- APT: A Data Structure for Optimal Control Dependence Computation Keshav Pingali ` Gianfranco Bilardi 2
- Fast Compiled Logic Simulation Using Linear BDDs Sudeep Gupta and Keshav Pingali
- Solving Alignment Using Elementary Linear Vladimir Kotlyar, David Bau, Induprakas Kodukula, Keshav Pingali, and
- Register Renaming and Dynamic Speculation: an Alternative Approach Mayan Moudgill & Keshav Pingali Stamatis Vassiliadis
- Access Normalization: Loop Restructuring for NUMA Computers Keshav Pingali
- Lifetime-Sensitive Modulo Scheduling Richard A. Huff
- Abstract Semantics for a Higher-Order Functional Language with Logic Variables
- A Fully Abstract Semantics for a First-order Functional Language with Logic Variables
- From Control Flow to Data ow Richard Johnson
- Dependence Flow Graphs: An Algebraic Approach to Program Dependencies
- Dependence Flow Graphs: An Algebraic Approach to Program Dependencies
- On the Scalability of an Automatically Parallelized Irregular Application
- Departement d'informatique Ecole doctorale "SoFt" UFR de Sciences
- Journal of Instruction-Level Parallelism 9 (2007) 126 Submitted 6/07; published 9/07 Deep Jam: Conversion of Coarse-Grain Parallelism to Fine-Grain and
- Loop Optimization using Hierarchical Compilation and Kernel Decomposition Denis Barthou 1
- SaM v2.6 Design Documentation Ivan Gyurdiev
- nts for correc wing path
- CS 375 Final Problem Set Due date: April 29th
- Uni ed framework for sparse and dense SPMD code generation (preliminary report)
- Access Normalization: Loop Restructuring for NUMA Compilers Keshav Pingaliy
- Amorphous Data-parallelism in Irregular Algorithms Keshav Pingali1,2, Milind Kulkarni2, Donald Nguyen1,
- Runtime System Support for Parallel Iterative PDE Computations
- Transformations for Imperfectly Nested Loops Induprakas Kodukula
- Checkpointing Shared Memory Programs at the Application-level
- Compiling for distributed memory architectures Anne Rogers and Keshav Pingali
- Experimental Evaluation of Application-level Checkpointing for OpenMP Programs
- Fractal Symbolic Analysis for Program Transformations Nikolay Mateev, Vijay Menon, Keshav Pingali
- In this paper, we argue that the deployment of high performance wide area networks coupled with the availability of commodity
- Deep Jam: Conversion of Coarse-Grain Parallelism to Instruction-Level and Vector Parallelism for Irregular Applications
- Sparse code generation for imperfectly nested loops with dependences Vladimir Kotlyar Keshav Pingali
