Vectorized program for Monte Carlo simulation of self-avoiding walks

Alberto Berretti, Alan D. Sokal

    Research output: Contribution to journalArticlepeer-review


    We show how the Monte Carlo algorithm for the self-avoiding walk previously introduced by the authors can be efficiently vectorized on a Cray computer system with gather/scatter hardware (e.g. Cray X-MP or Cray 2). To represent the configuration of the walk we employ a peculiar type of data structure (the "sliding bit table") which allows the simulation of walks in a practically infinite lattice, while still having short access time to the status of a site.

    Original languageEnglish (US)
    Pages (from-to)1-16
    Number of pages16
    JournalComputer Physics Communications
    Issue number1-2
    StatePublished - 1990

    ASJC Scopus subject areas

    • Hardware and Architecture
    • General Physics and Astronomy


    Dive into the research topics of 'Vectorized program for Monte Carlo simulation of self-avoiding walks'. Together they form a unique fingerprint.

    Cite this