Skip to main content
SpringerLink
Log in

Distance-Based Flow Control in Wormhole Networks

  • Conference paper
  • First Online:
Book cover 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

The introduction of wormhole routing over a decade ago enabled the use of networks with large diameter, such as the 2-D and 3-D meshes. In direct networks with possibly large diameters, the distances between nodes vary significantly. This will affect communication latencies especially with varying traffic loads. In this paper, we propose a new, low-cost distance-based flow control for wormhole networks. Conventional virtual channel flow control does not take into account distances and the physical channel is scheduled in a strict round-robin manner. The proposed flow control is achieved through two mechanisms, a distance-based message priority mapping and an efficient deadlock-free prioritized physical link allocation strategy. This paper presents the motivation behind the proposed flow control, a description of the mechanisms, and its implementation. The distance-based flow control is evaluated and compared against conventional virtual channel flow control for a wide range of system parameters. Results based on thorough simulation show that the performance of local and long-distance communication can be significantly improved, latency can be improved by up to 45%. The results demonstrate significant potential for designing high performance highly parallel wormhole systems.

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. D. Basak and D. K. Panda, Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems. Technical Report OSU-CISRC-09/95-TR36. The Ohio State University, 1995.

    Google Scholar 

  2. R. V. Boppana and S. Chalasani. A Comparison of Adaptive Wormhole Routing Algorithms. In Proceedings of the International Symposium on Computer Architecture, 1993

    Google Scholar 

  3. R. V. Boppana and S. Chalasani and C. S. Raghavendra. On Multicast Wormhole Routing in Multicomputer Networks. In Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 722–729.

    Google Scholar 

  4. W. J. Dally. Virtual Channel Flow Control. IEEE Trans. on Parallel and Distributed Systems, 3(2):194–205, 1992.

    Article  Google Scholar 

  5. W. J. Dally and C. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. on Computing. C-36(5), pp. 547–553, May 1987.

    Google Scholar 

  6. J. Duato, P. Lopez, F. Silla and S. Yalamanchili. A High Performance Router Architecture for Interconnection Networks. In Proc. of the Int. Conference on Parallel Processing, 1996.

    Google Scholar 

  7. J. Duato and P. Lopez. Performance Evaluation of Adaptive Routing Algorithms for k-ary n-cubes. In Proc. of Parallel Computer Routing and Communication Workshop, 1994.

    Google Scholar 

  8. J. Duato. Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions. In Proceedings of Parallel Architectures and Languages Europe, 1992.

    Google Scholar 

  9. P. Kermani and L. Kleinrock. Virtual Cut-Through: A New Computer Communication Switching Technique. In Computer Networks, 3(4):267–286, 1979.

    MATH  MathSciNet  Google Scholar 

  10. J. H. Kim and A. Chien. Rotating Combined Queueing (RCQ): Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks. In Proceedings of the International Symposium on Computer Architecture, 1996.

    Google Scholar 

  11. J-P. Li and M. W. Mutka. Real-Time Virtual Channel Flow Control. In Journal of Parallel and Distributed Compting 32, 49–65, 1996.

    Article  Google Scholar 

  12. Lionel Ni and Philip McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, February 1993.

    Google Scholar 

  13. J. Rexford, J. Hall and K. G. Shin. A Router Architecture for Real-Time Point-to-Point Networks. In Proceedings of the International Symposium on Computer Architecture, 1996.

    Google Scholar 

  14. A-H Smai, D. K. Panda and L-E Thorelli. Prioritized Demand Multiplexing (PDM): A Virtual Channel Flow Control Framework for Prioritized Traffic. Submitted for Publication

    Google Scholar 

  15. A. A. Chien and J. H. Kim. Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors. In Proc. of the International Symposium on Computer Architecture, 1992.

    Google Scholar 

  16. C. J. Glass and L. Ni. The Turn Model for Adaptive Routing. In Proceedings of the International Symposium on Computer Architecture, 1992.

    Google Scholar 

  17. Z. Liu and A. A. Chien. Hierarchical Adaptive Routing: A Framework for Fully Adaptive and Deadlock-Free Wormhole Routing. In Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 1994.

    Google Scholar 

  18. D. K. Panda. Issues in Designing Efficient and Practical Algorithms for Collective Communication in Wormhole-Routed Systems. 1995 Workshop on Challenges for Parallel Processing.

    Google Scholar 

  19. A. Chien and S. Konstantinidou. Workloads and Performance Metrics for Evaluating Parallel Interconnects. Special issue of IEEE TCCA Newsletter on Interconnection Networks for High Performance Computing Systems, Winter 1995.

    Google Scholar 

  20. S. Konstantinidou and L. Snyder. The Chaos Router. IEEE Trans. on Computers, 43(12):1386–1397, Dec. 1994.

    Google Scholar 

  21. J. Duato and M.P. Malumbres. Optimal Topology for Distributed Shared-Memory Multiprocessors: Hypercubes Again?. In Proceedings of European Conference on Parallel Processing Vol. I. 1996.

    Google Scholar 

  22. J. Duato. A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks. IEEE Trans. on Parallel and Distributed Systems, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Teleinformatics, Royal Institute of Technology, Electrum 204, 164 40, Kista, Sweden

    A -H Smai & L -E Thorelli

Authors
  1. A -H Smai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L -E Thorelli
    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

Smai, A.H., Thorelli, L.E. (1998). Distance-Based Flow Control in Wormhole Networks. 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_17

Download citation

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

  • 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