Year: 1969
Type: article
Abstract: This report presents a computational model called program graphs which makes possible a precise description of parallel computations of arbitrary complexity on non-structured data. In the model, the computation steps are represented by the nodes of a directed graph whose links represent elements of storage and transmission of data and /or control information.
Authors: J. E. Rodrigues, Jorge E Rodriguez Bezos
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2169608281