Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers

  • Lin X
  • McKinley P
  • Ni L
  • 20


    Mendeley users who have this article in their library.
  • 177


    Citations of this article.


The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially adaptive, minimal fully adaptive, and nonminimal adaptive routing. All the algorithms are shown to be deadlock-free. A study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully adaptive routing method creates the least traffic; however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network traffic than the other methods. © 1995 Academic Press, Inc.

Author-supplied keywords

  • 2-D mesh topology
  • Multicomputers
  • deadlock-free routing
  • heuristic algorithms
  • massively parallel computers
  • multicast communication
  • wormhole routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Xiaola Lin

  • Philip K. McKinley

  • Lionel M. Ni

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free