@article{1ebc32fef1914e7496d05cc5bc22e5bb,
title = "Vectorized program for Monte Carlo simulation of self-avoiding walks",
abstract = "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.",
author = "Alberto Berretti and Sokal, {Alan D.}",
note = "Funding Information: * pour Ia Recherche Scientifique (A. B.) and the US National Science Foundation grants PHY-8413569 and DMS-8705599 (A.D. S.). Address after 1 October 1988: Dipartimento di Matematica, Funding Information: We warmly thank Manuela D{\textquoteright}Onofrio for sharing with us her idea of the sliding bit table. We also thank a referee for helpful comments. Computer time on the Cray X-MP-48 at CINECA (Bologna) was generously provided by the Gruppo Nazionale per la Fisica Matematica and Profs. Vinicio Boffi and Brunello Tirozzi; time on the Cray 1S-2000 and Cray 2 at GASOY (Lausanne) was provided by the Institut de Physique Th{\'e}orique, EPFL, Lausanne. The staffs of CINECA and GASOV gave us valuable assistance in using these machines. The authors{\textquoteright} research was supported in part by the Fonds National Suisse pour la Recherche Scientifique (A.B.) and the US National Science Foundation grants PHY-8413569 and DMS-8705599 (A.D.S.).",
year = "1990",
doi = "10.1016/0010-4655(90)90131-J",
language = "English (US)",
volume = "58",
pages = "1--16",
journal = "Computer Physics Communications",
issn = "0010-4655",
publisher = "Elsevier B.V.",
number = "1-2",
}