Skip to main content
SpringerLink
Log in

Integrated Multi-class Routing

  • Conference paper
  • First Online:
Parallel Computer Routing and Communication (PCRCW 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1417))

Included in the following conference series:

Abstract

In this paper we describe a class of routing algorithms called multi-class algorithms. Multi-class algorithms support multiple classes of routing simultaneously, thereby allowing different applications, and even different messages, to select the most advantageous kind of rout- ing. For example some applications prefer the smaller latency variance of oblivious routing, while others prefer the higher throughputs achieved by adaptive routing. Typical systems provide a single class routing algo- rithm, but applications benefit from the flexibility of multiple classes.

Integrated multi-class routers have two characteristics. First, they pro- vide an integrated algorithm where routing classes share resources such as buffers. Each class is not an independent routing algorithm on an in- dependent network, but rather to reduce costs, each class is implemented by a single algorithm on a shared network. Second, multi-class routers help increase performance by providing routing flexibility and network services which help simplify the network interface or system software.

The idea of multi-class routing is perhaps obvious and it has appeared before. Our contribution, however, lies in defining multi-class routers, describing their advantages, providing an appropriate method for evalu- ating such routers, and by demonstrating their usefulness though exam- ples.

This work was supported in part by the National Science Foundation Grant MIP-9213469 and by an ARPA Graduate Research Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Aydogan, C. Stunkel, C. Aykanat, and B. Abali. Adaptive source routing in multistage interconnection networks. In Intl. Parallel Processing Sym., pages 258–67, 1996.

    Google Scholar 

  2. M. Blumrich, K. Li, R. Alpert, C. Dubnicki, and E. Felten. Virtual memory mapped network interface for the SHRIMP multicomputer. In Proc. of the Intl. Sym. on Computer Arch., pages 142–153, 1994.

    Google Scholar 

  3. G. Buzzard, D. Jacobson, M. Mackey, S. Marovich, and J. Wilkes. An implementation of the Hamlyn sender-managed interface architecture. In Proc. of the Sym. on Operating Sys. Design and Implementation, pages 245–259, 1996.

    Google Scholar 

  4. A. Chien and J. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proc. of the Intl. Sym. on Computer Arch., pages 268–277, 1992.

    Google Scholar 

  5. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. vonEicken. LogP: Towards a realistic model of parallel computation. In Proc. of Sym. on Prin. and Prac. of Par. Prog., May 1993.

    Google Scholar 

  6. W. Dally. The J-machine system. In P. Winston and S. Shellard, editors, Artificial Intelligence at MIT: Expanding Frontiers. MIT Press, 1990.

    Google Scholar 

  7. W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–553, May 1987.

    Google Scholar 

  8. J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 4(4):466–475, Apr. 1993.

    Google Scholar 

  9. J. Duato. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 6(10), Oct. 1995.

    Google Scholar 

  10. M. Fulgham. Practical Multicomputer Routing. PhD thesis, University of Washington, Seattle, 1997.

    Google Scholar 

  11. M. Fulgham and L. Snyder. Triplex: A multi-class routing algorithm. In Sym. on Parallel Alg. and Arch., to appear, 1997.

    Google Scholar 

  12. C. J. Glass and L. M. Ni. The turn model for adaptive routing. JACM, 41(5):874–902, 1994.

    Article  Google Scholar 

  13. L. Gravano, G. Pifarré, P. Berman, and J. Sanz. Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks. IEEE Transactions on Parallel and Distributed Systems, 5(12):1233–1251, 1994.

    Article  Google Scholar 

  14. P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3:267–286, 1979.

    MATH  MathSciNet  Google Scholar 

  15. J. Kim, Z. Liu, and A. Chien. Compressionless routing: a framework for adaptive and fault-tolerant routing. In Proc. of the Intl. Sym. on Computer Arch., pages 289–300, 1994.

    Google Scholar 

  16. S. Konstantinidou and L. Snyder. The chaos router. IEEE Transactions on Computers, 43(12):1386–1397, Dec. 1994.

    Google Scholar 

  17. A. K.V. and T. Pinkston. An efficient, fully adaptive deadlock recovery scheme: DISHA. In Proc of the Intl. Sym. on Comp. Arch., pages 201–210, 1995.

    Google Scholar 

  18. A. Landin, E. Hagersten, and S. Haridi. Race-free interconnection networks and multiprocessor consistency. In Proc. of the Intl. Sym. on Computer Arch., pages 106–115, 1991.

    Google Scholar 

  19. K. Li, J. Naughton, and J. Plank. An efficient checkpointing method for multi-computers with wormhole routing. International Journal of Parallel Programming, 20:159–180, 1991.

    Article  Google Scholar 

  20. D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, C-40(1):2–12, Jan. 1991.

    Google Scholar 

  21. Z. Liu and A. Chien. Hierarchical adaptive routing: A framework for fully adaptive and deadlock-free wormhole routing. In Sym. on Par. and Distr. Processing, pages 688–695, 1994.

    Google Scholar 

  22. N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder. CRANIUM: An interface for message passing on adaptive packet routing networks. In Lecture Notes in Computer Science, volume 853, pages 266–280, 1994.

    Google Scholar 

  23. L. Schwiebert and D. Jayasimha. A universal proof technique for deadlock-free routing in interconnection networks. Journal of Parallel and Distributed Computing, 32(1):103–117, 1996.

    Article  Google Scholar 

  24. S. Scott and G. M. Thorson. The cray T3E network: Adaptive routing in a high performance 3D torus. In Proc. of the HOT Interconnects IV, 1996.

    Google Scholar 

  25. T. von Eicken D.E. Culler, S. Goldstein, and K. Schauser. Active messages: a mechanism for integrated communication and computation. In Proc. of the Intl. Sym. on Computer Arch., pages 256–266, May 1992.

    Google Scholar 

  26. B. Wei, G. Stoll, D. Clark, E. Felten, and K. Li. Synchronization for a multi-port frame buffer on a mesh-connected multicomputer. In Proc. of the Parallel Rendering Symposium, pages 81–88, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA, 98195-2350, USA

    Melanie L. Fulgham & Lawrence Snyder

Authors
  1. Melanie L. Fulgham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lawrence Snyder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology, School of Electrical and Computer Science, Atlanta, Georgia, 30332-0250, USA

    Sudhakar Yalamanchili

  2. Facultad de Informàtica, Universidad Politécnica de Valencia, Camino de Vera s/n, E-46071, Valencia, Spain

    José Duato

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fulgham, M.L., Snyder, L. (1998). Integrated Multi-class Routing. In: Yalamanchili, S., Duato, J. (eds) Parallel Computer Routing and Communication. PCRCW 1997. Lecture Notes in Computer Science, vol 1417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69352-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-69352-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64571-9

  • Online ISBN: 978-3-540-69352-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation