Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation

Algorithm engineering and VLSI design

William Marnane 1 Rumen Andonov 2
2 API - Parallel VLSI Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The task of producing a VLSI architecture that will solve a given problem contains many design decisions. The effects of these decisions on the final design are often difficult to quantify. We will compare three different implementations of a systolic architecture for solving the knapsack problem using the dynamic programming method. The design decisions involved and the engineering of the algorithm (altering the algorithm to improve its implementation) are highlighted and their effects on the resulting implementation are discussed. We will also relate the design area and timing to the parameters of the knapsack problem. We derive [??]) as estimations of area and circuit timing complexity of the memory control. We will eliminate the influence of the dominant knapsack parameter (the capacity c) and replace it by the maximum weight [??]. This is of crucial importance for a realistic and efficient VLSI implementation of this problem since in practice [??]2 c.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:54:15 PM
Last modification on : Friday, February 4, 2022 - 3:24:01 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:20:58 PM


  • HAL Id : inria-00074614, version 1


William Marnane, Rumen Andonov. Algorithm engineering and VLSI design. [Research Report] RR-2058, INRIA. 1993. ⟨inria-00074614⟩



Record views


Files downloads