Operand processing and P-single operators

Abstract

The data flow model of execution offers attractive properties for parallel processing. First, it is asynchronous: Because the readiness of data dictates the instruction execution. Second, it is self-scheduling: The data flow graph representation of a program eliminates the need to explicitly manage parallel execution. The architecture described in this article belongs to a class of dynamic dataflow architectures, in which the operand process control significantly affects the performance parameters as well as the system characteristics of the given architecture.