Lower bounds on the loading of degree-2 multiple bus networks for binary-tree algorithms
Document Type
Article
Publication Date
1-1-1999
Abstract
A binary-tree algorithm, Bin(n), proceeds level-by-level from the leaves of a 2n-leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on multiple bus networks (MBNs) in which processors communicate via buses. Every `binary-tree MBN' has a degree (maximum number of buses connected to a processor) of at least 2. There exists a degree-2 MBN for Bin(n) that has a specified loading (maximum number of processors connected to a bus). For any MBN that runs Bin(n) optimally, the loading was recently proved to be Ω(n 1/2 ). In this paper, we narrow the gap between the results in [3, 15] by deriving a tighter lower bound of Ω(n2/3). We also establish a tradeoff between the speed and loading of degree-2 binary-tree MBNs.
Publication Source (Journal or Book title)
Proceedings of the International Parallel Processing Symposium, IPPS
First Page
21
Last Page
25
Recommended Citation
Dharmasena, H., & Vaidyanathan, R. (1999). Lower bounds on the loading of degree-2 multiple bus networks for binary-tree algorithms. Proceedings of the International Parallel Processing Symposium, IPPS, 21-25. Retrieved from https://repository.lsu.edu/eecs_pubs/1801