Applications of matching and edge-coloring algorithms to routing in clos networks-Reference-Cited by-同舟云学术

Applications of matching and edge-coloring algorithms to routing in clos networks

Published:1994-09 Issue:6 Volume:24 Page:319-326
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Carpinelli John D.,Oruc A. Yavuz

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference25 articles.

1. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York (1965).

2. Graphs and Hypergraphs. North-Holland, Amsterdam (1973).

3. Optical implementations of the perfect shuffle interconnection

4. Interconnection networks: Improved routing methods for Clos and Beneš networks. PhD. Thesis, Rensselaer Polytechnic Institute, Troy, NY, August 1987.

5. and , Parallel set-up algorithms for Clos networks using a tree-connected computer. Proceedings of the Second International Conference on Supercomputing. Santa Clara (1987) 321–327.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The number of rearrangements for Clos networks – new results;Theoretical Computer Science;2020-04

2. Optical multiplexing techniques for photonic Clos networks in High Performance Computing Architectures;The Journal of Supercomputing;2010-11-16

3. ALGORITHM-HARDWARE CODESIGN OF A FAST PARALLEL ROUTING ARCHITECTURE FOR CLOS NETWORKS;Journal of Interconnection Networks;2010-09

4. Improved edge-coloring with three colors;Theoretical Computer Science;2009-09

5. Optical Multiplexing Techniques for Photonic Clos Networks in High Performance Computing Architectures;Lecture Notes in Computer Science;2009