{
  "annotation_id": "650babb8-0e5d-4f44-9a3e-3f0b624dc4e3",
  "date_created": "2026-03-02T18:01:25.130000Z",
  "date_modified": "2026-03-02T18:01:25.130000Z",
  "file_hash": "aba3aa9dd500007375d80733ee32c7bbc012ddee0aa4434dcc34ea54bf0b1e82",
  "private": false,
  "record": {
    "abstract": "We show that the latest version of massively parallel processing associative\nstring processing architecture (System-V) is applicable for fast Monte Carlo\nsimulation if an effective on-processor random number generator is implemented.\nOur lagged Fibonacci generator can produce $10^8$ random numbers on a processor\nstring of 12K PE-s. The time dependent Monte Carlo algorithm of the\none-dimensional non-equilibrium kinetic Ising model performs 80 faster than the\ncorresponding serial algorithm on a 300 MHz UltraSparc.",
    "arxiv_id": "physics/9909054",
    "authors": [
      "G. Odor",
      "A. Krikelis",
      "F. Vesztergombi",
      "F. Rohrbach"
    ],
    "categories": [
      "physics.comp-ph",
      "cond-mat.stat-mech",
      "hep-lat"
    ],
    "doi": "10.1109/EMPDP.1999.746690",
    "journal_ref": "Proceedings of the 7-th Euromicro workshop on parallel and\n  distributed processing, Funchal (Portugal) 1999, IEEE Computer society press,\n  Los Alamitos CA, Ed.: B. Werner",
    "title": "Effective Monte Carlo simulation on System-V massively parallel   associative string processing architecture",
    "url": "https://arxiv.org/abs/physics/9909054"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6ecf21d3-7a07-4c00-aeb2-f10ddb5a554a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}