Fjellborg, B. (1986). A Simulation Study of Four Binary Tree Structures. Technical Report LiTH-IDA-R-86-19, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: The binary tree is compared with three augmented interconnection structures: the completely linked, half ring, and full ring trees. Their relative performance is compared both with respect to random message exchange as well as for implementations of algorithms for Heapsort and adaptive numerical integration. For the completely linked tree, a fault-tolerant routing algorithm is tested. Execution time is taken as measure. A simulator for this purpose, written in Occam, is described.
CS Dept TR Overview