Representation of process mode correlation for scheduling (1998) [15 citations — 8 self]
Abstract:
The specification of embedded systems very often contains a mixture of different models of computation. In particular, the data flow and control flow associated to the transformative and reactive domains, respectively, are tightly coupled. The paper considers classes of applications that feature communicating processes whose functions depend on a finite set of computation modes. The change between these modes is synchronized by data communication. An approach is presented to model the correlation of process modes and to fully utilize this information for scheduling. A modeling example shows the optimization potential of the new approach. 1
Citations
| 271 | Static scheduling of synchronous data flow programs for digital signal processing – Lee, Messerschmitt - 1987 |
| 164 | Dataflow process networks – Lee, Parks - 1995 |
| 36 | Predicting deterministic execution times of real-time programs – PARK - 1992 |
| 29 | Scheduling of conditional process graphs for the synthesis of embedded systems – Eles, Kuchcinski, et al. - 1998 |
| 19 | Combining multiple models of computation for scheduling and allocation – Ziegenbein, Ernst, et al. - 1998 |
| 16 | Compile-time scheduling of dynamic constructs in dataflow program graphs – Ha, Lee - 1997 |
| 2 | Modeling of an image transmission system with integrated profibus-slave – Richter - 1998 |
| 2 | et al. The imager for Mars Pathfinder experiment – Smith - 1997 |
| 2 | Optimization of MPEG-2 Video Encoding – Zhou - 1997 |

