Topic: data flow machines

topics > computer science > computer hardware > Group: machine model

actor machines
asynchronous processing
communicating sequential processes
computer architecture
data flow languages
message queues for communication
models of parallel computation
multiple processors
Petri net
program execution
task scheduling


A data flow machines provides an alternative to von Neumann style computers. It consists of a large number of independent processors connected by data links in a graph. Each processor waits for valid data on its inputs, executes its function, posts data on its outputs, and waits for acknowledgement. Since multiple processors are used, the program executes at the highest rate possible.

Advantages-- An emphasis on data allows a declarative program representation. Data flow provides a framework for multiple processors, but success has been limited by expensive data paths and multiple synchronization signals. (cbb 5/80)

Subtopic: data structures as machine up

Quote: an active data structure is a machine; the host controls the Connection Machine by telling the data (processor/memory) what to do [»hillWD_1985]

Subtopic: data flow machine up

Quote: in a data flow computer, processors execute an instruction when all data values arrive; sends results to destination processors [»ackeWB_1979]
Quote: at each snapshot, execute those actors with tokens at all inputs and no tokens at outputs [»dennJB_1974, OK]
QuoteRef: seedH_1971 ;;66 calculations occur when right combination or literals
QuoteRef: dennJB_1974 ;;362 "In a data flow representation, execution of a test or operation is enabled by availability of the required values
QuoteRef: dennJB_1974 ;;364 input and output links and actors between
QuoteRef: dennJB_1974 ;;364 links are typed as control arcs (true or false) and date arcs (integer real or string)
QuoteRef: kosiPR9_1973 ;;90 DFPL program consists of function nodes (primitive or defined) and data paths of any type of data
QuoteRef: kuznOP6_1972 ;;state transition (asynchronous diagrams split into blocks with input and output constraints

Subtopic: DDM1 up

Quote: a data-flow nets of DDM1 do not distinguish between control tokens and data tokens [»daviAL_1979]
Quote: the DDM1 data flow machine consists of asynchronous processor-store elements that communicate by messages; elements may contain sub-elements [»daviAL_1979]
Quote: the DDM1 data flow machine can distribute concurrent subnets to subelements of a process-store element [»daviAL_1979]

Subtopic: deadlocks up

Quote: can avoid deadlocks with a data-driven network; every message includes work to be done, a process must reduce the work remaining [»dennPJ_1980]

Subtopic: flow control up

Quote: TCP should have had flow control of both packets and bytes; extra complexity worth the added support for services; e.g., ARPANET

Related Topics up

Topic: actor machines (2 items)
Topic: asynchronous processing (30 items)
Topic: communicating sequential processes (33 items)
Topic: computer architecture (46 items)
Topic: data flow languages (33 items)
Topic: message queues for communication (36 items)
Topic: models of parallel computation (33 items)
Topic: multiple processors (10 items)
Topic: Petri net (44 items)
Topic: program execution (8 items)
Topic: task scheduling
(49 items)

Updated barberCB 5/04
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.