Conditional scheduling for embedded systems using genetic list scheduling

Authors:
Martin Grajcar
Affiliations:
University of Passau, Chair of Computer Architectures, grajcar@lrs.uni-passau.de
Venue:
ISSS '00 Proceedings of the 13th international symposium on System synthesis
Year:
2000

Citing 7
Cited 2

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
A unified approach for scheduling and allocation

Integration, the VLSI Journal
Genetic list scheduling algorithm for scheduling and allocation on a loosely coupled heterogeneous multiprocessor system

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Scheduling of conditional process graphs for the synthesis of embedded systems

Proceedings of the conference on Design, automation and test in Europe
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Design of an Optimal Loosely Coupled Heterogeneous Multiprocessor System

EDTC '96 Proceedings of the 1996 European conference on Design and Test

Improving security for periodic tasks in embedded systems through scheduling

ACM Transactions on Embedded Computing Systems (TECS)
Soft computing techniques for issues in existing RFID systems

ICCC'11 Proceedings of the 2011 international conference on Computers and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One important part of a HW/SW codesign system is the scheduler which is needed in order to determine if a given HW/SW partitioning is suitable for a given application. In this paper, we employ a dataflow model for scheduling a computation including conditional branches on a loosely coupled heterogeneous multiprocessor system. The goal is to minimize the worst-case makespan while satisfying constraints implied by data dependencies and exclusive resource usage.We present a formal model which allows multiple schedule optimizations and a new efficient heuristic approach based on genetic algorithms and list scheduling.