Title :
Wormhole routing for complete exchange in multi-mesh
Author :
De, Mallika ; Kundu, Bhaktipada ; Sinha, Bhabani P.
Author_Institution :
Kalyani Univ., West Bengal, India
Abstract :
An efficient complete exchange algorithm is presented for a multi mesh network having N (=n4) processors (n=2k), with wormhole routing as the method of message passing between two communicating processors. The proposed algorithm effectively uses the cycles of length n and 2n respectively, present in the multi mesh topology. The total time required for complete exchange is O(mN5/4 logN), where m is the message length (assumed to be the same for all the messages)
Keywords :
communication complexity; message passing; multiprocessor interconnection networks; parallel architectures; communicating processors; complete exchange algorithm; message length; message passing; multi mesh network; multi mesh topology; wormhole routing; Broadcasting; Intelligent networks; Message passing; Multiprocessor interconnection networks; Partitioning algorithms; Pipeline processing; Routing; Switching circuits; System recovery; Tail;
Conference_Titel :
High-Performance Computing, 1997. Proceedings. Fourth International Conference on
Conference_Location :
Bangalore
Print_ISBN :
0-8186-8067-9
DOI :
10.1109/HIPC.1997.634526
