Maximum Finding on One-Way Mesh-Connected Computers with Multiple Buses
Summary :
This paper describes the relation between the structure and the capability on mesh-connected computers with orthogonal broadcasting. It is shown that algorithms of maximum finding for the two-way communication model can be performed on the one-way communication model without increasing the time complexity.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.6 pp.1076-1079
- Publication Date
- 1997/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section of Papers Selected from 1996 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC'96))
- Category
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
Noritaka SHIGEI, Hiromi MIYAJIMA, Sadayuki MURASHIMA, "Maximum Finding on One-Way Mesh-Connected Computers with Multiple Buses" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 6, pp. 1076-1079, June 1997, doi: .
Abstract: This paper describes the relation between the structure and the capability on mesh-connected computers with orthogonal broadcasting. It is shown that algorithms of maximum finding for the two-way communication model can be performed on the one-way communication model without increasing the time complexity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_6_1076/_p
Copy
@ARTICLE{e80-a_6_1076,
author={Noritaka SHIGEI, Hiromi MIYAJIMA, Sadayuki MURASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Maximum Finding on One-Way Mesh-Connected Computers with Multiple Buses},
year={1997},
volume={E80-A},
number={6},
pages={1076-1079},
abstract={This paper describes the relation between the structure and the capability on mesh-connected computers with orthogonal broadcasting. It is shown that algorithms of maximum finding for the two-way communication model can be performed on the one-way communication model without increasing the time complexity.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Maximum Finding on One-Way Mesh-Connected Computers with Multiple Buses
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1076
EP - 1079
AU - Noritaka SHIGEI
AU - Hiromi MIYAJIMA
AU - Sadayuki MURASHIMA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1997
AB - This paper describes the relation between the structure and the capability on mesh-connected computers with orthogonal broadcasting. It is shown that algorithms of maximum finding for the two-way communication model can be performed on the one-way communication model without increasing the time complexity.
ER -
English
