skip to main content
10.1145/63047.63082acmconferencesArticle/Chapter ViewAbstractPublication Pagesc3pConference Proceedingsconference-collections
Article
Free access

QED on the connection machine

Published: 03 January 1989 Publication History

Abstract

Physicists believe that the world is described in terms of gauge theories. A popular technique for investigating these theories is to discretize them onto a lattice and simulate numerically by a computer, yielding so-called lattice gauge theory. Such computations require at least 1014 floating-point operations, necessitating the use of advanced architecture supercomputers such as the Connection Machine made by Thinking Machines Corporation. Currently the most important gauge theory to be solved is that describing the sub-nuclear world of high energy physics: Quantum Chromo-dynamics (QCD). The simplest example of a gauge theory is Quantum Electro-dynamics (QED), the theory which describes the interaction of electrons and photons. Simulation of QCD requires computer software very similar to that for the simpler QED problem. Our current QED code achieves a computational rate of 1.6 million lattice site updates per second for a Monte Carlo algorithm, and 7.4 million site updates per second for a microcanonical algorithm. The estimated performance for a Monte Carlo QCD code is 200,000 site updates per second (or 5.6 Gflops/sec).

References

[1]
D.J.E. Callaway and A. Rahman, Phys. Rev. Left. 49, 613 (1982); J. Polonyi and H.W. Wyld, Phys. Rev. Let/. 51, 2257 (1983)
[2]
s. Du~n~, N,d. Phys. B257, 652 (1985)
[3]
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon and D. Walker, Solving Problems on Concuvvent P,ocensors, Prentice-Hall, Englewood Cliffs, N.J. (1987)
[4]
M. Gardner, Mathematical Games, Scientific American, 106, Aug. 1972; E.N. Gilbert, Bell System Technical Journal 37, 815 (1958)
[5]
D. S. Greenberg, "Minimum Expansion Embedding of Meshes in Hypercubes", Yale University report, ~ALEU/DCS/TR-535 (1987)
[6]
W. Daniel Hillis, The Connection Machine, MIT Press (~985)
[7]
C.-T. Ho and S.L. Johnsson, "On the Embedding of arbitrary Meshes in Boolean cubes", International Conference on Parallel Processing, pp. 188-191 (1987)
[8]
S.L. Johnsson, "Communication E~cient Basic Linear Algebra Computations on I-Iypercube Architectures", Journal of Parallel and Distributed Computing 4, pp. 133-172 (1985)
[9]
M. Metcal{ and J. Reid, Fortran 8X Ezplained, Oxford Science Publishers (1987)
[10]
N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, J. Chem. Phys. 21, 1087 (1953)
[11]
E.M Reingold, J. Nievergelt and D. Deo, Combinatorial Algorithm~, Prentice-Ilall, Englcwood Cliffs, N.J. (~977)
[12]
J. Rose and G.B. Steele, "C*: An Extended C Language {or Data Parallel Programming", Second International Conference on Supercompufing (1987)
[13]
P. Rosenblum, "Using the Fortran 8X style of Protramming", Thinking Machines Corporation (1987)
[14]
Thinking Machines Corporation, "*Lisp Release Notes", (1987)
[15]
K.G. Wilson, Phys. Rev. D10, 2445 (1974)

Cited By

View all
  • (1989)What have we learnt from using real parallel machines to solve real problems?Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 210.1145/63047.63048(897-955)Online publication date: 3-Jan-1989
  • (1989)Large-scale problems and supercomputing in the Department of EnergyProceedings of the IEEE10.1109/5.3075377:7(1020-1037)Online publication date: Jul-1989

Index Terms

  1. QED on the connection machine

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    C3P: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
    January 1989
    1787 pages
    ISBN:0897912780
    DOI:10.1145/63047
    • Editor:
    • Geoffrey Fox
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 January 1989

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    Hypercube88
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 15 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (1989)What have we learnt from using real parallel machines to solve real problems?Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 210.1145/63047.63048(897-955)Online publication date: 3-Jan-1989
    • (1989)Large-scale problems and supercomputing in the Department of EnergyProceedings of the IEEE10.1109/5.3075377:7(1020-1037)Online publication date: Jul-1989

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media