A Matrix Formalism for Asynchronous Implementation of Algorithms

We show that well-known instructions such as if then else, fork, join, while do, can be represented as row matrices or column-matrices. We define a matrix-instruction which encompasses and generalizes the above instructions. This instruction provides us with a compact tool for describing algorithms...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-33; no. 4; pp. 289 - 300
Main Author Thayse
Format Journal Article
LanguageEnglish
Published IEEE 01.04.1984
Subjects
Algorithmic state machine
Automata
Boolean functions
Computational modeling
Computers
factorization of Boolean matrices
Flowcharts
implementation of algorithms
microprogrammed structures
Nickel
P-functions
Petri nets
Switches
switching theory
Terminology
Vocabulary
Online AccessGet full text
ISSN0018-9340
1557-9956
DOI10.1109/TC.1984.1676434

Cover

More Information
Summary:We show that well-known instructions such as if then else, fork, join, while do, can be represented as row matrices or column-matrices. We define a matrix-instruction which encompasses and generalizes the above instructions. This instruction provides us with a compact tool for describing algorithms and for synthesizing them in synchronous and asynchronous structures. We show, e.g., that the synthesis of a program by means of elementary instructions reduces to the factorization of a matrix into elementary matrices. A formalism and a computation method are introduced which generalize the author's previous work on the subject.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1984.1676434