Communications of the ACM - Special issue on parallelism
Topological Properties of Hypercubes
IEEE Transactions on Computers
A recursively scalable network VLSI implementation
Future Generation Computer Systems
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
Looking toward Exascale Computing
PDCAT '08 Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Blue Gene/L torus interconnection network
IBM Journal of Research and Development
| Hi-index | 0.00 |
In this paper, we propose an efficient algorithm for parallel prefix computation in recursive dual-net, a newly proposed network The recursive dual-net RDNk(B) for k0 has ${(2n_0)^{2^k}/2}$ nodes and d0+k links per node, where n0 and d0 are the number of nodes and the node-degree of the base network B, respectively Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation in RDNk(B), k0, are ${2^{k+1}-2+2^k*T_{comm}(0)}$ and ${2^{k+1}-2+2^k*T_{comp}(0)}$, respectively, where Tcomm(0) and Tcomp(0) are the communication and computation time complexities of the algorithm for parallel prefix computation in the base network B, respectively.