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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.J. Quinn: Designing Efficient Algorithms for Parallel Computers ( McGraw- Hill, Singapore 1987 )
J.C. Wyllie: The Complexity of Parallel Computations. Ph.D Thesis, Dept. of Computer Science, Cornell University, Ithaca, NY (1979)
D. Knuth: Fundamental Algorithms ( Addison Wesley, Reading, MA 1977 )
C.L. Liu: Elements of Discrete Mathematics, 2nd edn. ( McGraw-Hill, Singapore 1986 )
A. Gibbons, W. Rytter. Efficient Parallel Algorithms (Cambridge Univ. Press, Cambridge 1988 )
D. Nicol, F.R. Willard: J. Parallel Distrib. Comput. 5, 404 (1988)
R. Friedberg, J.E. Cameron: J. Chem. Phys. 52, 6049 (1970)
M. Creutz, L. Jacobs, C. Rebbi: Phys. Rev. Lett. 42, 1390 (1979); Phys. Rev. D 20, 1915 (1979)
R. Zorn, H.J. Herrmann, C. Rebbi: Comput. Phys. Commun. 23, 337 (1981)
S. Wolfram: Theory and Applications of Cellular Automata ( World Scientific, Singapore 1986 )
M. Creutz: Phys. Rev. Lett. 50, 1411 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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