IEICE TRANSACTIONS on transactions
An Improved Systolic Simulation of Simple SIMD Machines
Summary :
We show that, for any simple SIMD machine M with time complexity T(n), there exists a systolic array which can simulate M in T(n)+2n+O(1) steps. Our result is an improvement on the previous (2T(n)+3n+O(1))-step systolic simulation theorem.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E69-E No.12 pp.1275-1278
- Publication Date
- 1986/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Computer System
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroshi UMEO, "An Improved Systolic Simulation of Simple SIMD Machines" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 12, pp. 1275-1278, December 1986, doi: .
Abstract: We show that, for any simple SIMD machine M with time complexity T(n), there exists a systolic array which can simulate M in T(n)+2n+O(1) steps. Our result is an improvement on the previous (2T(n)+3n+O(1))-step systolic simulation theorem.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_12_1275/_p
Copy
@ARTICLE{e69-e_12_1275,
author={Hiroshi UMEO, },
journal={IEICE TRANSACTIONS on transactions},
title={An Improved Systolic Simulation of Simple SIMD Machines},
year={1986},
volume={E69-E},
number={12},
pages={1275-1278},
abstract={We show that, for any simple SIMD machine M with time complexity T(n), there exists a systolic array which can simulate M in T(n)+2n+O(1) steps. Our result is an improvement on the previous (2T(n)+3n+O(1))-step systolic simulation theorem.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - An Improved Systolic Simulation of Simple SIMD Machines
T2 - IEICE TRANSACTIONS on transactions
SP - 1275
EP - 1278
AU - Hiroshi UMEO
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1986
AB - We show that, for any simple SIMD machine M with time complexity T(n), there exists a systolic array which can simulate M in T(n)+2n+O(1) steps. Our result is an improvement on the previous (2T(n)+3n+O(1))-step systolic simulation theorem.
ER -
English
