-
[show abstract]
[hide abstract]
ABSTRACT: . Efficient implementation of multicast communication is critical to the performance of message-based scalable parallel computers and switch-based high speed networks. This paper deals with address issues occurring in the message header for the transmission of multicast messages. Multi-address encoding is becoming critical to system performance as the scale of networks is getting larger and the demand of multicast communication is getting higher. Several multi-address encoding schemes are investigated and explored. Although the proposed multi-address encoding schemes can be applied to networks with different switching techniques, the emphasis of this paper is on the emerging wormhole routing technique. 1 Introduction Multicast communication, which refers to the delivery of a message from a single source node to a number of destination nodes, is a frequently used communication pattern in distributed-memory parallel computers and computer networks. Efficient implementation of multicast ...
09/1996;
-
[show abstract]
[hide abstract]
ABSTRACT: A system-level multicast service, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addresses how to efficiently implement multicast services in wormhole-routed unidirectional multistage interconnection networks (MINs), in the absence of hardware multicast support, by exploiting the properties of the switching technology. We show that the known topologically equivalent delta-class MINs have different capabilities in supporting software multicast. An optimal multicast algorithm is proposed for cube and omega networks. We also show that optimal multicast algorithms may not exist for baseline and butterfly networks. This papers addresses these properties and gives the performance via simulation
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on; 11/1995
-
[show abstract]
[hide abstract]
ABSTRACT: A system-level multicast service, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addresses how to efficiently implement multicast services in wormhole-routed unidirectional multistage interconnection networks (MINs), in the absence of hardware multicast support, by exploiting the properties of the switching technology. We show that the known topologically equivalent delta-class MINs have different capabilities in supporting software multicast. An optimal multicast algorithm is proposed for cube and omega networks. We also show that optimal multicast algorithms may not exist for baseline and butterfly networks. This papers addresses these properties and gives the performance via simulation.
Parallel and Distributed Processing, IEEE Symposium on. 10/1995;
-
[show abstract]
[hide abstract]
ABSTRACT: Efficient implementation of multicast communication is critical to the performance of messagebased scalable parallel computers and switch-based high speed networks. This paper deals with address issues occurring in the message header for the transmission of multicast messages. Several multi-address encoding schemes are investigated and explored. Although the proposed multi-address encoding schemes can be applied to networks with different switching techniques, the emphasis of this paper is on the multistage interconnection network adopting the wormhole routing technique. 1 Introduction Multicast communication, which refers to the delivery of a message from a single source node to a number of destination nodes, is a frequently used communication pattern in distributed-memory parallel computers and computer networks. Efficient implementation of multicast communication is critical to the performance of message-based scalable parallel computers and switch-based high speed networks. For e...
03/1995;
-
[show abstract]
[hide abstract]
ABSTRACT: This paper studies the multicast problem in the multistage
interconnection network (MIN) topology. A regular MIN is a unique path
network and can provide only a single path choice in routing or
multicasting. However, if the MIN is added with a few extra stages, it
can offer greater routing flexibilities. Design implications of
extra-stage MINs are discussed in this paper. An upper bound on the
number of different multicast trees is derived. While the problem of
generating all traffic-optimal multicast tree instances may require
exponential complexity, generating a single instance of an optimum
traffic multicast tree can be done in polynomial time. Performance
comparison among some heuristic multicast algorithms as well as the
impact of various inter-stage connection patterns in extra stages are
shown using simulation
Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on; 11/1994
-
Chi-Ming. Chiang
[show abstract]
[hide abstract]
ABSTRACT: Thesis (Ph. D.)--Michigan State University. Dept. of Computer Science, 1995. Includes bibliographical references (leaves 192-197).
