Multicast Communication in Multiprocessor Systems

From Tetherless World Wiki

Jump to: navigation, search

Citation: G. Byrd and Nakul P. Saraiya and Bruce A. Delagi. (1989) Multicast Communication in Multiprocessor Systems. In KSL-88-81, 1989.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author G. Byrd and Nakul P. Saraiya and Bruce A. Delagi
title Multicast Communication in Multiprocessor Systems
number KSL-88-81
institution Knowledge Systems, AI Laboratory
year 1989
Bibtex more
Access Paper
abstract Recent high-performance multiprocessors exploit cut-through routing for unicast transmission, with packets routed as their first bytes arrive. We extend ideas considered for efficient cut-through routing in multiprocessors to include multicast, in order to benefit the many parallel programs in which producers provide each value to multiple consumers. We describe several alternative cut-through multicast protocols, including a restrictive (yet adaptive) routing scheme for deadlock avoidance. Simulations using synthetic and application-driven loads show it has significantly better performance than either multicast emulation or deadlock detection and resolution. The scheme provides cut-through multicast without requiring dedicated storage in the communication facilities for a full packet.

KSL Technical Report ID: KSL-88-81
Facts about Multicast Communication in Multiprocessor SystemsRDF feed
Abstract Recent high-performance multiprocessors ex Recent high-performance multiprocessors exploit cut-through routing for unicast transmission, with packets routed as their first bytes arrive. We extend ideas considered for efficient cut-through routing in multiprocessors to include multicast, in order to benefit the many parallel programs in which producers provide each value to multiple consumers. We describe several alternative cut-through multicast protocols, including a restrictive (yet adaptive) routing scheme for deadlock avoidance. Simulations using synthetic and application-driven loads show it has significantly better performance than either multicast emulation or deadlock detection and resolution. The scheme provides cut-through multicast without requiring dedicated storage in the communication facilities for a full packet. ommunication facilities for a full packet.
Author G. Byrd and Nakul P. Saraiya and Bruce A. Delagi  +
Bibtype techreport  +
Has author G. Byrd and Nakul P. Saraiya and Bruce A. Delagi  +
Has identifier KSL-88-81  +
Has publishing details 1989  +
Has title Multicast Communication in Multiprocessor Systems  +
Has where published KSL-88-81  +
Has year 1989  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-88-81  +
Number KSL-88-81  +
Process note YES  +
Title Multicast Communication in Multiprocessor Systems  +
Year 1989  +
Personal tools