Scheduling is widely recognized as a very important step in high-level synthesis. Nevertheless, it is usually done without taking into account the effects on the actual hardware implementation. This paper presents an efficient symbolic technique to concurrently integrate operation scheduling and resource allocation. The technique inherits all the features of "standard" BDD-based control dominated scheduling, including resource-constraining, speculation and pruning. In addition, it introduces an efficient way of encoding allocation information within a symbolic scheduling automaton with a two-folded target. Firstly, it finds a minimum cost allocation of operation resources satisfying a given schedule. Secondly, it optimizes the amount of registers required to store intermediate results of operations. Theory and algorithms are developed and presented. Experimental results on a well known set of benchmarks show the potentiality of the approach.

A Symbolic Approach for the Combined Solution of Scheduling and Allocation / Cabodi, Gianpiero; Lavagno, Luciano; Lazarescu, MIHAI TEODOR; Nocco, Sergio; Passerone, Claudio; Quer, Stefano. - ELETTRONICO. - (2002), pp. 237-242. (Intervento presentato al convegno ISSS'02: ACM/IEEE International Symposium of System Synthesis tenutosi a Kyoto, Japan nel 2-4 ottobre 2002) [10.1145/581199.581252].

A Symbolic Approach for the Combined Solution of Scheduling and Allocation

CABODI, Gianpiero;LAVAGNO, Luciano;LAZARESCU, MIHAI TEODOR;NOCCO, SERGIO;PASSERONE, Claudio;QUER, Stefano
2002

Abstract

Scheduling is widely recognized as a very important step in high-level synthesis. Nevertheless, it is usually done without taking into account the effects on the actual hardware implementation. This paper presents an efficient symbolic technique to concurrently integrate operation scheduling and resource allocation. The technique inherits all the features of "standard" BDD-based control dominated scheduling, including resource-constraining, speculation and pruning. In addition, it introduces an efficient way of encoding allocation information within a symbolic scheduling automaton with a two-folded target. Firstly, it finds a minimum cost allocation of operation resources satisfying a given schedule. Secondly, it optimizes the amount of registers required to store intermediate results of operations. Theory and algorithms are developed and presented. Experimental results on a well known set of benchmarks show the potentiality of the approach.
2002
1-58113-576-9
File in questo prodotto:
File Dimensione Formato  
scheduling.pdf

accesso aperto

Descrizione: Main article
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 80.75 kB
Formato Adobe PDF
80.75 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/1500761
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo