Scheduling Driven Partitioning of Heterogeneous Embedded Systems
Swedish Workshop on Computer Systems Architecture, pp. 99-102, 1998.
In this paper we present an algorithm for system level hardware/software partitioning of heterogeneous embedded systems. The system is represented as an abstract graph which captures both data-flow and the flow of control. Given an architecture consisting of several processors, ASICs and shared busses, our partitioning algorithm finds the partitioning with the smallest hardware cost and is able to predict and guarantee the performance of the system in terms of worst case delay.
|dsa98.pdf||Adobe Acrobat portable document|
|dsa98.ps.gz||postscript document, compressed (with gzip)|
[PEP98] Paul Pop, Petru Eles, Zebo Peng, "Scheduling Driven Partitioning of Heterogeneous Embedded Systems", Swedish Workshop on Computer Systems Architecture, pp. 99-102, 1998.