Abstract
In MIMD (Multiple Instruction stream. Multiple Data stream) execution, each processor has its awn state. Although these states are generally considered to be independent entities, it is also possible to view the set of processor states at a particular time as single, aggregate, "Meta State." Once a program has been converted into a single finite automaton based on Meta States, only a single program counter is needed. Hence, it is possible to duplicate the MIMD execution using SIMD (Single Instruction stream, Multiple Data stream) hardware without the overhead of interpretation or even of having each processing element keep a copy of the MIMD code. In this paper, we present an algorithm for Meta-State Conversion (MSC) and explore some properties of the technique.
Original language | English |
---|---|
Article number | 4134184 |
Pages (from-to) | 47-56 |
Number of pages | 10 |
Journal | Proceedings of the International Conference on Parallel Processing |
Volume | 2 |
DOIs | |
State | Published - 1993 |
Event | 1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States Duration: Aug 16 1993 → Aug 20 1993 |
Bibliographical note
Publisher Copyright:© 1993 IEEE.
ASJC Scopus subject areas
- Software
- General Mathematics
- Hardware and Architecture