Hardware Synthesis is the process by which system-level, Register Transfer (RT) level or behavioral descriptions can be turned into real implementations, in terms of logic gates. Scheduling is one of the most time-consuming steps in the overall design flow, and may become much more complex when performing hardware synthesis from high-level specifications. Exploiting a single scheduling strategy on very large designs is often reductive and potentially inadequate. Furthermore, finding the “best” single candidate among all possible scheduling algorithms is practically infeasible. In this paper we introduce a hybrid scheduling approach, that is a preliminary step towards a comprehensive solution, not yet provided by industrial or by academic solutions. Our method relies on an abstract symbolic representation of data flow nodes (operations) bound to control flow paths: it produces a more realistic lower bound during the pre-scheduling resource estimation step and speeds up slower but accurate heuristic scheduling techniques, thus achieving a globally improved result.

Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques / Cabodi, Gianpiero; Lavagno, Luciano; Murciano, Marco; Kondratyev, A; Watanabe, Y.. - In: ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS. - ISSN 1084-4309. - 15:2(2010), pp. 12:1-12:34. [10.1145/1698759.1698762]

Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques

CABODI, Gianpiero;LAVAGNO, Luciano;MURCIANO, MARCO;
2010

Abstract

Hardware Synthesis is the process by which system-level, Register Transfer (RT) level or behavioral descriptions can be turned into real implementations, in terms of logic gates. Scheduling is one of the most time-consuming steps in the overall design flow, and may become much more complex when performing hardware synthesis from high-level specifications. Exploiting a single scheduling strategy on very large designs is often reductive and potentially inadequate. Furthermore, finding the “best” single candidate among all possible scheduling algorithms is practically infeasible. In this paper we introduce a hybrid scheduling approach, that is a preliminary step towards a comprehensive solution, not yet provided by industrial or by academic solutions. Our method relies on an abstract symbolic representation of data flow nodes (operations) bound to control flow paths: it produces a more realistic lower bound during the pre-scheduling resource estimation step and speeds up slower but accurate heuristic scheduling techniques, thus achieving a globally improved result.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
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/2318056
 Attenzione

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