Now showing items 12-31 of 45

• #### The Bernoulli Generic Matrix Library ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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*) ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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) ﻿

(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) ﻿

(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 ﻿

(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 ﻿

(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 ﻿

(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 ...