Fast Rescheduling of Multi-Rate Systems for HW/SW Partitioning Algorithms

Knerr, B.; Hölzer, Martin; Rupp, Markus

doi:10.1109/acssc.2005.1599989

Cited by 3 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On any DSP, bus, or memory, a simple collision arbitration is applied: earliest job first. More sophisticated schemes have already been evaluated [23], [24], but are not in the scope of this paper.…”

Section: System Partitioningmentioning

confidence: 99%

Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem

Knerr

Hölzer

Rupp

2007

2007 International Symposium on Industrial Embedded Systems

View full text Add to dashboard Cite

Abstract-The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to the rampant growth and shortening design cycles in wireless embedded systems, a multitude of formulations for this problem has emerged. Accordingly, a similar multitude can be found in the number of strategies that address system partitioning. A large proportion of the applied strategies utilise the concept of genetic algorithms, or, when based on different strategies, usually compare themselves to standard implementations of genetic algorithms. In this work, the internal mechanisms of this optimisation technique are thoroughly investigated and severe shortcomings of standard implementations are identified. Beneficial observations are made with respect to chromosome coding and mutation dedicated to typical problem graphs revealing a significant impact on the obtained solution quality. New problem oriented codings and operators are introduced and their performance is demonstrated on a task graph set of relevant process graphs. Finally, the modified genetic algorithm competes against Wiangtong's tabu search, Axelsson's simulated annealing, and Kalavade's GCLP algorithm.

show abstract

Section: System Partitioningmentioning

confidence: 99%

Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem

Knerr

Hölzer

Rupp

2007

2007 International Symposium on Industrial Embedded Systems

View full text Add to dashboard Cite

show abstract

“…The design space exploration, i.e. architecture selection interacting with hw/sw partitioning [16] and floating-point to fixed-point conversion [4], has decomposed the algorithmic description into a process graph, analysed interprocess communication and flagged the processes to be implemented preferably in either HW or SW. At the backend of this procedure, when the target architecture with one or even more processor cores is the favoured solution, the processor selection starts. At this stage parts of the design, i.e.…”

Section: Introductionmentioning

confidence: 99%

Task Scheduling for Power Optimisation of Multi Frequency Synchronous Data Flow Graphs

Knerr¹,

Holzer²,

Rupp³

2005

2005 18th Symposium on Integrated Circuits and Systems Design

View full text Add to dashboard Cite

During recent years power optimisation has become one of the most challenging design goals in modern communication systems, particularly in the wireless domain. Many different approaches for task scheduling on single or multi-core systems exist, mostly addressing the minimisation of execution time or the number of processors used. The minimisation of the processor's clock frequency by adjusting the supply voltage or directly by frequency scaling according to the chosen task scheduling has shown good results in the reduction of power consumption. Most of the known approaches base their core algorithms on graph representations for multirate systems or synchronous data flow (SDF) graphs, in a single frequency domain. In many cases a signal processing system comprises several frequency domains, in which processes have to be fired according to their in-and output data rates as well as to their frequency domain. In this work the superposition of frequency domains and data dependencies is incorporated into the optimisation process and used as a another degree of freedom. Several algorithms have been implemented and evaluated to minimise the required processor's clock frequency, including a greedy, a simulated annealing, as well as a tabu search approach.

show abstract