Efficiently Checking the Equivalence of Multistage Interconnection Networks

@inproceedings{Calamoneri2004EfficientlyCT,
  title={Efficiently Checking the Equivalence of Multistage Interconnection Networks},
  author={Tiziana Calamoneri and Annalisa Massini},
  year={2004}
}
In this paper we propose a new characterization for the topological equivalence of multistage interconnection networks (MINs). Then, we apply it both to stage MINs and to stage MINs. In the first case, we provide an algorithm for checking the equivalence with the Reverse Baseline running in time. In the second case, we give an algorithm running in time testing the equivalence of two MINs obtained as concatenation of two stage MINs, both equivalent to the Reverse Baseline. This result definitely… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

T

  • Y. Yeh
  • Feng: On a Class of Rearrangeable Networks, IEEE…
  • 1992
Highly Influential
6 Excerpts

A

  • T. Calamoneri
  • Massini: On the Rearrangeability of Multistage…
  • 1999
Highly Influential
3 Excerpts

J

  • Q. Hu, X. Shen
  • Yang: Topologies of Combined ( )-Stage…
  • 1997
Highly Influential
3 Excerpts

Interstage Correlation in a Class of Multistage Interconnection

  • T. Feng, Y. Kim, S. SEO
  • Int. Computer Symp,
  • 1994
1 Excerpt

A

  • S. Even
  • Litman: Layered Cross Product - A technique to…
  • 1992

Interstage Correlation in a Class of Multistage Interconnection Networks

  • Y. Kim, S. SEO
  • On a Class of Rearrangeable Networks , IEEE Trans…
  • 1992

On the Rearrangeability of -Stage Permutation Networks

  • K. Y. Lee
  • IEEE Trans. Comput.,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…