DocumentCode
2298463
Title
Routing with locality in partitioned-bus meshes
Author
Cheung, Steven ; Lau, Francis C M
Author_Institution
Dept. of Comput. Sci., California Univ., Davis, CA, USA
fYear
1994
fDate
26-29 Oct 1994
Firstpage
715
Lastpage
721
Abstract
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing time by approximately one-third for permutation routing with locality. A matching time lower bound is also proved. The result can be generalized to multi-packet routing
Keywords
computational complexity; multiprocessor interconnection networks; matching time lower bound; multipacket routing; partitioned-bus meshes; permutation routing; routing with locality; Broadcasting; Communication switching; Computer science; Embedded computing; Propagation delay; Routing; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-6427-4
Type
conf
DOI
10.1109/SPDP.1994.346104
Filename
346104
Link To Document