We provide a theoretical analysis of the communication
requirements of parallel algorithms for molecular dynamic simulations.
This paper contributes some improvements and a more precise analysis of
communication, for previously used algorithms. It defines a new
algorithm with improved communication. It analyzes it, both for a
machine with a complete graph topology and for a machine with a mesh
topology, and proves matching lower bounds on communication complexity.
By: Marc Snir
Published in: RC22059 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .