Compile-time scheduling of dynamic constructs in dataflow program graphs

@article{citeulike:882808, abstract = {Scheduling dataflow graphs onto processors consists of assigning actors to processors, ordering their execution within the processors, and specifying their firing time. While all scheduling decisions can be made at runtime, the overhead is excessive for most real systems. To reduce this overhead, compile-time decisions can be made for assigning and/or ordering actors on processors. Compile-time decisions are based on known profiles available for each actor at compile time. The profile of an actor is the information necessary for scheduling, such as the execution time and the communication patterns. However, a dynamic construct within a macro actor, such as a conditional and a data-dependent iteration, makes the profile of the actor unpredictable at compile time. For those constructs, we propose to assume some profile at compile-time and define a cost to be minimized when deciding on the profile under the assumption that the runtime statistics are available at compile-time. Our decisions on the profiles of dynamic constructs are shown to be optimal under some bold assumptions, and expected to be near-optimal in most cases. The proposed scheduling technique has been implemented as one of the rapid prototyping facilities in Ptolemy. This paper presents the preliminary results on the performance with synthetic examples}, author = {Ha, S. and Lee, E. A. }, citeulike-article-id = {882808}, journal = {Computers, IEEE Transactions on}, keywords = {scheduling, sdf}, number = {7}, pages = {768--778}, posted-at = {2006-10-03 20:03:40}, priority = {2}, title = {Compile-time scheduling of dynamic constructs in dataflow program graphs}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=599897}, volume = {46}, year = {1997} }

TY - JOUR ID - citeulike:882808 L3 - citeulike-article-id:882808 N2 - Scheduling dataflow graphs onto processors consists of assigning actors to processors, ordering their execution within the processors, and specifying their firing time. While all scheduling decisions can be made at runtime, the overhead is excessive for most real systems. To reduce this overhead, compile-time decisions can be made for assigning and/or ordering actors on processors. Compile-time decisions are based on known profiles available for each actor at compile time. The profile of an actor is the information necessary for scheduling, such as the execution time and the communication patterns. However, a dynamic construct within a macro actor, such as a conditional and a data-dependent iteration, makes the profile of the actor unpredictable at compile time. For those constructs, we propose to assume some profile at compile-time and define a cost to be minimized when deciding on the profile under the assumption that the runtime statistics are available at compile-time. Our decisions on the profiles of dynamic constructs are shown to be optimal under some bold assumptions, and expected to be near-optimal in most cases. The proposed scheduling technique has been implemented as one of the rapid prototyping facilities in Ptolemy. This paper presents the preliminary results on the performance with synthetic examples IS - 7 JF - Computers, IEEE Transactions on EP - 778 TI - Compile-time scheduling of dynamic constructs in dataflow program graphs VL - 46 SP - 768 KW - scheduling KW - sdf AU - Ha, S AU - Lee, EA PY - 1997/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=599897 ER -