Static Scheduling of Dataflow Process Networks
This tool offers algorithms for static scheduling of dataflow process networks. The DPN should be described as an equation system where each equation should be written in one line separated by newline characters or ";". Each equation should be of the form (y1:p1,...,yM:pM) = f(x1:c1,...,xN:cN) where yi and xi are the names of the output and input buffers of process node f and pi and ci are the numbers of tokens produced and consumed from these whenever node f fires. You can specify a static DPN by using positive integers for all pi and ci and cyclo-static DPNs by using sequences of positive integers that should be separated by ":"
Note that every buffer must have no more than one producer and consumer node, but we allow input and output buffers that have no producer/consumer nodes. Also, we allow nodes that do not read any input buffers and do not write to any output buffers. Finally, the first equation is special, it is not a process node; instead, it defines the initial configuration of the DPN (buffers not assigned there are assumed to hold zero tokens at initial time). Here are some examples.