A parallel binary tree traversal algorithm in Ada is analyzed, its performance profile is derived, and the optimal numbers of parallel processors to be used for the algorithm are determined.
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.
Copy
Zensho NAKAO, Takashi YOGI, "A Parallel Algorithm in Ada and Its Performance Profile" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 4, pp. 528-531, April 1990, doi: .
Abstract: A parallel binary tree traversal algorithm in Ada is analyzed, its performance profile is derived, and the optimal numbers of parallel processors to be used for the algorithm are determined.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_4_528/_p
Copy
@ARTICLE{e73-e_4_528,
author={Zensho NAKAO, Takashi YOGI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Parallel Algorithm in Ada and Its Performance Profile},
year={1990},
volume={E73-E},
number={4},
pages={528-531},
abstract={A parallel binary tree traversal algorithm in Ada is analyzed, its performance profile is derived, and the optimal numbers of parallel processors to be used for the algorithm are determined.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Parallel Algorithm in Ada and Its Performance Profile
T2 - IEICE TRANSACTIONS on transactions
SP - 528
EP - 531
AU - Zensho NAKAO
AU - Takashi YOGI
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1990
AB - A parallel binary tree traversal algorithm in Ada is analyzed, its performance profile is derived, and the optimal numbers of parallel processors to be used for the algorithm are determined.
ER -