Abstract
In this chapter we describe the static data flow graph model as an operational model for concurrent computation. This model has evolved from a number of graph operational models for studying concurrent computation. Earlier models concentrated more on basic theoretical aspects, such as decidability properties of concurrent computations: deadlock, nondeterminacy, equivalence of program graphs, and expressive power for parallelism [7,76,109]. Later works were oriented toward operational models of practical programming languages designed for dataflow computers [14,29,42,38,123]. The static data flow graph model that originated from this research has provided the power to express most language features found in high-level programming languages, such as Val.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gao, G.R. (1991). The Static Data Flow Model. In: A Code Mapping Scheme for Dataflow Software Pipelining. The Kluwer International Series in Engineering and Computer Science, vol 125. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3988-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3988-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6782-6
Online ISBN: 978-1-4615-3988-9
eBook Packages: Springer Book Archive