2024-03-29T15:02:57Z
https://u-ryukyu.repo.nii.ac.jp/oai
oai:u-ryukyu.repo.nii.ac.jp:02001997
2022-02-14T21:20:29Z
1642837622505:1642837855274:1642837864543
1642838403551:1642838406845
On Parallel Tree Traverse in Ada
Nakao, Zensho
Takeuchi, Kazuo
Yogi, Takashi
仲尾, 善勝
Two new methods for parallel tree traverse are given, and their implementations are described and tested in Ada which supports parallel programming via Ada tasks. The simulations performed show that (1) when there are no restriction imposed on the number of Ada tasks, the amount of time required for the traverse remains constant (equaling a number related to the height of the tree) for varying number of tree nodes; (2) in case where a pre-assigned number of tasks are used, the traverse time varies inversely as the number of tasks.
紀要論文
http://purl.org/coar/resource_type/c_6501
琉球大学工学部
VoR
http://hdl.handle.net/20.500.12000/1979
0389-102X
AN0025048X
琉球大学工学部紀要
38
82
67
eng
open access