Talks and Poster Presentations (with Proceedings-Entry):

B. Knerr, M. Holzer, M. Rupp:
"Improvements Of The Gclp Algorithm For Hw/sw Partitioning Of Task Graphs";
Talk: Circuits, Systems and Signal Processing, San Francisco, CA, USA; 11-20-2006 - 11-22-2006; in: "Proceedings of the 4th IASTED International Conference on Circuits, Systems, and Signals", (2006), ISBN: 0-88986-607-4; 107 - 113.

English abstract:
HW/SW partitioning of modern heterogeneous systems, which combine signal processing as well as multimedia applications, is usually performed on a task or process graph representation. As this optimisation problem is known to be NP-hard, existing partitioning techniques rely on heuristic methods to traverse the vast search space. The Global Criticality/Local Phase (GCLP) algorithm, initially introduced by Kalavade and Lee as an integral part of the Ptolemy work suite, has been frequently referred to as fast and powerful technique to generate high quality solutions for a combined partitioning/scheduling problem. In this work the internal mechanisms of the GCLP algorithm have been thoroughly analysed and several modifications are proposed that lead either to a significant increase of the quality of the obtained solutions without affecting the computation time of the algorithm or to a substantially lower computation time while increasing the output of valid partitioning solutions.

Online library catalogue of the TU Vienna:

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.