ScholarLens Back to search
2011•Unpublished venueRequires access

Operand processing and P-single operators

Liberios Vokorokos, N. Adam, Branislav Madoš, E. Dankova

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Dataflow, Operand, Computer science, Dataflow architecture, Data-flow analysis, Asynchronous communication, Parallel computing, Control flow

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Operand processing and P-single operators — Research Paper | ScholarLens