Constraint-based evaluation of hypergraph and graph networks

@article{OuldKhaoua1996ConstraintbasedEO,
  title={Constraint-based evaluation of hypergraph and graph networks},
  author={Mohamed Ould-Khaoua and Lewis M. Mackenzie and Rob J. Sutherland and Reza Sotudeh},
  journal={Simul. Pr. Theory},
  year={1996},
  volume={4},
  pages={119-140}
}
Most of the common direct multicomputer networks, such as the torus and binary n-cube, are based on graph topologies. This paper presents the results of a comparative analysis of these topologies with a new class of regular hypergraph topologies, called Distributed Crossbar Switch Hypermeshes (DCSHs). Taking into account relative implementation cost, the analysis considers the different channel bandwidth constraints which apply in different possible realisations, such as pure VSLI and multi… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Limits on interconnection network performance

  • A. Agrawal
  • IEEE Trans. Parallel Distrib. Systems
  • 1991
Highly Influential
7 Excerpts

The COBRA project : Alleviating the bandwidth constraints in large multicomputer networks

  • M. Ould-Khaoua, R. Sutherland, T. Kelly
  • Proceedings of the Supercomputing Symposium
  • 1991

Similar Papers

Loading similar papers…