Optimization of Number of Processors in VLSI Arrays - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Optimization of Number of Processors in VLSI Arrays

Yannick Saouter


Since the work of Kung, the systolic architectures have proven their efficiency to deal with many scientific algorithms (LU-decomposition, Gauss-Jordan elimination, ...). Since the early eighties, many works have been made in the area of automatic derivation of systolic architectures. In the general case, there are numerous solutions to the same problem. The final choice of the architecture is often done by comparison of performances. There are several criteria which can be considered: global time of computation, number of processors, latency of the circuit... In this article we are especially interested with the number of processors of the final architecture for which we present a heuristic method.
Fichier principal
Vignette du fichier
RR-2333.pdf (332.03 Ko) Télécharger le fichier

Dates and versions

inria-00074342 , version 1 (24-05-2006)


  • HAL Id : inria-00074342 , version 1


Yannick Saouter. Optimization of Number of Processors in VLSI Arrays. [Research Report] RR-2333, INRIA. 1994. ⟨inria-00074342⟩
56 View
37 Download


Gmail Facebook Twitter LinkedIn More