A method of computing minimum firing time for self-cleaning SWITCH-less program nets

A program net is a graph representation of data-flow programs consisting of three types of nodes, AND-, OR- and SWITCH-nodes, which represent arithmetic/logical, data merge and context switch operations, respectively. Parallelism residing in data-flow programs has been studied through computing PARAdeg = ∑(f¯(zi)τi)T for SWITCH-less program nets, where f¯(zi) and τi are maximum firing number and single firing time of node zi, respectively and T is minimum firing time of the program net. The numerator of PARAdeg can be efficiently computed; however, computation of the denominator is usually costly in terms of time. In this paper, we propose algorithms to compute T by contracting AND-nodes for self-cleaning SWITCH-less program nets.