The Journal of Supercomputing

, Volume 42, Issue 3, pp 283–302 | Cite as

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

  • Pangfeng Liu
  • Yi-Fang Lin
  • Jan-Jan Wu
  • Zhe-Hao Kang


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.


Multicast Irregular networks Message passing scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boden NJ, Cohen D, Felderman RF, Kulawik AE, Seitz CL, Seizovic J, Su W (1995) Myrinet— a gigabit per second local area network. IEEE Micro (Feb):29–36 Google Scholar
  2. 2.
    Dally WJ, Seitz CL (1987) Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput C-36(5):547–553 CrossRefGoogle Scholar
  3. 3.
    Dally WJ (1987) Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput C-36(5):547–553 CrossRefGoogle Scholar
  4. 4.
    Duato J (1991) On the design of deadlock-free adaptive routing algorithms for multicomputers. In: Proceedings of parallel architectures and languages Europe 91, June 1991 Google Scholar
  5. 5.
    Duato J (1994) A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. In: Proceedings of the 1994 international conference on parallel proceeding, August 1994 Google Scholar
  6. 6.
    Esfahanian A-H, McKinley PK, Xu H, Ni LM (1994) Unicast-based multicast communication in wormhole-routed networks. IEEE Trans Parallel Distrib Syst 5(12):1252–1265 CrossRefGoogle Scholar
  7. 7.
    Fan K-P, King C-T (1997) Efficient multicast on wormhole switch-based irregular networks of workstations and processor clusters. In: Proceedings of the internationl conference on high performance computing systems, 1997 Google Scholar
  8. 8.
    Gaughan PT, Yalamanchili S (1993) Adaptive routing protocols for hypercube interconnection networks. IEEE Comput 26(5):12–23 Google Scholar
  9. 9.
    Glass CJ, Ni LM (1994) The turn model for adaptive routing. J ACM 41(Sept):847–902 CrossRefGoogle Scholar
  10. 10.
    Gravano G, Pifarre GD, Berman PE, Sanz JLC (1994) Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks. IEEE Trans Parallel Distrib Syst 5(12):1233–1251 CrossRefGoogle Scholar
  11. 11.
    Horst R (1996) Servernet deadlock avoidance and fractahedral topologies. In: Proceedings of the international parallel processing symposium, pp 274–280, April 1996 Google Scholar
  12. 12.
    Kesavan R, Panda DK (2001) Efficient multicast on irregular switch-based cut-through networks with up-down routing. IEEE Trans Parallel Distrib Syst 12(August) Google Scholar
  13. 13.
    Leighton FT Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Google Scholar
  14. 14.
    Ni LM, McKinley PK (1993) A survey of wormhole routing techniques in direct networks. IEEE Comput 26(2):62–76 Google Scholar
  15. 15.
    Qiao W, Ni LM (1996) Adaptive routing in irregular networks using cut-through switches. In: Proceedings of the 1996 international conference on parallel proceeding, August 1996, pp I:52–60 Google Scholar
  16. 16.
    Schroeder MD, et al (1990) Autonet: A high-speed, self-configuring local area network using point-to-point links. Technical Report SRC research report 59, DEC, April 1990 Google Scholar
  17. 17.
    Varga A (2001) The omnet++ discrete event simulation system. In: Proceedings of the European simulation multiconference, June 2001 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

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

Personalised recommendations