Abstract
This paper describes an agent-based approach for scheduling multiple multicast on switch-based networks with irregular topologies. 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 experiments to demonstrate the efficiency of our approach by comparing the results with SPCCO, a highly efficient multicast algorithm. 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dally, W.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36(5), 547–553 (1987)
Duato, J.: On the design of deadlock-free adaptive routing algorithms for multicomputers. In: Aarts, E.H.L., Rem, M., van Leeuwen, J. (eds.) PARLE 1991. LNCS, vol. 505. Springer, Heidelberg (1991)
Duato, J.: A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. In: Proceedings of the 1994 International Conference on Parallel Proceeding (1994)
Glass, C., Ni, L.: The turn model for adaptive routing. J. ACM 41, 847–902 (1994)
Gaughan, P.T., Yalamanchili, S.: Adaptive routing protocols for hypercube interconnection networks. IEEE Computer 26(5), 12–23 (1993)
Gravano, G., Pifarre, G.D., Berman, P.E., Sanz, J.L.C.: Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks. IEEE Trans. Parallel and Distributed Systems 5(12), 1233–1251 (1994)
McKinley, P.K., Xu, H., Esfahanian, A.H., Ni, L.: Unicast-based multicast communication in wormhole-routed networks. IEEE Transactions on Parallel and Distributed Systems 5(12), 1252–1265 (1994)
Boden, N.J., Cohen, D., Felderman, R.F., Kulawik, A.E., Seitz, C.L., Seizovic, J., Su, W.: Myrinet - a gigabit per second local area network. IEEE Micro., 29–36 (1995)
Schroeder, M., et al.: Autonet: A high-speed, self-configuring local area network using point-to-point links. Technical Report SRC research report 59 (December 1990)
Horst, R.: Servernet deadlock avoidance and fractahedral topologies. In: Proceedings of the International Parallel Processing Symposium, pp. 274–280 (1996)
Qiao, W., Ni, L.: Adaptive routing in irregular networks using cut-through switches. In: Proceedings of the 1996 International Conference on Parallel Proceeding, pp. 52–60 (1996)
Fan, K.P., King, C.T.: Efficient multicast on wormhole switch-based irregular networks of workstations and processor clusters. In: Proceedings of the International Conference on High Performance Computing Systems (1997)
Kesavan, R., Panda, D.K.: Efficient multicast on irregular switch-based cutthrough networks with up-down routing. IEEE Trans. Parallel and Distributed Systems 12 (2001)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, hypercubes. Morgan Kaufmann, San Francisco
Lin, Y.F., Liu, P., Wu, J.J.: Efficient agent-based multicast on wormhole switchbased irregular networks. In: International Parallel and Distributed Processing Symposium (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, YF., Kang, ZH., Liu, P., Wu, JJ. (2006). An Optimal Scheduling Algorithm for an Agent-Based Multicast Strategy on Irregular Networks. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_17
Download citation
DOI: https://doi.org/10.1007/11745693_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33809-3
Online ISBN: 978-3-540-33810-9
eBook Packages: Computer ScienceComputer Science (R0)