Network Algebra for Asynchronous Dataflow∗
نویسنده
چکیده
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic properties of networks. For asynchronous dataflow networks, additional constants and axioms are given; and a corresponding process algebra model is introduced. This process algebra model is compared with previous models for asynchronous dataflow.
منابع مشابه
Network Algebra for Synchronous and Asynchronous Dataflow
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic properties of networks. For synchronous and asynchronous dataflow networks, additional constants and axioms for conn...
متن کاملA Generalized Kahn Principle for Abstract Asynchronous Networks
Our general motivation is to answer the question: “What is a model of concurrent computation?”. As a preliminary exercise, we study dataflow networks. We develop a very general notion of model for asynchronous networks. The “Kahn Principle”, which states that a network built from functional nodes is the least fixpoint of a system of equations associated with the network, has become a benchmark ...
متن کامل∆-dataflow Networks for Event Stream Processing
We present a design of a new class of dataflow-like networks suitable for detecting complex conditions in systems in which parameters change rapidly. Such networks are helpful for detecting conditions that signal threats or opportunities in areas such as logistics, finance, and public health. Examples of such applications are detection of money laundering, epidemics, and unauthorized intrusion ...
متن کاملNetwork algebra for synchronous dataflow
We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of networks, called BNA (Basic Network Algebra), is introduced. This theory captures the basic algebraic properties of networks. For synchronous dataflow networks, it is subsequently extended with additional constants for the branching connections that occur between the cells of synchronous dataflow...
متن کاملPerformance issues in dataflow machines
Issues affecting the performance of dataflow computers at the machine and language levels are explored. It is suggested that performance is dictated by the nature and the means of identification, distribution and control of workload in the hardware system. Dataflow is an asynchronous concurrent notation based on fine-grain message-passing in graphical programs. Dataflow machines comprise multip...
متن کامل