Implementation of Process Networks in Java

A process network, as described by G. Kahn, is a network of sequential processes connected by FIFO queues. Process networks, a generalization of dataflow graphs, are used extensively for representing signal processing algorithms. The requirement to run for long times with limited memory raises concerns about deadlocking and memory requirements. T. Parks gives an algorithm for executing a given process network forever in bounded memory, whenever possible. This algorithm depends on recognition of and response to deadlock conditions. We implemented this algorithm in Java and devised a new robust method for detecting deadlocks.