Communications of the ACM - Special section on computer architecture
The connection machine
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Optimal broadcasting on SIMD hypercubes without indirect addressing capability
Journal of Parallel and Distributed Computing
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Optimal communication primitives and graph embeddings on hypercubes
Optimal communication primitives and graph embeddings on hypercubes
Traffic Analysis and Simulation Performance of Incomplete Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Techniques for pipelined broadcast on ethernet switched clusters
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
Optimal broadcast for fully connected networks
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
| Hi-index | 14.98 |
Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0or=kn. The broadcasting algorithm is strictly optimal.