Efficient Agent-Based Multicast on Wormhole Switch-Based Irregular Networks
Date Issued
2006
Date
2006
Author(s)
Kang, Zhe-Hao
DOI
en-US
Abstract
This paper describes an agent-based approach for scheduling multiple multicast on wormhole switch-based networks with irregular topologies. Multicast/broadcast is an important communication pattern, with applications in collective communication operations such as barrier synchronization and global combining. Our approach assigns an agent to each subtree of switches such that the agents can exchange information e ciently and independently. The entire multicast problem is then recursively solved with each agent
sending message to those switches that it is responsible for. In this way, communication is localized by the assignment of agents to subtrees. This idea can be easily generalized to multiple multicast since the order of message passing among agents can be interleaved for di erent multicasts. The key to the performance of this agent-based approach is the message-passing scheduling between agents and the destination processors. We propose an optimal scheduling algorithm to solve this problem.
We conduct extensive experiments to demonstrate the e ciency of our approach by comparing our results with SPCCO, a highly e cient multicast algorithm reported in literature. We found that SPCCO su ers link contention when the number of simultaneous multiple multicast becomes large. On the other hand, our agent-based approach achieves better performance in large cases.
Subjects
多重廣播
代理人演算法
Multiple Multicast
wormhole switching
agent based algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922072-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):577bcc2c24a332d795e1fe3fd08ae14f