Now showing items 1-20 of 45

    • (07) Working with Tony is everything it's cracked up to be 

      Pingali, Keshav (The Internet-First University Press, 2014-09-27)
      Back in 2000, NSF awarded a consortium of universities, led by Cornell, one of the first large Information Technology Research (ITR) grants for a project titled "Adaptive Software for Field-driven Simulations." As the ...
    • (08) Working with Tony is everything it's cracked up to be (slides) 

      Pingali, Keshav (The Internet-First University Press, 2014-11-03)
      Back in 2000, NSF awarded a consortium of universities, led by Cornell, one of the first large Information Technology Research (ITR) grants for a project titled "Adaptive Software for Field-driven Simulations." As the ...
    • Abstract Semantics for a Higher order Functional Language with Logic Variables 

      Jagadeesan, Radhakrishnan; Pingali, Keshav (Cornell University, 1991-07)
      The addition of logic variables to functional languages gives the programmer novel and powerful tools such as incremental definition of data structures through constraint intersection. A number of such "hybrid" languages, ...
    • Access Normalization: Loop Restructuring for NUMA Compilers 

      Li, Wei; Pingali, Keshav (Cornell University, 1992-04)
      A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access non-local data. In addition, when a ...
    • Access Normalization: Loop Restructuring for NUMA Compilers 

      Li, Wei; Pingali, Keshav (Cornell University, 1992-07)
      A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access local data. In addition, when a ...
    • Access Normalization: Loop Restructuring for NUMA Compilers 

      Li, Wei; Pingali, Keshav (Cornell University, 1992-07)
      A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access local data. In addition, when a ...
    • Accumulators: New Logic Variable Abstractions for Functional Languages 

      Pingali, Keshav; Ekanadham, Kattamuri (Cornell University, 1988-12)
      Much attention has been focused by the declarative languages community on combining the functional and logic programming paradigms. In particular, there are many efforts to incorporate logic variables into functional ...
    • Advanced Computing Research Institute Annual Research Activity Report September 1993 - September 1994 

      Pingali, Keshav (Cornell University, 1994-10)
      The Advanced Computing Research Institute (ACRI) is a unit of the Cornell Theory Center and is affiliated with the Cornell Computer Science Department. The ACRI is concerned with research in scientific computation and its ...
    • Automated Application-level Checkpointing of MPI Programs 

      Bronevetsky, Greg; Marques, Daniel; Pingali, Keshav; Stodghill, Paul (Cornell University, 2003-02-12)
      Because of increasing hardware and software complexity, the running time of many computational science applications is now more than the mean-time-to-failure of high-performance computing platforms. Therefore, computational ...
    • Automatic Measurement of Hardware Parameters for Embedded Processors 

      Yotov, Kamen; Pingali, Keshav; Stodghill, Paul (Cornell University, 2005-01-26)
      Embedded processor designs are increasingly based on general-purpose processor families, modified and extended in various ways. However, the production of software for embedded processors remains a challenging problem. ...
    • Automatic Measurement of Memory Hierarchy Parameters 

      Yotov, Kamen; Pingali, Keshav; Stodghill, Paul (Cornell University, 2004-11-08)
      On modern computers, the running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowledge of the memory ...
    • The Bernoulli Generic Matrix Library 

      Mateev, Nikolay; Pingali, Keshav; Stodghill, Paul (Cornell University, 2000-07-27)
      We have implemented the Bernoulli generic programming system for sparse matrix computations. What distinguishes it from existing generic sparse matrix libraries is that we use (i) a high-level matrix abstraction for writing ...
    • Compiler Parallelization of SIMPLE for a Distributed Memory Machine 

      Pingali, Keshav; Rogers, Anne M. (Cornell University, 1990-01)
      In machines like the Intel iPSC/2 and the BBN Butterfly, local memory operations are much faster than inter-processor communication. When writing programs for these machines, programmers must worry about exploiting spatial ...
    • Compiling Imperfectly-nested Sparse Matrix Codes with Dependences 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav; Stodghill, Paul (Cornell University, 2000-03-07)
      We present compiler technology for generating sparse matrix code from (i) dense matrix code and (ii) a description of the indexing structure of the sparse matrices. This technology embeds statement instances into a Cartesian ...
    • Compiling Parallel Sparse Code for User-Defined Data Structures 

      Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1997-06)
      We describe how various sparse matrix and distribution formats can be handled using the {\em relational} approach to sparse matrix code compilation. This approach allows for the development of compilation techniques that ...
    • Dependence Flow Graphs: An Algebraic Approach to Program Dependencies 

      Pingali, Keshav; Beck, Micah; Johnson, Richard C.; Moudgill, Mayan; Stodghill, Paul (Cornell University, 1990-09)
      The topic of intermediate languages for optimizing and parallelizing compilers has received much attention lately. In this paper, we argue that any good representation must have two crucial properties: first, the ...
    • 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 ...