Premium
Parallel assignment revisited
Author(s) -
Welch P. H.
Publication year - 1983
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380131208
Subject(s) - programmer , computer science , von neumann architecture , expression (computer science) , algorithm , parallel computing , theoretical computer science , programming language
The concept of truly parallel assignment is retrieved from obscurity. It is shown to be a natural technique for the expression of iterative algorithms that saves the programmer from being concerned with some ‘low‐level’ details imposed by the von Neumann machine. With their use, algorithms should be simpler to write, clearer to understand and contain fewer errors. The concept of history as a means for achieving the same purpose is criticized on the grounds of the new side‐effects that it introduces. An implementation method for truly parallel assignment on a conventional computer is described.