An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks

Abstract

Abstract This paper describes an agent-based approach for scheduling multiple multicast on wormhole switch-based networks with irregular topologies. Multi-cast/broadcast is an important communication pattern, with applications in collec-tive 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. 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, called ForwardInSwitch to solve this problem. We conduct extensive ex-periments to demonstrate the efficiency of our approach by comparing our results with SPCCO, a highly efficient multicast algorithm reported in literature. We found that SPCCO suffers link contention when the number of simultaneous multiple mul-ticast becomes large. On the other hand, our agent-based approach achieves better performance in large cases