Multicast connection using multiple passes

Author

Sharma, Neeraj K.

Author_Institution

Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, Vic., Australia

fYear

1996

fDate

11-13 Jun 1996

Firstpage

138

Lastpage

146

Abstract

A multicast connection (many-to-many) in a multistage interconnection network (MIN) consists of a combination of two or more one-to-one and/or broadcast connections (one-to-many) simultaneously. Due to the sharing of links in the network, two or more connections in a multicast connection can have conflicts. Furthermore, as a result of faults in the network, some of the connections may be affected by the faults. Fault-tolerant MINs can provide alternate paths to avoid faults and conflicts. If successfully implemented, multicast connection can reduce the overall communication time in a network. The problem of reconfiguration in a multicast-connected MIN that uses redundancy to achieve fault-tolerance is addressed. A reconfiguration algorithm and simulation results are presented

Keywords

distributed algorithms; fault tolerant computing; multistage interconnection networks; reconfigurable architectures; redundancy; shared memory systems; virtual machines; broadcast connections; conflict avoidance; fault avoidance; fault tolerance; link sharing; multicast connection; multiple passes; multistage interconnection network; network faults; one-to-one connections; overall communication time reduction; reconfiguration; reconfiguration algorithm; redundancy; simulation; Australia; Computer networks; Computer science; Costs; Fault tolerance; Hardware; Multiprocessing systems; Multiprocessor interconnection networks; Redundancy; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Print_ISBN

0-7803-3529-5

Type

conf

DOI

10.1109/ICAPP.1996.562868

Filename

562868