A new hierarchy of hypercube interconnection schemes for parallel computers

@article{Lakshmivarahan1988ANH,
  title={A new hierarchy of hypercube interconnection schemes for parallel computers},
  author={S. Lakshmivarahan and Sudarshan K. Dhall},
  journal={The Journal of Supercomputing},
  year={1988},
  volume={2},
  pages={81-108}
}
This paper introduces a new hierarchy of cube-based interconnection schemes, called the base-b cube (which properly contains the well-known binary cube), for the design of parallel computers. This hierarchy admits a recursive definition and allows many more reconfigurations than are possible with the binary cube. Our analysis addresses the inherent cost-delay trade-off for this hierarchy along with a number of related topological properties such as sparsity, diameter, existence of node disjoint… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

54 Citations

0246'87'94'02'10'18
Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Data communications in hypercubes

Y. Saad, M. H. Schultz
Research Report DCS/RR-428 (Oct.), Yale University, New Haven, Conn. • 1985
View 3 Excerpts
Highly Influenced

Generalized Gray codes and their applications

L. Barasch, S Lakshmivarahan, S. K. Dhall
1987

A lower bound on the communication complexity in solving

S. Lakshmivarahan, S. K. Dhall
1986
View 1 Excerpt

A lower bound on the communication complexity in solving linear tridiagonal systems on a cube architecture

S. Lakshmivarahan, S. K. Dhall
Conference Proceedings - - The Second SIAM Conference on Hypercube Multiprocessors • 1986

Spanning graphs for optimum broadcasting and personalized commun

S. L. Johnsson, C. T. Ho
1986
View 2 Excerpts

Embeddings of communication trees and grids into hypercubes

J. E. Brandenberg, D. S. Scott
1985

How to embed trees in hypercubes

S. N. Bhatt, I.C.F. Ipsen
Research Report DCS-RR-443, Yale University, New Haven, Conn. • 1985