Skip to main content

Modeling speedup of SPMD applications on the Intel Paragon: A case study

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1995)

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

Included in the following conference series:

Abstract

Interconnection networks with nearly distance independent communication latency are a key feature of recent architectures. However, shared resources such as network channels can become bottlenecks that degrade performance and limit workload scalability.

In this paper, the problem of network contention in medium scale multicomputers is addressed. A queueing network model that predicts application speedup on the Paragon is presented. The model has been experimentally validated under the SUNMOS operating system. The experimental and modeling results are in good agreement and suggest ways to avoid internal network contention of communication intensive applications on the Paragon.

This work was partially supported by sub-contract 19X-SL131V from the Oak Ridge National Laboratory managed by Martin Marietta Energy Systems, Inc. for the U.S. Department of Energy under contract no. DE-AC05-84OR21400 and by Italian M.U.R.S.T. 40% and 60% projects.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.S. Adve, M.K. Vernon, “Performance analysis of mesh interconnection neworkswith deterministic routing,” IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 3, pp. 225–246, March 1994.

    Google Scholar 

  2. F. Baskett, K.M. Chandy, R.R. Muntz, F. Palacios, “Open, closed, and mixed networks of queues with different classes of customers,” Journal of the ACM, Vol. 22, No. 2, pp. 248–260, April 1975.

    MathSciNet  Google Scholar 

  3. S. Chittor, R. Enbody, “Performance degradation in large wormhole-routed interprocessor communication networks,” in Proceedings of 1990 Int'l Conference on Parallel Processing, vol. 1, pp. 424–428, 1990.

    Google Scholar 

  4. W.J. Dally, C.L. Seitz, “The torus routing chip,” Journal of Distributed Computing, Vol. 1, No. 3, pp. 187–196, 1986.

    Google Scholar 

  5. P. Krueger, T. Lai, V.A. Dixit-Radiya, “Job scheduling is more important than processor allocation for hypercube computers,” IEEE Trans. on Parallel and Distributed Systems, Vol. 5, No. 5, pp 488–497, May 1994.

    Google Scholar 

  6. L.M. Ni, P.K. McKinley, “A survey of wormhole routing techniques in direct networks,” IEEE Computer, Vol. 26, No. 2, pp. 62–76, February 1993.

    Google Scholar 

  7. B. Maccabe, K.S. McCurley, and R. Riesen, “SUNMOS for the Intel Paragon: A Brief User's Guide,” Sandia National Laboratories Tech. Report, 1993.

    Google Scholar 

  8. E. Smirni, C.A. Childers, E. Rosti, L.W. Dowdy, “Thread Placement on the Intel Paragon: Modeling and Experimentation,” Proc. of the 3rd Inter. Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp 226–231, North Carolina, USA, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bob Hertzberger Giuseppe Serazzi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smirni, E., Rosti, E. (1995). Modeling speedup of SPMD applications on the Intel Paragon: A case study. In: Hertzberger, B., Serazzi, G. (eds) High-Performance Computing and Networking. HPCN-Europe 1995. Lecture Notes in Computer Science, vol 919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046615

Download citation

  • DOI: https://doi.org/10.1007/BFb0046615

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59393-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics