Pipelining a combinational logic data-path without introducing pipeline stage delay imbalance is a key requirement for efficient digital processing. Balanced pipelining is easily achieved by simple logical effort optimisation when the interconnect and fan-out delay overhead is small and homogeneously distributed. When the target microarchitecture design includes isolated long interconnects, such as buses, optimal pipeline stage balancing becomes a tricky problem. This work formalises the solution based on the logical effort paradigm and evidences its advantage with respect to a heuristic approach.
Optimal pipeline stage balancing in the presence of large isolated interconnect delay / Olivieri, Mauro; Menichelli, Francesco; Mastrandrea, Antonio. - In: ELECTRONICS LETTERS. - ISSN 0013-5194. - 53:4(2017), pp. 229-231. [10.1049/el.2016.4262]
Optimal pipeline stage balancing in the presence of large isolated interconnect delay
OLIVIERI, Mauro;MENICHELLI, FRANCESCO;MASTRANDREA, ANTONIO
2017
Abstract
Pipelining a combinational logic data-path without introducing pipeline stage delay imbalance is a key requirement for efficient digital processing. Balanced pipelining is easily achieved by simple logical effort optimisation when the interconnect and fan-out delay overhead is small and homogeneously distributed. When the target microarchitecture design includes isolated long interconnects, such as buses, optimal pipeline stage balancing becomes a tricky problem. This work formalises the solution based on the logical effort paradigm and evidences its advantage with respect to a heuristic approach.File | Dimensione | Formato | |
---|---|---|---|
Olivieri_Optimal-pipeline_2017.pdf
solo gestori archivio
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Altra licenza (allegare)
Dimensione
263.9 kB
Formato
Adobe PDF
|
263.9 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.