Now showing items 17-36 of 45

    • Efficient Computation of Interprocedural Control Dependence 

      Ezick, James; Bilardi, Gianfranco; Pingali, Keshav (Cornell University, 2001-09-06)
      Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular ...
    • Fast Compiled Logic Simulation Using Linear BDDs 

      Gupta, Sudeep; Pingali, Keshav (Cornell University, 1995-06)
      This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-freeregions ...
    • Fast Compiled Logic Simulation Using Linear BDDs 

      Gupta, Sudeep; Pingali, Keshav (Cornell University, 1995-06)
      This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-free ...
    • Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time 

      Johnson, Richard C.; Pearson, David; Pingali, Keshav (Cornell University, 1993-07)
      Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have ...
    • Fine-Grain Compilation for Pipelined Machines 

      Pingali, Keshav (Cornell University, 1988-08)
      Computer architecture design requires careful attention to the balance between the complexity of code scheduling problems and the cost and feasibility of building a machine. In this paper, we show that recently developed ...
    • Fractal Symbolic Analysis for Program Transformations (*new file*) 

      Mateev, Nikolay; Menon, Vijay; Pingali, Keshav (Cornell University, 2000-02-02)
      Restructuring compilers use dependence analysis to prove that the meaning of a program is not changed by a transformation. A well-known limitation of dependence analysis is that it examines only the memory locations ...
    • From Control Flow to Dataflow 

      Beck, Micah; Pingali, Keshav (Cornell University, 1989-10)
      Are imperative languages tied inseparably to the von Neumann model or can they be implemented in some natural way on dataflow architectures? In this paper, we show how imperative language programs can be translated into ...
    • A Fully Abstract Semantics for a Functional Language with Logic Variables 

      Pingali, Keshav; Panangaden, Prakash; Jagadeesan, Radhakrishnan (Cornell University, 1989-02)
      We present a novel denotational semantics for a functional language with logic variables intended for parallel execution. The intuition behind this semantics is that equations represent equational constraints on data. ...
    • A Generic Programming System for Sparse Matrix Computations 

      Mateev, Nikolay; Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1999-07)
      Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing high-performance sparse matrix libraries is a difficult and tedious job because there are many compressed formats in use ...
    • I-Structures: Data Structures for Parallel Computing 

      Arvind; Nikhil, Rishiyur; Pingali, Keshav (Cornell University, 1987-02)
      It is difficult simulteneously to achieve elegance, efficiency and parallelism in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three ...
    • The Lambda Loop Transformation Toolkit (User's Reference Manual) 

      Li, Wei; Pingali, Keshav (Cornell University, 1994-08)
      Loop transformations are becoming critical to exploiting parallelism and data locality in parallelizing and optimizing compilers. This document describes the Lambda loop transformation toolkit, an implementation of the ...
    • The Lambda Loop Transformation Toolkit (User's Reference Manual) 

      Li, Wei; Pingali, Keshav (Cornell University, 1994-06)
      Loop transformations are becoming critical to exploiting parallelism and data locality in parallelizing and optimizing compilers. This document describes the Lambda loop transformation toolkit, an implementation of the ...
    • Lazy Evaluation and the Logic Variable 

      Pingali, Keshav (Cornell University, 1987-11)
      Functional languages can be enriched with logic variables to provide new computational features such as incremental construction of data structures. In this paper, we present a novel application for logic variables that ...
    • Left-looking to Right-looking and vice versa: An Application of FractalSymbolic Analysis to Linear Algebra Code Restructuring 

      Mateev, Nikolay; Menon, Vijay; Pingali, Keshav (Cornell University, 2000-08-01)
      We have recently developed a new program analysis strategy called fractal symbolic analysis that addresses some of limitations of techniques such as dependence analysis. In this paper, we show how fractal symbolic analysis ...
    • Man vs. Machine : Comparing Handwritten and Compiler-generated Application-Level Checkpointing 

      Ezick, James; Marques, Daniel; Pingali, Keshav; Stodghill, Paul (Cornell University, 2004-10-12)
      The contributions of this paper are the following. We describe the implementation of the $C^3$ system for semi-automatic application-level checkpointing of C programs. The system has (i) a pre-compiler that instruments C ...
    • Optimal Control Dependence Computation and the Roman Chariots Problem 

      Pingali, Keshav; Bilardi, Gianfranco (Cornell University, 1996-09)
      The control dependence relation plays a fundamental role in program restructuring and optimization. The usual representation of this relation is the control dependence graph (CDG), but the size of the CDG can grow ...
    • Performance Analysis of the Pipe Problem, a Multi-Physics Simulation Based on Web Services 

      Stodghill, Paul; Cronin, Rob; Pingali, Keshav; Heber, Gerd (Cornell University, 2004-02-16)
      The ongoing convergence of grid computing and web services has inspired a number of studies on the use of SOAP-based web services for scientific computing. These studies have exposed several performance problems in ...
    • Process Decomposition Through Locality of Reference 

      Rogers, Anne M.; Pingali, Keshav (Cornell University, 1988-08)
      In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally ...
    • Register Renaming and Dynamic Speculation: an Alternative Approach 

      Moudgill, Mayan; Pingali, Keshav; Vassiliadis, Stamatis (Cornell University, 1993-08)
      In this paper, we present a novel mechanism that implements register renaming, dynamic speculation and precise interrupts. Renaming of registers is performed during the instruction fetch stage instead of the decode stage, ...
    • A Relational Approach to the Compilation of Sparse Matrix Programs 

      Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1997-03)
      We present a relational algebra based framework for compiling efficient sparse matrix code from dense DO-ANY loops and a specification of the representation of the sparse matrix. We present experimental data that demonstrates ...