The authors develop an efficient particle labeling procedure based on a linked cell algorithm which is shown to reduce the computing time for a molecular dynamics simulation by a factor of 3. They prove that the improvement of performance is due to the efficient fulfillment of both spatial and temporal locality principles, as implemented by the contiguity of labels corresponding to interacting atoms. Finally, they show that the present label reordering procedure can be used to devise an efficient parallel one-dimensional domain decomposition molecular dynamics scheme.
Efficient particle labeling in atomistic simulations
COLOMBO, LUCIANO
2007-01-01
Abstract
The authors develop an efficient particle labeling procedure based on a linked cell algorithm which is shown to reduce the computing time for a molecular dynamics simulation by a factor of 3. They prove that the improvement of performance is due to the efficient fulfillment of both spatial and temporal locality principles, as implemented by the contiguity of labels corresponding to interacting atoms. Finally, they show that the present label reordering procedure can be used to devise an efficient parallel one-dimensional domain decomposition molecular dynamics scheme.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.