Now showing items 32-45 of 45

    • 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 ...
    • A Singular Loop Transformation Framework Based on Non-singular Matrices 

      Li, Wei; Pingali, Keshav (Cornell University, 1992-07)
      In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called A-transformations and include permutation, skewing ...
    • A Singular Loop Transformation Framework Based on Non-Singular Matrices 

      Li, Wei; Pingali, Keshav (Cornell University, 1992-07)
      In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called $\Lambda$-transformations and include permutation, skewing ...
    • Solving Alignment using Elementary Linear Algebra 

      Bau, David; Kodukula, Induprakas; Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1995-01)
      Data and computation alignment is an important part of compiling sequential programs to architectures with non-uniform memory access times. In this paper, we show that elementary matrix methods can be used to determine ...
    • Static Scheduling for Dynamic Dataflow Machines 

      Beck, Micah; Pingali, Keshav; Nicolau, Alexandru (Cornell University, 1989-01)
      Dataflow machines can "unravel" loops automatically so that many iterations of a loop can execute in parallel. Unbounded loop unraveling can strain the resources available on the machine and, in extreme cases, deadlock ...
    • Think Globally, Search Locally 

      Yotov, Kamen; Pingali, Keshav; Stodghill, Paul (Cornell University, 2004-11-04)
      A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which is implemented in most compilers, is to ...
    • Tiling Imperfectly-nested Loop Nests (REVISED) 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav (Cornell University, 2000-01-31)
      Tiling is one of the more important transformations for enhancing locality of reference in programs. Tiling of perfectly-nested loop nests (which are loop nests in which all assignment statements are contained in the ...
    • Tiling Imperfectly-nested Loops 

      Ahmed, Nawaaz; Mateev, Nikolay; Pingali, Keshav (Cornell University, 1999-09)
      Tiling is one of the more important transformations for enhancing locality of reference in programs. Intuitively, tiling a set of loops achieves the effect of interleaving iterations of these loops. Tiling has been applied ...
    • Unified framework for sparse and dense SPMD code generation(preliminary report) 

      Kotlyar, Vladimir; Pingali, Keshav; Stodghill, Paul (Cornell University, 1997-03)
      We describe a novel approach to sparse {\em and} dense SPMD code generation: we view arrays (sparse and dense) as distributed relations and parallel loop execution as distributed relational query evaluation. This approach ...
    • X-Ray : Automatic Measurement of Hardware Parameters 

      Yotov, Kamen; Pingali, Keshav; Stodghill, Paul (Cornell University, 2004-10-06)
      There is growing interest in autonomic, self-tuning software that can optimize itself on new platforms, without manual intervention. Optimization requires detailed knowledge of the target platform such as the latency and ...