Topological Properties of Hypercubes
IEEE Transactions on Computers
Spanning Multiaccess Channel Hypercube Computer Interconnection
IEEE Transactions on Computers
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Sorting on PRAMs with reconfigurable buses
Information Processing Letters
On Crossbar Switch and Multiple Bus Interconnection Networks with Overlapping Connectivity
IEEE Transactions on Computers
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Adaptive fault-tolerant multicast in hypercube multicomputers
Journal of Parallel and Distributed Computing
On the construction of fault-tolerant Cube-Connected Cycles networks
Journal of Parallel and Distributed Computing
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
Routing with locality on meshes with buses
Journal of Parallel and Distributed Computing
A Fault-Tolerant Tree Communication Scheme for Hypercube Systems
IEEE Transactions on Computers
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
TDM hypercube and TWDM mesh optical interconnections
Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Hypercube Multiprocessors with Bus Connections for Improving Communication Performance
IEEE Transactions on Computers
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Bused Hypercubes and Other Pin-Optimal Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
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
Performance and Architectural Features of Segmented Multiple Bus System
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Network load-aware content distribution in overlay networks
Computer Communications
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we study the properties of the bus-based hypercube, denoted as U(n,b), which is a kind of multiple-bus networks (MBN). U(n,b) consists of 2^{n} processors and 2^{b} buses, where 0\leq b\leq n-1, and each processor is connected to either \lceil{\frac{b+2}{2}}\rceil or \lceil{\frac{b+1}{2}}\rceil buses. We show that the diameter of U(n,b) is \lceil{\frac{b+1}{2}}\rceil if b\geq2. We also present an algorithm to select the best neighbor processor via which we can obtain one shortest routing path. In U(n,b), we show that if there exist some faults, the fault diameter DF(n,b,f)\leq b+1, where f is the sum of bus faults and processor faults and 0\leq f\leq\lceil{\frac{b-3}{2}}\rceil. Furthermore, we also show that the bus-fault diameter DB(n,b,f)\leq\lfloor{\frac{b}{2}}\rfloor+3, where 0\leq f\leq\lceil{\frac{b-1}{2}}\rceil and f is the number of bus faults. These results improve significantly the previous result that DB(n,b,f)\leq b+2f+1, where f is the number of bus faults.