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

Cluster Vs. Single-Spin Algorithms—Which Are More Efficient?

Author

Listed:
  • N. ITO

    (Computing and Information Systems Center, Japan Atomic Energy Research Institute, Tokai, Ibaraki 319–11, Japan)

  • G.A. KOHRING

    (HLRZ, KFA Jülich, Postfach 1913, D-5170 Jülich, Germany)

Abstract

A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms of site updates per second or the dynamical critical exponents. Our main result is that the cluster algorithms become more efficient when the system size,Ld, exceeds,L~70–300ford=2andl~80–200ford=3. The exact value of the crossover is dependent upon the computer being used. The lower end of the crossover range is typical of workstations while the higher end is typical of vector computers. Hence, even for workstations, the system sizes needed for efficient use of the cluster algorithm is relatively large.

Suggested Citation

  • N. Ito & G.A. Kohring, 1994. "Cluster Vs. Single-Spin Algorithms—Which Are More Efficient?," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 5(01), pages 1-14.
    • Handle: RePEc:wsi:ijmpcx:v:05:y:1994:i:01:n:s0129183194000027
    DOI: 10.1142/S0129183194000027
    as

    Download full text from publisher

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

    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:05:y:1994:i:01:n:s0129183194000027. 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.