Copy
Masaharu IMAI, "A Double-Tree Structured Multicomputer System and Its Application to Combinatorial Problems" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 9, pp. 1002-1010, September 1986, doi: .
Abstract: In this paper, a combinatorial problem oriented multicomputer system called DON (Double-Tree Structured Network Machine) is proposed. And a parallel branch-and-bound program scheme for the DON system is described. The DON system is composed of two binary-tree structured subsystems and a system controller. The DON system works as a post-end processor of a host computer system. The DON system is designed to achieve high parallelism and efficient pipeline ability. One of the most distinctive features of the DON system, compared to a conventional single-tree machine, is that the algorithms with pipeline features can be easily implemented and executed more efficiently. From the experimental results through simulation, it appears that the DON system can solve large scale combinatorial problems more efficiently than a conventional single-tree machine.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_9_1002/_p
Copy
@ARTICLE{e69-e_9_1002,
author={Masaharu IMAI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Double-Tree Structured Multicomputer System and Its Application to Combinatorial Problems},
year={1986},
volume={E69-E},
number={9},
pages={1002-1010},
abstract={In this paper, a combinatorial problem oriented multicomputer system called DON (Double-Tree Structured Network Machine) is proposed. And a parallel branch-and-bound program scheme for the DON system is described. The DON system is composed of two binary-tree structured subsystems and a system controller. The DON system works as a post-end processor of a host computer system. The DON system is designed to achieve high parallelism and efficient pipeline ability. One of the most distinctive features of the DON system, compared to a conventional single-tree machine, is that the algorithms with pipeline features can be easily implemented and executed more efficiently. From the experimental results through simulation, it appears that the DON system can solve large scale combinatorial problems more efficiently than a conventional single-tree machine.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Double-Tree Structured Multicomputer System and Its Application to Combinatorial Problems
T2 - IEICE TRANSACTIONS on transactions
SP - 1002
EP - 1010
AU - Masaharu IMAI
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 9
JA - IEICE TRANSACTIONS on transactions
Y1 - September 1986
AB - In this paper, a combinatorial problem oriented multicomputer system called DON (Double-Tree Structured Network Machine) is proposed. And a parallel branch-and-bound program scheme for the DON system is described. The DON system is composed of two binary-tree structured subsystems and a system controller. The DON system works as a post-end processor of a host computer system. The DON system is designed to achieve high parallelism and efficient pipeline ability. One of the most distinctive features of the DON system, compared to a conventional single-tree machine, is that the algorithms with pipeline features can be easily implemented and executed more efficiently. From the experimental results through simulation, it appears that the DON system can solve large scale combinatorial problems more efficiently than a conventional single-tree machine.
ER -