Toward automatic distribution
P Feautrier - Parallel Processing Letters, 1994 - World Scientific
This paper considers the problem of distributing data and code among the processors of a
distributed memory supercomputer. Provided that the source program is amenable to …
distributed memory supercomputer. Provided that the source program is amenable to …
Linear scheduling is nearly optimal
This paper deals with the problem of finding optimal schedulings for uniform dependence
algorithms. Given a convex domain, let Tf be the total time needed to execute all …
algorithms. Given a convex domain, let Tf be the total time needed to execute all …
Regular partitioning for synthesizing fixed-size systolic arrays
A Darte - Integration, 1991 - Elsevier
Extending the projection method for the synthesis of systolic arrays, we present a procedure
for the design of fixed-size systolic arrays using a technique called “locally sequential …
for the design of fixed-size systolic arrays using a technique called “locally sequential …
Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
A Benaini, Y Robert - Parallel Computing, 1990 - Elsevier
In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the
Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of …
Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of …
Run-time evolution for embedded component-oriented systems
Y Vandewoude, Y Berbers - International Conference on …, 2002 - ieeexplore.ieee.org
This position paper describes ongoing work in which the Java-based SEESCOA component
system is extended with functionality for run-time evolution. First, an assessment is made of …
system is extended with functionality for run-time evolution. First, an assessment is made of …
Reduction operators in alpha
H Le Verge - PARLE'92 Parallel Architectures and Languages …, 1992 - Springer
This paper introduces reduction operators of Alpha. Alpha is the basis of the environment
Alpha du Centaur, whose purpose is the design of systolic or more generally, regular arrays …
Alpha du Centaur, whose purpose is the design of systolic or more generally, regular arrays …
Matrix computations on systolic-type meshes: An introduction to the multimesh graph method
Matrix computations on systolic-type meshes: an introduction to the multimesh graph method
Page 1 M Matrix Computations on Systolic-Type Meshes An Introduction to the Multimesh …
Page 1 M Matrix Computations on Systolic-Type Meshes An Introduction to the Multimesh …
Dynamic programming parallel implementations for the knapsack problem
A systolic algorithm for the dynamic programming approach to the knapsack problem is
presented. The algorithm can run on any number of processors and has optimal time …
presented. The algorithm can run on any number of processors and has optimal time …