Implementation of Deadlock Analysis in Data Flow Graphs
Bruce Brocka · Journal of Information and Optimization Sciences · 1992
When resources compete a deadlock situation can occur in which the process or graph is stymied and unable to produce any meaningful output. This paper discusses the deadlock situation as it applies to data flow graphs, particularly those graphs leading to a high level synthesis of a VLSI design, although the results are applicable to virtually any application, given the constraints on the inputs values and node functions.