Memory Management Optimization Problems for Integrated Circuit Simulators

Timothée Bossart Alix Munier-Kordon 1 Francis Sourd 2
1 CIAN - Circuits Intégrés Numériques et Analogiques
LIP6 - Laboratoire d'Informatique de Paris 6
2 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator. An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 11:37:31 AM
Last modification on : Thursday, December 13, 2018 - 1:33:22 AM

Links full text



Timothée Bossart, Alix Munier-Kordon, Francis Sourd. Memory Management Optimization Problems for Integrated Circuit Simulators. Discrete Applied Mathematics, Elsevier, 2007, 155 (14), pp.1795-1811. ⟨10.1016/j.dam.2007.03.019⟩. ⟨hal-01185123⟩



Record views