Microprocessor-based design: a comprehensive guide to effective hardware design
Microprocessor-based design: a comprehensive guide to effective hardware design
Computer
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
Digital design: principles and practices (2nd ed.)
Digital design: principles and practices (2nd ed.)
Bus-based networks for fan-in and uniform hypercube algorithms
Parallel Computing
The bus-connected ringed tree: a versatile interconnection network
Journal of Parallel and Distributed Computing
On the power of segmenting and fusing buses
Journal of Parallel and Distributed Computing
Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems
IEEE Transactions on Computers
Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Easy-to-Use Approach for Practical Bus-Based System Design
IEEE Transactions on Computers
On a Lightwave Network Topology Using Kautz Digraphs
IEEE Transactions on Computers
An Improved Generalization of Mesh-Connected Computers with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
On the Complexity of Optimal Bused Interconnections
IEEE Transactions on Computers
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiple Bus Network for Fan-in Algorithms
ICPP '97 Proceedings of the international Conference on Parallel Processing
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Randomized Initialization Protocols for Packet Radio Networks
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
High Speed, High Capacity Bused Interconnects using Optical Slab Waveguides
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Reconfigurable Mesh on the Reconfigurable Tree Array
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 3
Multiple bus networks for binary-tree algorithms
Multiple bus networks for binary-tree algorithms
Dynamic Reconfiguration: Architectures and Algorithms (Series in Computer Science (Kluwer Academic/Plenum Publishers).)
Hypergraph partitioning with fixed vertices [VLSI CAD]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 14.98 |
A Multiple Bus Network (MBN) connects a set of processors via a set of buses. Two important parameters of an MBN are its loading (largest number of connections on a bus) and its degree (largest number of connections to a processor). These parameters determine the cost, speed, and implementability of the MBN. The smallest degree that any useful MBN can have is 2. In this paper, we study the relationship between running time, degree, and loading of degree-2 MBNs running a fundamental class of algorithms called binary tree algorithms. (A binary tree algorithm reduces 2^n inputs at the leaves of a balanced binary tree to a single result at the root of the tree.) Specifically, we establish a nontrivial \Omega({\frac{n}{\log n}}) loading lower bound for any degree-2 MBN running a 2^n input binary tree algorithm optimally in n steps. We show that this bound does not hold if the restriction on the degree or the running time is relaxed. That is, optimal-time, degree-3, constant loading MBNs and suboptimal-time, degree-2, constant loading MBNs exist for binary tree algorithms. We also derive a lower bound on the additional time (beyond the optimal) needed to run binary tree algorithms on a degree--2, loading-L MBN, for any L\ge 3.