Conditional scheduling for embedded systems using genetic list scheduling
暂无分享,去创建一个
One important part of a hardware/software (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.
[1] Armin Bender,et al. Design of an optimal loosely coupled heterogeneous multiprocessor system , 1996, Proceedings ED&TC European Design and Test Conference.
[2] Petru Eles,et al. Scheduling of conditional process graphs for the synthesis of embedded systems , 1998, DATE.
[3] Ishfaq Ahmad,et al. Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..