An extensional treatment of dataflow deadlock
We discuss deadlock in reference to a simple equational dataflow language, and devise a test (the cycle sum test) which is applied to the dependency graph of a program. We use Kahn's extensional semantics of dataflow and give a purely extensional (non operational) proof that no program passing the cycle sum test can ever deadlock. The proof is based on the notions of size (length) and completeness in the domain of histories, and should extend to a much wider context.
Unable to display preview. Download preview PDF.
- 1.Arvind and Gostelow, Dataflow computer architecture: research and goals, technical report no. 113, Department of Information and Computer Science, University of California Irvine.Google Scholar
- 2.Ashcroft, E.A., and Wadge, W., Lucid, a nonprocedural language with iteration, CACM 20, no. 7, pp 519–526.Google Scholar
- 3.Davis, A.L., The architecture of DDM-1: a recursively structured data driven machine, report UUCS-77-113, Department of Computer Science, University of Utah.Google Scholar
- 4.Dennis, J.B., First version of a dataflow procedure language, MAC TM 61, MIT.Google Scholar
- 5.Faustini, A.A., The equivalence of the operational and extensional semantics of pure dataflow, Ph.D. (in preparation), University of Warwick, Coventry UK.Google Scholar
- 7.Kahn, G., The semantics of a simple language for parallel processing, IFIPS 74.Google Scholar
- 8.Kuratowski, K., Topologie (I), Warsaw (1958).Google Scholar