Distributing Hot-Spot Addressing in Large-Scale Multiprocessors
IEEE Transactions on Computers
Designing broadcasting algorithms in the postal model for message-passing systems
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Concrete Math
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal Multicast with Packetization and Network Interface Support
ICPP '97 Proceedings of the international Conference on Parallel Processing
Architecture-Dependent Tuning of the Parameterized Communication Model for Optimal Multicasting
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Elements of discrete mathematics (McGraw-Hill computer science series)
Elements of discrete mathematics (McGraw-Hill computer science series)
Note: Fibonacci (p, r)-cubes which are median graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
The postal network is an interconnection network that possesses many desirable properties in networking applications. It includes hypercubes and Fibonacci cubes as its special cases. Basically, the postal network forms a series (with series number λ) that is based on the sequence Nλ(n)=Nλ(n−1)+Nλ(n−λ), where n is the dimension and Nλ(n) represents the number of nodes in an n-dimensional postal network in series λ. In this paper, we study topological properties of postal networks and relationships between different postal networks. One application of postal networks is also shown in implementing barrier synchronization using a special spanning tree called a postal tree. The postal network can also be considered as a flexible version of the hypercube by relaxing the restriction on the number of nodes, and hence, makes it possible to construct multicomputers with arbitrary sizes.