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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Efficient particle labeling in atomistic simulations | |
Autori: | ||
Data di pubblicazione: | 2007 | |
Rivista: | ||
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. | |
Handle: | http://hdl.handle.net/11584/16319 | |
Tipologia: | 1.1 Articolo in rivista |