Partitioning 3D space for parallel many-particle simulations

Simple item page
dc.creatorStijnman, M. A.
dc.creatorBisseling, R. H.
dc.creatorBarkema, G. T.
dc.date2001-05-14
dc.date.accessioned2026-07-07T02:41:24Z
dc.date.available2026-07-07T02:41:24Z
dc.descriptionIn a common approach for parallel processing applied to simulations of many-particle systems with short-ranged interactions and uniform density, the simulation cell is partitioned into domains of equal shape and size, each of which is assigned to one processor. We compare the commonly used simple-cubic (SC) domain shape to domain shapes ch osen as the Voronoi cells of BCC and FCC lattices. The latter two are found to result in superior partitionings with respect to c ommunication overhead. Other domain shapes, relevant for a small number of processors, are also discussed. The higher efficiency with BCC and FCC partitionings is demonstrated in simulations of the sillium model for amorphous silicon.
dc.description12 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0105272
dc.identifierhttp://arxiv.org/abs/cond-mat/0105272
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/17730
dc.subjectMaterials Science
dc.subjectSoft Condensed Matter
dc.subjectComputational Physics
dc.titlePartitioning 3D space for parallel many-particle simulations
dc.typetext

Files

Collections

arXiv