The Community for Technology Leaders
2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) (1996)
San Jose, CA
Feb. 3, 1996 to Feb. 7, 1996
ISBN: 0-8186-7237-4
pp: 118
Yousong Mei , Department of Electrical and Computer Engineering State University of New York at Buffalo
Chunming Qiao , Department of Electrical and Computer Engineering State University of New York at Buffalo
ABSTRACT
There are two approaches for establishing a connection in a network whose links are multiplexed with virtual channels. One is called Path Multiplexing (PM), in which the same channel has to be used on each link along a path, and the other is called Link Multiplexing (LM), in which different channels may be used. We study the problem of embedding permutations in LM and PM, and in particular, determine the threshold (minimal) multiplexing degrees needed for a network to be rearrangeably nonblocking. We found that PM and LM are equally effective in linear arrays, and LM is only slightly more effective than PM in rings, meshes, tori and hypercubes. Our results suggest that PM may be more cost-effective in implementing networks with multiplexed optical interconnects.
INDEX TERMS
permutation embedding, multiplexing degree, rearrangeably nonblocking, routing, all-optical networksThis research is supported in part by a grant from NSF under contract MIP-9409854.
CITATION
Yousong Mei, Chunming Qiao, "On the Multiplexing Degree Required to Embed Permutations in a Class of Networks with Direct Interconnects", 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA), vol. 00, no. , pp. 118, 1996, doi:10.1109/HPCA.1996.501179
92 ms
(Ver 3.3 (11022016))