MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS
A Monte Carlo simulation of a simple statistical physics model is decomposed onto a multi-processor (transputer) array in two essentially different ways: using 'geometric' and 'algorithmic' concurrency. The geometric decomposition (in which each processor handles a small sector o...
Main Authors: | , , , , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
1988
|
_version_ | 1826289138156961792 |
---|---|
author | Askew, C Carpenter, D Chalker, J Hey, A Moore, M Nicole, D Pritchard, D |
author_facet | Askew, C Carpenter, D Chalker, J Hey, A Moore, M Nicole, D Pritchard, D |
author_sort | Askew, C |
collection | OXFORD |
description | A Monte Carlo simulation of a simple statistical physics model is decomposed onto a multi-processor (transputer) array in two essentially different ways: using 'geometric' and 'algorithmic' concurrency. The geometric decomposition (in which each processor handles a small sector of the physical system) is characterized by high efficiency in utilization of processors, and relative simplicity in programming. The algorithmic decomposition (in which each processor handles a small sub-task of the full algorithm, typically in a pipelined mode) is characterized by greater flexibility in the data-size (size of the physical system) and minimal memory requirements for a majority of the processors in the array. These assertions are made concrete in relation to our specific problem (a two-dimensional spin system simulation) which is, in many respects representative of a wide class of problems of interest to theoretical physicists. © 1988. |
first_indexed | 2024-03-07T02:24:20Z |
format | Journal article |
id | oxford-uuid:a5121925-13a2-4a5a-997c-4f7438474dc4 |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-07T02:24:20Z |
publishDate | 1988 |
record_format | dspace |
spelling | oxford-uuid:a5121925-13a2-4a5a-997c-4f7438474dc42022-03-27T02:37:52ZMONTE-CARLO SIMULATION ON TRANSPUTER ARRAYSJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:a5121925-13a2-4a5a-997c-4f7438474dc4EnglishSymplectic Elements at Oxford1988Askew, CCarpenter, DChalker, JHey, AMoore, MNicole, DPritchard, DA Monte Carlo simulation of a simple statistical physics model is decomposed onto a multi-processor (transputer) array in two essentially different ways: using 'geometric' and 'algorithmic' concurrency. The geometric decomposition (in which each processor handles a small sector of the physical system) is characterized by high efficiency in utilization of processors, and relative simplicity in programming. The algorithmic decomposition (in which each processor handles a small sub-task of the full algorithm, typically in a pipelined mode) is characterized by greater flexibility in the data-size (size of the physical system) and minimal memory requirements for a majority of the processors in the array. These assertions are made concrete in relation to our specific problem (a two-dimensional spin system simulation) which is, in many respects representative of a wide class of problems of interest to theoretical physicists. © 1988. |
spellingShingle | Askew, C Carpenter, D Chalker, J Hey, A Moore, M Nicole, D Pritchard, D MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title | MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title_full | MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title_fullStr | MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title_full_unstemmed | MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title_short | MONTE-CARLO SIMULATION ON TRANSPUTER ARRAYS |
title_sort | monte carlo simulation on transputer arrays |
work_keys_str_mv | AT askewc montecarlosimulationontransputerarrays AT carpenterd montecarlosimulationontransputerarrays AT chalkerj montecarlosimulationontransputerarrays AT heya montecarlosimulationontransputerarrays AT moorem montecarlosimulationontransputerarrays AT nicoled montecarlosimulationontransputerarrays AT pritchardd montecarlosimulationontransputerarrays |