Parallelized link cells algorithm

Smith has also described the implementation of MD on parallel machines, with particular reference to hypercube computers. In work designed to introduce a novice to the main aspects of parallel computing in MD, Smith described three particular algorithms replicated data (RD), systolic loop (SLS-G), and parallelized link cells (PLC), all of which have good load balancing. The performance characteristics of each algorithm and the factors affecting... 

M. R. S. Pinches, D. J. Tildesley, and W. Smith, Mol. Stimulation, 6, 51 (1991). Large Scale Molecular Dynamics on Parallel Computers Using the Link-Cell Algorithm. 

Pinches, Tildesley, and Smith presented details of a parallel algorithm based on the linked-cell technique for systems of atoms in two and three dimensions using a number of decompositions into subunits. i The algorithm was tested on an Intel iPSC/2 and on a Cray X-MP/416, and the results were presented for simulations of up to 2 X 10 atoms. 

Brown, Clarke, Okuda, and Yamazaki also adopted a domain decomposition parallelization strategy on the Fujitsu API 000 machine. " They describe an algorithm that is a development of a spatial decomposition technique due to Liem and co-workers but incorporated decomposition of three-dimensional space in all three dimensions with linked-cell and neighbor table techniques for enhanced efficiency. Communications between processors were minimized without incurring the penalties associated with redundant force calculation. 

---