Skip to main content

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 29 Accesses

Abstract

This paper considers performance prediction for various computer networks in terms of the number of references made to the memory. Analytical solutions were obtained for the models with multiple requests to the memory and parallel access to one memory bank with a Negative Exponential distribution of requests generated by CPUs. Numerical simulation was carried out for Hyper-cube, Cube Connected Cycle and Torus processor networks. The distributed parallel architectures investigated could be viewed as PRAM simulating models. The analytical solutions are compared to numerical simulation results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. S.G. Akl, “The Design and Analysis of Parallel Algorithms,” Prentice-Hall International, Inc., 1989.

    MATH  Google Scholar 

  2. L.G. Valiant, “General Purpose Parallel Architectures,” Handbook of Theoretical Computer Science, Elsevier Science Publishers B.V.,1990.

    Google Scholar 

  3. P.G. Harrison, N.M. Patel, “The Representation of Multistage Interconnection Networks in Queueing Models of Parallel Systems,” Journal of the ACM, 37, no 4, pp. 863–898, Oct. 1990.

    Article  MathSciNet  MATH  Google Scholar 

  4. R.J. Pooley, “An Introduction to programming in Simula,” Blackwell Scientific Publications, 1987.

    MATH  Google Scholar 

  5. G.M. Birtwistle, “Discrete Event Modelling on Simula,” Macmillan Education Ltd., 1979.

    MATH  Google Scholar 

  6. B.V. Gnedenko, “The Theory of Probability,” Chelsea Publishing Company, New York, 1966.

    Google Scholar 

  7. E. Page, “Queueing theory in OR,” London Butterworths, 1972.

    MATH  Google Scholar 

  8. L.N. Bhuyan, D.P. Agrwal, “Generalised Hypercube and Hyperbus Structures for a Computer Network”, IEEE Trans.Comput. vol C-33, pp. 323–332, Apr. 1984.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag London

About this paper

Cite this paper

Chochia, G. (1992). On the Performance Prediction of PRAM Simulating Models. In: Hillston, J.E., King, P.J.B., Pooley, R.J. (eds) 7th UK Computer and Telecommunications Performance Engineering Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3538-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3538-8_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19733-1

  • Online ISBN: 978-1-4471-3538-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics