Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 1993 | public
Book Section - Chapter

Monte Carlo simulations of Quantum systems on massively parallel computers

Abstract

A large class of quantum physics applications uses operator representations that are discrete integers by nature. This class includes magnetic properties of solids, interacting bosons modeling super fiuids and Coo~er pairs in superconductors, and Hubbard models for strongly correlated electrons systems. This kind of application typically uses integer data representations and the resulting algorithms are dominated entirely by integer operations. We implemented an efficient algorithm for one such application on the Intel Touchstone Delta and iPSC/860. The algorithm uses a multispin coding technique which allows significant data compactification and efficient vectorization of Monte Carlo updates. The algorithm regularly switches between two data decompositions, corresponding naturally to different Monte Carlo updating processes and observable measurements such that only nearest-neighbor communications are needed within a given decomposition. On 128 nodes of Intel Delta, this algorithm updates 183 million spins per second (compared to 21 million on CM-2 and 6.2 million on a Cray Y-MP). A systematic performance analysis shows a better than 90% efficiency in the parallel implementation.

Additional Information

© 1993 ACM. I wish to thank Miloje Makivic for a collaboration in the early stage of this project and Geoffrey Fox for much encouragement. I thank Roy Williams and Tina Mihaly for careful proofreading of this manuscript. This work began as a project in the Caltech Concurrent Computation Program and is now supported by the Concurrent Supercomputing Consortium administrated through Caltech and the Caltech Concurrent Supercomputing Facility. I thank Paul Messina and Mary Maloney for their support which made the present work possible.

Additional details

Created:
August 20, 2023
Modified:
October 23, 2023