Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths

@article{Panda1999MultidestinationMP,
  title={Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths},
  author={Dhabaleswar K. Panda and Sanjay Singal and Ram Kesavan},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1999},
  volume={10},
  pages={76-96}
}
This paper proposes multidestination message passing on wormhole k-ary n-cube networks using a new base-routing-conformed-path (BRCP) model. This model allows both unicast (single-destination) and multidestination messages to co-exist in a given network without leading to deadlock. The model is illustrated with several common routing schemes (deterministic, as well as adaptive), and the associated deadlock-freedom properties are analyzed. Using this model a set of new algorithms for popular… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS
51 Citations
32 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 51 extracted citations

87 Citations

0510'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…