[Back]

B. Knerr, M. Holzer, M. Rupp:
"Fast Rescheduling of Multi-Rate Systems for HW/SW Partitioning Algorithms";
Talk: Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA; 10-30-2005 - 11-02-2005; in: "Proceedings of Thirty-Ninth Annual Asilomar Conference on Signals, Systems, and Computers", (2005), ISBN: 1-4244-0132-1; 1375 - 1379.

In modern designs for heterogeneous systems with their extreme requirements on power consumption, execution time, silicon area and time-to-market, the HW/SW partitioning problem belongs to the most challenging ones. Usually its formulation, based on task or process graphs with complex communication models, is intractable. Moreover most partitioning problems embed another NP-hard problem in its core: a huge number of valid schedules exist for a single partitioning solution. Powerful heuristics for the partitioning problem rely on list scheduling techniques to solve this scheduling problem. This paper is based on a rescheduling algorithm that performs better than popular list scheduling techniques and still preserves linear complexity by reusing former schedules. A sophisticated communication model is introduced and the rescheduling algorithm is modified to serve multi-core architectures with linear runtime.

http://publik.tuwien.ac.at/files/pub-et_10264.pdf