Synthesis of size-optimal toroïdal arrays for the Algebraic Path Problem: A new contribution-Reference-Cited by-同舟云学术

Synthesis of size-optimal toroïdal arrays for the Algebraic Path Problem: A new contribution

Published:1992-02 Issue:2 Volume:18 Page:185-194
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Clauss Ph,Mongenet C,Perrin G.R

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference20 articles.

1. Synthesis of a new systolic architecture for the Algebraic Path Problem;Benaini;Sci. Comput. Programming,1990

2. Spacetime-minimal systolic arrays for Gaussian Elimination and the Algebraic Path Problem;Benaini,1990

3. Parallelization of Gauss elimination algorithm on systolic arrays;Bermond,1988

4. Synthèse d'algorithms systoliques et implantation optimale en place sur réseaux de processeurs synchrones;Clauss,1990

5. Synthesis of process arrays;Clauss,1988

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Derivation of systolic algorithms for the algebraic path problem by recurrence transformations;Parallel Computing;2000-10

2. Finding quadratic schedules for affine recurrence equations via nonsmooth optimization;The Journal of VLSI Signal Processing;2000

3. The Algebraic Path Problem Revisited;Euro-Par’99 Parallel Processing;1999

4. Design of space-optimal regular arrays for algorithms with linear schedules;IEEE Transactions on Computers;1995-05

5. Geometrical tools to map systems of affine recurrence equations on regular arrays;Acta Informatica;1994-02