A Partition Scheduler Model for Dynamic Dataflow Programs

M. Michalska, E. Bezati, S. Casale-Brunet, M. Mattavelli
2016 Procedia Computer Science  
The definition of an efficient scheduling policy is an important, difficult and open design problem for the implementation of applications based on dynamic dataflow programs for which optimal closed-form solutions do not exist. This paper describes an approach based on the study of the execution of a dynamic dataflow program on a target architecture with different scheduling policies. The method is based on a representation of the execution of a dataflow program with the associated
more » ... ciated dependencies, and on the cost of using scheduling policy, expressed as a number of conditions that need to be verified to have a successful execution within each partition. The relation between the potential gain of the overall execution satisfying intrinsic data dependencies and the runtime cost of finding an admissible schedule is a key issue to find close-to-optimal solutions for the scheduling problem of dynamic dataflow applications.
doi:10.1016/j.procs.2016.05.415 fatcat:atdfzsyiezfkdmurn5jbi2t3ga