Skip to main content

A Comparison of Developing Codes for Distributed and Parallel Architectures

  • Conference paper
UK Parallel ’96

Abstract

There are a number of problems that can only be solved in a realistic time frame by using high performance computing environments. Large scale Monte Carlo simulations are an example of such problems. There are many different high performance environments ranging from massively parallel processors to clusters of distributed workstations. Here we present our experiences of developing a simulation code across the range of parallel environments, in some cases the transition from one architecture to another is virtually seamless, in others completely new algorithms have to be developed.

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.A. Williams, P.C.H. Mitchell and G.E. Fagg, A Cluster Computing Implementation of a Monte Carlo Implementation of a Particle Growth Mechanism, Parallel Algorithms and Applications, 4, 1994, pp 275–280.

    MATH  Google Scholar 

  2. G.E. Fagg and S.A. Williams, Improved Program Performance using a Cluster of Workstations, Parallel Algorithms and Applications, 7, 1995, pp 233–236.

    Google Scholar 

  3. I. Foster, Designing and Building Parallel Programs, Addison Wesley,1995.

    MATH  Google Scholar 

  4. P. Sunderam, Pvm: A Framework for Parallel Distributed Computing, Concurrency Practice and Experience,1990,2, pp.315–339.

    Google Scholar 

  5. K.A. Smith, S.F. Reddaway, and D.M. Scott, Very High Performance Pseudo-random Number Generation on the DAP, Computational Physics Communications, 1985, 37 pp 239–244.

    Google Scholar 

  6. N.M. Maclaren, The Generation of Multiple Independent Sequences of Pseudorandom Numbers, Applied Statistics, 1989, 38, pp 351–359.

    MATH  Google Scholar 

  7. K.P. Williams and S.A. Williams, Implementation of an Efficient and Powerful Parallel Pseudo-random Number Generator, EuroPVM’95, J.Dongarra et al (eds), 1995, ppl97–202.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag London Limited

About this paper

Cite this paper

Williams, S.A., Fagg, G.E. (1996). A Comparison of Developing Codes for Distributed and Parallel Architectures. In: Jesshope, C., Shafarenko, S. (eds) UK Parallel ’96. Springer, London. https://doi.org/10.1007/978-1-4471-1504-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1504-5_8

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-1504-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics