Data-Flow Hard Real-Time Programs: Scheduling Processors and Communication Channels in a Distributed Environment
Renzo Davoli, Fabio Tamburini · 1999
This work concentrates on periodic Data-Flow programs having Hard Real-Time constraints. They are represented by precedence DAGs, able to express control dependencies and communication flows among the composing nodes. A mathematical model to compute a feasible schedule is proposed, taking into account the exchanging of data between nodes using a deterministic transmission network. The model is then transformed into an optimization problem and a solution based on Simulated annealing technique is presented.