Skip to main content

Part of the book series: Springer Series in Information Sciences ((SSINF,volume 24))

  • 252 Accesses

Abstract

The question which we pose and would ultimately like to answer is whether for a given physical system there is a combination of a formulation of the degrees of freedom and a method for the generation of states that is optimal, in the sense that it has the highest degree of parallelism. This does not imply that it is optimal with respect to the physics, since there may be specific physical grounds why one is inclined to study a certain model or formulation of a model.

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. M.J. Quinn: Designing Efficient Algorithms for Parallel Computers ( McGraw- Hill, Singapore 1987 )

    MATH  Google Scholar 

  2. J.C. Wyllie: The Complexity of Parallel Computations. Ph.D Thesis, Dept. of Computer Science, Cornell University, Ithaca, NY (1979)

    Google Scholar 

  3. D. Knuth: Fundamental Algorithms ( Addison Wesley, Reading, MA 1977 )

    Google Scholar 

  4. C.L. Liu: Elements of Discrete Mathematics, 2nd edn. ( McGraw-Hill, Singapore 1986 )

    Google Scholar 

  5. A. Gibbons, W. Rytter. Efficient Parallel Algorithms (Cambridge Univ. Press, Cambridge 1988 )

    MATH  Google Scholar 

  6. D. Nicol, F.R. Willard: J. Parallel Distrib. Comput. 5, 404 (1988)

    Article  Google Scholar 

  7. R. Friedberg, J.E. Cameron: J. Chem. Phys. 52, 6049 (1970)

    Article  ADS  Google Scholar 

  8. M. Creutz, L. Jacobs, C. Rebbi: Phys. Rev. Lett. 42, 1390 (1979); Phys. Rev. D 20, 1915 (1979)

    Google Scholar 

  9. R. Zorn, H.J. Herrmann, C. Rebbi: Comput. Phys. Commun. 23, 337 (1981)

    Article  ADS  Google Scholar 

  10. S. Wolfram: Theory and Applications of Cellular Automata ( World Scientific, Singapore 1986 )

    MATH  Google Scholar 

  11. M. Creutz: Phys. Rev. Lett. 50, 1411 (1983)

    Article  ADS  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Heermann, D.W., Burkitt, A.N. (1991). Concepts of Parallelism. In: Heermann, D.W., Burkitt, A.N. (eds) Parallel Algorithms in Computational Science. Springer Series in Information Sciences, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76265-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76265-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-76267-3

  • Online ISBN: 978-3-642-76265-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics