A Matrix Formalism for Asynchronous Implementation of Algorithms

Authors:
A. Thayse
Affiliations:
Philips Research Laboratory
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 7
Cited 2

Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

Journal of the ACM (JACM)
Petri Nets

ACM Computing Surveys (CSUR)
Digital Systems with Algorithm Implementation

Digital Systems with Algorithm Implementation
Synthesis and Optimization of Programs by Means of P-Functions

IEEE Transactions on Computers
Binary Decision Diagrams

IEEE Transactions on Computers
Synthesis of Minimal Binary Decision Trees

IEEE Transactions on Computers
Parallel program schemata

Journal of Computer and System Sciences

Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity

IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

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.