DocumentCode :
3296688
Title :
Permutation routing in 2-stage recirculating delta networks
Author :
Alleyne, Brian D. ; Scherson, Isaac D.
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., NJ, USA
fYear :
1992
fDate :
19-21 Oct 1992
Firstpage :
502
Lastpage :
503
Abstract :
The authors discuss a N input/output recirculating network that can take advantage of compile-time knowledge of algorithm-dependent communications, but still performs efficiently on data-dependent permutations. A deterministic routing algorithm and a randomized routing algorithm are given. Mapping to Clos networks is considered
Keywords :
multiprocessor interconnection networks; parallel architectures; 2-stage recirculating delta networks; Clos networks; algorithm-dependent communications; compile-time knowledge; data-dependent permutations; deterministic routing algorithm; permutation routing; randomized routing algorithm; Intelligent networks; Labeling; Routing; Runtime; Switches; Wires;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location :
McLean, VA
Print_ISBN :
0-8186-2772-7
Type :
conf
DOI :
10.1109/FMPC.1992.234872
Filename :
234872
Link To Document :
بازگشت