Skip to main content
SpringerLink
Log in

Communication throughput of interconnection networks

  • Invited Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1994 (MFCS 1994)

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

Abstract

Modern flow control techniques used for massively parallel computers have made network capacity a more important parameter for the application performance than network latency. Network latency is usually rather low as long as the injection rate is below a specific value.

Nowadays the maximal injection rate is usually approximated by the bisection bandwith of the network. We will describe the state of the art in determining the bisection bandwith of interconnection systems. Unfortunately the bisection bandwith leads only to very vague approximations of the communication capacity of a network. We will describe some methods aiming at modeling the maximal network capacity by using probabilistic models. Especially we will present results for the multistage interconnection network which is often used in parallel computing and more general communication applications.

The presented results show a rather close relation to results gained by simulations and therefore have the potential to replace them. We argue that theoretical investigations, leading to close term expressions or polynomial algorithms computing the exact network throughput can be of great help for engineers usually determing the throughput of a given network by time consuming simulations.

This work was partly supported by the German Federal Department of Science and Technology (BMFT), PARAWAN project 413-5839-ITR 9007 BO, the EC Esprit Basic Research Action Nr. 7141 (ALCOM II) and the EC Human Capital and Mobility Project: “Efficient Use of Parallel Computers: Architecture, Mapping and Communication”

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Agarwal, Limits on Interconnection Network Performance, IEEE Transactions on Parallel and Distributed Systems, vol. 2, 1991, pp. 398–412

    Google Scholar 

  2. R. Aleliunas, Randomized parallel communication, Proc. of ACM Symp. on Principles of Disributed Computing (PODC),1982, pp. 60–72

    Google Scholar 

  3. K. Batcher, Sorting networks and their applications, Proc. of the AFIPS Spring Joint Computing Conference, vol. 32, 1968, pp. 307–314

    Google Scholar 

  4. BBN, Butterfly™ Parallel Processor Overview, BBN Report No. 6148, Version 1, Cambridge Mass. 1986

    Google Scholar 

  5. CCITT Recommendations I.121, Broadband aspects of ISDN, Blue Book, vol III.7, Geneva, Switzerland 1989

    Google Scholar 

  6. L.H. Clark, R.C. Entringer, The Bisection Width of Cubic Graphs, Bull. Austral. Math. Soc., vol. 39, 1988, pp. 389–396

    Google Scholar 

  7. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subronomian, T. van Eicken, LogP: Towards a Realistic Model of Parallel Computation, Proc. of 4th ACM Symp. on Pinciples and Practice of Parallel Programming, 1993

    Google Scholar 

  8. W. J. Dally, C. L. Seitz, Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Transactions on Computers, vol. C-36, no. 5, 1987, pp. 547–553

    Google Scholar 

  9. W. Dally, Performance Analysis of k ary n cube interconnection networks, IEEE Transactions on Computers, vol. 39, 1990, pp. 775–785

    Google Scholar 

  10. R. Diekmann, R. Lüling, J. Simon, Problem Independent Distributed Simulated Annealing and its Applications, in: R.V.V. Vidal (ed.), Applied Simulated Annealing, Lecture Notes in Econ. and Math. Systems, Springer LNEMS 396 (1993), pp. 17–44

    Google Scholar 

  11. R. Diekmann, B. Monien, R. Preis, Using Helpful Sets to Improve Graph Bisections, Technical Report TR-RF-8-94, University of Paderborn, 1994

    Google Scholar 

  12. H.N. Djidjev, On the Problem of Partitioning Planar Graphs, SIAM J. Alg. Disc. Meth., vol. 3(2), 1982, pp. 229–240

    Google Scholar 

  13. S. Felperin, P. Raghavan, E. Upfal, A Theory of Wormhole Routing in Parallel Computers, ACM Symposium on Foundations of Computer Science, 1992, pp. 563–572

    Google Scholar 

  14. R. Funke, R. Lüling, B. Monien, F. Lücking, H. Blanke-Bohne, An optimized reconfigurable Architecture for Transputer Networks, Proc. of the 25th Hawaii Int. Conf. on System Sciences (HICSS) 1992, vol. 1, pp. 237–245

    Google Scholar 

  15. A. Gottlieb, An overview of the NYU Ultracomputer Project, in J.J. Dongarra, Experimental Parallel Computing Architectures, Elsevier, Amsterdam, 1987, pp. 25–95

    Google Scholar 

  16. M.C. Heydemann, J.C. Meyer, D. Sotteau, On Forwarding Indices of Networks, Discrete Applied Mathematics, vol. 23, 1989, pp. 103–123

    Google Scholar 

  17. H. Hofestädt, A. Klein, E. Reyzl, Performance Benefits from Locally Adaptive Interval Routing in Dynamically Switched Interconnection Networks, Proc. of 2nd European Distributed Memory Computing Conference, Springer LNCS 487, pp. 193–202

    Google Scholar 

  18. HPC Project, Project for Suggesting Computer Science Agenda(s) for High-Performance Computing, April 1994

    Google Scholar 

  19. J. Hromkovič, B. Monien, The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems), Proc. of 16th Math. Foundations of Computer Science (MFCS), 1991, Springer Lecture Notes in Computer Science, vol. 520, pp. 211–220

    Google Scholar 

  20. S.H. Hsiao, C.Y.R. Chen, Performance analysis of single-buffered multistage interconnection networks, 3rd IEEE Symp. Par. and Distr. Processing, 1991, pp. 864–867

    Google Scholar 

  21. Y.C. Jenq, Performance analysis of a packet switch based on a single-buffered banyan network, IEEE J. on Selected Areas of Comm., vol. SAC-3, 1983, pp. 1014–1021

    Google Scholar 

  22. M. Kaufmann, J. Sibeyn, T. Suel, Derandomizing Algorithms for Routing and Sorting on Meshes, Proc. 5th SODA, 1994, pp. 669–679

    Google Scholar 

  23. D. Krizanc, S. Rajasekaran, T. Tsantilis, Optimal routing algorithms for meshconnected processor arrays, Proc. of Agean Workshop on Computing: VLSI Algorithms and Architectures, Lecture Notes in Computer Science, vol. 319, 1988, pp. 411–422

    Google Scholar 

  24. C.P. Kruskal, M. Snir, The performance of multistage interconnection networks for multiprocessors, IEEE Trans. on Computers, vol. C-32, 1983, pp. 1091–1098

    Google Scholar 

  25. M. Kunde, Routing and Sorting on Grids, Habilitationsschrift, Technical University of Munich, June 1991

    Google Scholar 

  26. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, 1992

    Google Scholar 

  27. F.T. Leighton, Average Case Analysis of Greedy Routing Algorithms on Arrays, ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1990, pp. 2–10

    Google Scholar 

  28. F.T. Leighton, F. Makedon, I. Tollis, A 2N-2 step algorithms for routing in an N x N mesh, Proc. 1st ACM Symp. on Par. Alg. and Architectures (SPAA), 1989, pp. 328–335

    Google Scholar 

  29. C.E. Leiserson et.al., The Network Architecture of the Connection Machine CM-5, Proc. 4th ACM Symp. on Par. Alg. and Architectures (SPAA), 1992, pp. 272–285

    Google Scholar 

  30. R.J. Lipton, R.E. Tarjan, A Separator Theorem for Planar Graphs, Siam J. Appl. Math., vol. 36(2), 1979, pp. 177–189

    Google Scholar 

  31. B.M. Maggs, R.K. Sitaraman, Simple Algorithms for Routing on Butterfly Networks with Bounded Queues, Proc. 24th ACM Symp. on Theory of Comp., 1992, pp. 150–161

    Google Scholar 

  32. B. Monien, R. Lüling, F. Langhammer, A Realizable Efficient Parallel Architecture, 1st Int. Heinz Nixdorf Symposium: Parallel Architectures and their Efficient Use, Paderborn, 1992, Springer LNCS 678, pp. 93–109

    Google Scholar 

  33. B. Monien, R. Feldmann, R. Klasing, R. Lüling, Parallel Architectures: Design and Efficient Use, Proc. STACS '93, Springer LNCS 665, pp. 247–269

    Google Scholar 

  34. Y. Mun, H. Yong, Performance Analysis of Finite Buffered Multistage Interconnection Networks, IEEE Trans. on Computers, vol. C-43, 1994. pp. 153–162

    Google Scholar 

  35. G.F. Pfister, W.C. Brantley, D.A. George, S.L. Harvey, W.J. Kleinfelder, K.P. McAuliffe, E.A. Melton, V.A. Norton, J. Weiss, An introduction to the IBM Research Parallel Processor Prototype (RP3), In J. J. Dongarra, Experimental Parallel Computing Architectures, Elsevier Science Publishers, Amsterdam, 1987, pp. 123–140

    Google Scholar 

  36. N. Pippenger, Parallel communication with limited buffers, Proc. of 25th Symposium on Foundations of Computer Science (FOCS), 1984, pp. 127–136

    Google Scholar 

  37. A.G. Ranade, How to emulate shared memory, Proc. of 28th Symposium on Foundations of Computer Science (FOCS), 1987, pp. 185–194

    Google Scholar 

  38. G.D. Stamoulis, J.N. Tsitsiklis, The Efficiency of Greedy Routing in Hypercubes and Butterflies, Proc. ACM Symp. on Par. Alg. and Arch. (SPAA), 1991, pp. 248–259

    Google Scholar 

  39. T.H. Theimer, E.P. Rathgeb, M.N. Huber, Performance analysis of buffered banyan networks, IEEE Trans. on Communication, vol. C-39, 1991, pp. 269–277

    Google Scholar 

  40. J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Inc. 1984

    Google Scholar 

  41. E. Upfal, Efficient schemes for parallel communication, Journal of the ACM, vol. 31, no. 3, 1984, pp. 507–517

    Google Scholar 

  42. L.G. Valiant, A scheme for fast parallel communication, SIAM Journal on Computing, vol. 11, no. 2, 1982, pp. 350–361

    Google Scholar 

  43. L.G. Valiant, G.J. Brebner, Universal schemes for parallel communications, Proc. of 13th ACM Symposium on Theory of Computing (STOC), 1981, pp. 263–277

    Google Scholar 

  44. A. Varma, C.S. Raghavendra, Performance analysis of a redundant-path interconnection network, Proc. of Int. Conf. on Parallel Processing, 1985, pp. 474–479

    Google Scholar 

  45. H.Y. Yoon, K.Y. Lee, M.T. Liu, Performance analysis of multibuffered packet-switching networks in multiprocessor systems, IEEE Trans. on Comp., C-39, 1990, pp. 319–327

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Paderborn, Germany

    Burkhard Monien, Ralf Diekmann & Reinhard Lüling

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Diekmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reinhard Lüling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Diekmann, R., Lüling, R. (1994). Communication throughput of interconnection networks. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation