An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
This paper describes an agent-based approach for scheduling multiple multicast on wormhole switch-based networks. 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 efficiently 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 different multicasts. We conduct experiments to demonstrate the efficiency of our approach by comparing the results with PCCO, a highly efficient multicastalgorithm. We found that PCCO suffers 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.