Advertisement

An experimental study of wormhole routing in parallel computers

  • Sergio Felperin
  • Prabhakar Raghavan
  • Eli Upfal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 678)

Abstract

A trend in multicomputer architecture is to use wormhole routing. In wormhole routing a message is transmitted as a contiguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we report the results of studies of simple wormhole routing algorithms for butterfly and mesh-connected networks.

Keywords

Greedy Algorithm Network Size Intermediate Node Maximum Latency Output Buffer 
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.
    B. Aiello, F.T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Second Annual ACM Symposium on Parallel Algorithms and Architectures, pages 55–64. ACM Press, 1990.Google Scholar
  2. 2.
    R. Aleliunas. Randomized parallel communication. In ACM-SIGOPS Symposium on Principles of Distributed Systems, pages 60–72, 1982.Google Scholar
  3. 3.
    W.C. Athas. Physically compact, high performance multicomputers. In Sixth MIT Conference on Advanced Research in VLSI, pages 302–313. MIT Press, 1990.Google Scholar
  4. 4.
    H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat., 23:493–509, 1952.Google Scholar
  5. 5.
    W. Dally. Performance analysis of k ary n cube interconnection networks. IEEE Trans. Computers, 39:775–785, 1990.Google Scholar
  6. 6.
    W. Dally and C.L. Seitz. Deadlock free message routing in multiprocessor interconnection networks. IEEE Trans. Computers, 36:547–553, 1987.Google Scholar
  7. 7.
    W.J. Dally. Fine grain message passing concurrent computers. In Third Conference on Hypercube Concurrent Computers and Applications, pages 2–12. ACM Press, 1988.Google Scholar
  8. 8.
    W.J. Dally. Virtual channel flow control. In Seventeenth Annual International Symposium on Computer Architecture, pages 60–68. ACM Press, 1990.Google Scholar
  9. 9.
    J. Duato. On the design of deadlock free adaptive routing algorithms for multicomputers: theoretical aspects. In Second European Conference on Distributed Memory Computing, pages 234–243. Springer Verlag LNCS 487, 1991.Google Scholar
  10. 10.
    S. Felperin, P. Raghavan, and E. Upfal. A theory of wormhole routing in parallel computers. In 33th Annual Symposium on Foundations of Computer Science, 1992, to appear.Google Scholar
  11. 11.
    F.T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Second Annual ACM Symposium on Parallel Algorithms and Architectures, pages 2–10. ACM Press, 1990.Google Scholar
  12. 12.
    M. Noakes and W.J. Dally. System design of the j machine. In Sixth MIT Conference on Advanced Research in VLSI, pages 179–194. MIT Press, 1990.Google Scholar
  13. 13.
    W.H. Press, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, 1988.Google Scholar
  14. 14.
    A. Ranade. How to emulate shared memory. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 185–194, 1987.Google Scholar
  15. 15.
    D.S. Reeves, E.F. Gehringer, and A. Chandiramani. Adaptive routing and deadlock recovery: a simulation study. In Fourth Conference on Hypercube Concurrent Computers and Applications, pages 331–337. Golden Gate Enterprises, 1989.Google Scholar
  16. 16.
    C.L. Seitz, W.C. Athas, C.M. Flaig, A.J. Martin, J. Seizovic, C.S. Steele, and W.K. Su. The architecture and programming of the Ametek Series 2010 multicomputer. In Third Conference on Hypercube Concurrent Computers and Applications, pages 33–36. ACM Press, 1988.Google Scholar
  17. 17.
    R.J. Smith II. Experimental system kit hardware. In Fourth Conference on Hypercube Concurrent Computers and Applications, pages 713–725. Golden Gate Enterprises, 1989.Google Scholar
  18. 18.
    E. Upfal. Efficient schemes for parallel communication. Journal of the ACM, 31:507–517, 1984.Google Scholar
  19. 19.
    Eli Upfal. An O(log N) deterministic packet routing scheme. In 21st ACM Annual Symposium on Theory of Computing, pages 241–250, 1989.Google Scholar
  20. 20.
    L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 263–277, Milwaukee, Wisconsin, May 1981.Google Scholar
  21. 21.
    L.G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350–361, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Sergio Felperin
    • 1
  • Prabhakar Raghavan
    • 2
  • Eli Upfal
    • 1
    • 3
  1. 1.IBM Almaden Research CenterSan JoseUSA
  2. 2.IBM T.J. Watson Research CenterYorktown Hts.USA
  3. 3.The Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations