Retiming DAGs

Abstract : The increasing complexity of digital circuitry makes global design optimization no longer possible: a designer will only consider the critical parts of his circuit. This paper discusses timing optimization problems when these critical parts can be represented by Direct Acyclic Graphs (DAGs). We deal with different (though related) clock period problems, under various external constraints. The main algorithm concerns the determination of the optimal clock period of a given circuit. We propose an efficient solution, based on the retiming technique, which improves current results in the literature. We give three different formulations depending on which combinational gates delay model is used: same delay for every gate, different delays or non-uniform delays.
Document type :
Reports
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101755
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:05:25 AM
Last modification on : Thursday, November 21, 2019 - 2:38:39 AM

File

RR1995-18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101755, version 1

Collections

Citation

Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frédéric Vivien. Retiming DAGs. [Research Report] LIP RR-1995-18, Laboratoire de l'informatique du parallélisme. 1995, 2+20p. ⟨hal-02101755⟩

Share

Metrics

Record views

21

Files downloads

14