An automatic hardware-software partitioner based on the possibilistic programming
Ireneusz Karkowski, Ria Otten · 1996
The problem of hardware-software partitioning in the design of embedded systems is addressed. Uncertainties about the performance of the options for realization are expressed in triangular possibilistic numbers. To handle such numbers an integer programming formulation of the partitioning problem is derived. This formulation can be converted into a possibilistic program without changing the asymptotic computational complexity. The approach is illustrated with results obtained with the receiver part of a transceiver of a wireless indoor spread spectrum system. This example and several other experiments have shown that these optimizations can reach solutions within seconds for designs of that complexity and above. 1 Introduction In this context embedded systems are combinations of hardware with general purpose computational capabilities andmorededicated modules. Together they performa function carefully partitioned in software and hardware to obtain the optimum trade-offs between the v...