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

New Simd Algorithms For Cluster Labeling On Parallel Computers

Author

Listed:
  • JOHN APOSTOLAKIS

    (Physics Department, Syracuse University, Syracuse, NY 13244, USA)

  • PAUL CODDINGTON

    (Physics Department, Syracuse University, Syracuse, NY 13244, USA)

  • ENZO MARINARI

    (Physics Department, Syracuse University, Syracuse, NY 13244, USA)

Abstract

Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine. We investigate their performance when applied to the cluster update of the two-dimensional Ising spin model. These algorithms could also be applied to other problems which use connected component labeling, such as percolation and image analysis.

Suggested Citation

  • John Apostolakis & Paul Coddington & Enzo Marinari, 1993. "New Simd Algorithms For Cluster Labeling On Parallel Computers," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 4(04), pages 749-763.
    • Handle: RePEc:wsi:ijmpcx:v:04:y:1993:i:04:n:s0129183193000628
    DOI: 10.1142/S0129183193000628
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183193000628
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183193000628?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.

    More about this item

    Statistics

    Access and download statistics

    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:04:y:1993:i:04:n:s0129183193000628. 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.