Pregled bibliografske jedinice broj: 294992
A Binary-Constraint Search Algorithm for Minimizing Hardware during Hardware/Software Partitioning
A Binary-Constraint Search Algorithm for Minimizing Hardware during Hardware/Software Partitioning // European Design Automation Conference - Proceedings
Grenoble, Francuska: Institute of Electrical and Electronics Engineers (IEEE), 1994. str. 214-219 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 294992 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Binary-Constraint Search Algorithm for Minimizing Hardware during Hardware/Software Partitioning
Autori
Vahid, Frank ; Gong, Jie ; Gajski, Daniel D.
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
European Design Automation Conference - Proceedings
/ - : Institute of Electrical and Electronics Engineers (IEEE), 1994, 214-219
Skup
European Design Automation Conference
Mjesto i datum
Grenoble, Francuska, 19.09.1994. - 23.09.1994
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Hradware/software functioning; high-level estimation
Sažetak
Hardware/software partitioning is a key issue in the design of embedded systems when performance constraints have to be met and chip area and/or power dissipation are critical. For that reason, diverse approaches to automatic hardware/software partitioning have been proposed since the early 1990s. In all approaches so far, the granularity during partitioning is fixed, i.e., either small system parts (e.g., base blocks) or large system parts (e.g., whole functions/processes) can be swapped at once during partitioning in order to find the best hardware/software tradeoff. Since the deployment of a fixed granularity is likely to result in suboptimum solutions, we present the first approach that features a flexible granularity during hardware/software partitioning. Our approach is comprehensive in so far that the estimation techniques, our multigranularity performance estimation technique described here in detail, that control partitioning, are adapted to the flexible partitioning granularity. In addition, our multilevel objective function is described. It allows us to tradeoff various design constraints/goals (performance/hardware area) against each other. As a result, our approach is applicable to a wider range of applications than approaches with a fixed granularity. We also show that our approach is fast and that the obtained hardware/software partitions are much more efficient (in terms of hardware effort, for example) than in cases where a fixed granularity is deployed.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
Profili:
Daniel Gajski
(autor)