Advertisement

An Optimal Scheduling Algorithm for an Agent-Based Multicast Strategy on Irregular Networks

  • Yi-Fang Lin
  • Zhe-Hao Kang
  • Pangfeng Liu
  • Jan-Jan Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3947)

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.

Keywords

Optimal Schedule Local Node Message Length Remote Node Cross Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dally, W.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36(5), 547–553 (1987)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Glass, C., Ni, L.: The turn model for adaptive routing. J. ACM 41, 847–902 (1994)CrossRefGoogle Scholar
  5. 5.
    Gaughan, P.T., Yalamanchili, S.: Adaptive routing protocols for hypercube interconnection networks. IEEE Computer 26(5), 12–23 (1993)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefMATHGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Horst, R.: Servernet deadlock avoidance and fractahedral topologies. In: Proceedings of the International Parallel Processing Symposium, pp. 274–280 (1996)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, hypercubes. Morgan Kaufmann, San FranciscoGoogle Scholar
  15. 15.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yi-Fang Lin
    • 1
    • 2
  • Zhe-Hao Kang
    • 1
  • Pangfeng Liu
    • 1
  • Jan-Jan Wu
    • 2
  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipeiTaiwan
  2. 2.Institute of Information ScienceAcademia SinicaTaipeiTaiwan

Personalised recommendations