Talks and Poster Presentations (with Proceedings-Entry):

B. Knerr, M. Holzer, M. Rupp:
"Restricted Range Exhaustive Search: A New Heuristic for HW/SW Partitioning of Task Graphs";
Talk: Conference on Design of Circuits and Integrated Systems DCIS, Sevilla, Spanien; 11-21-2007 - 11-23-2007; in: "Proceedings XXII Conference on Design of Circuits and Integrated Systems", (2007), ISBN: 978-84690-8629-2; 241 - 246.

English abstract:
This paper presents a new deterministic algorithm
for the classical HW/SW partitioning problem, targeting a
common architecture model consisting of a microprocessor and a
set of ASIC blocks. The system to be partitioned is represented as
an acyclic task graph, for which a set of constraints on makespan,
area, and code size exist. The restricted range exhaustive search
algorithm is introduced that is well suited for the subset of human
made task graphs, since it exploits their typical characteristics
such as locality, sparsity, and their degree of parallelism. The performance
of the new algorithm is demonstrated in comparison to
a genetic algorithm, a tabu search, and the global criticality/local
phase algorithm.

System Partitioning, Scheduling, Task Graphs, Heuristics

Electronic version of the publication:

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