Abstract
Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, in sending the same message to a subset of processors. In this paper, we propose new multicast algorithms for a mesh network usingwormholerouting with apath-basedfacility. These new algorithms generally perform faster than algorithms previously described in the literature under the same model. We used as the criteria for comparing algorithms theoff-line computation timenecessary to prepare the multicast and thecommunication timerequired to complete the multicast.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
