IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v03y1992i06ns0129183192000853.html
   My bibliography  Save this article

A Parallel Cluster Labeling Method For Monte Carlo Dynamics

Author

Listed:
  • MIKE FLANIGAN

    (Thinking Machines Corp., 245 First. St., Cambridge, MA 02142, USA)

  • PABLO TAMAYO

    (Thinking Machines Corp., 245 First. St., Cambridge, MA 02142, USA)

Abstract

We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processing nodes. The method divides physical space into rectangular cells which are assigned to processing nodes and combines a serial procedure, by which clusters are labeled locally inside each cell, with a nearest neighbor relaxation process in which processing nodes exchange labels until a fixed point is reached. By controlling overhead and reducing inter-processor communication this method attains good performance and speed-up. The complexity and scaling properties of the algorithm are analyzed. The algorithm has been used to simulate large two-dimensional Ising systems (up to27808×27808sites) with Swendsen-Wang dynamics. Typical updating times on the order of 82 nanosecs/site and efficiencies larger than 90% have been obtained using 256 processing nodes on the CM-5 supercomputer.

Suggested Citation

  • Mike Flanigan & Pablo Tamayo, 1992. "A Parallel Cluster Labeling Method For Monte Carlo Dynamics," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 3(06), pages 1235-1249.
    • Handle: RePEc:wsi:ijmpcx:v:03:y:1992:i:06:n:s0129183192000853
    DOI: 10.1142/S0129183192000853
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183192000853
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183192000853?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hackl, R. & Matuttis, H.-G. & Singer, J.M. & Husslein, Th. & Morgenstern, I., 1994. "Efficient parallelization of the 2D Swendsen-Wang algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 212(3), pages 261-276.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:03:y:1992:i:06:n:s0129183192000853. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.