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

Authors:
Pangfeng Liu;Yi-Fang Lin;Jan-Jan Wu;Zhe-Hao Kang
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106 and Institute of Information Science, Academia Sinica, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan 106
Venue:
The Journal of Supercomputing
Year:
2007

Citing 12
Cited 1

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies

PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
The turn model for adaptive routing

Journal of the ACM (JACM)
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks

IEEE Transactions on Parallel and Distributed Systems
Unicast-Based Multicast Communication in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Efficient Multicast on Irregular Switch-Based Cut-Through Networks with Up-Down Routing

IEEE Transactions on Parallel and Distributed Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Adaptive routing protocols for hypercube interconnection networks

Computer
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
ServerNet Deadlock Avoidance and Fractahedral Topologies

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01

Multi-agent resource allocation (MARA) for modeling construction processes

Proceedings of the 40th Conference on Winter Simulation

Quantified Score

Hi-index	0.00

Visualization

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 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 experiments 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 multicast becomes large. On the other hand, our agent-based approach achieves better performance in large cases.