Multi-core Strategies For Particle Methods. Williams, J. R, Holmes, D., & Tilke, P. 0.
doi  abstract   bibtex   
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application to a wide range of numerical simulation problems. Such problems involve time stepping or iteration algorithms where synchronization of multiple threads of execution is required. It is shown that traditional approaches to parallelism including message passing and scatter-gather can be improved upon in terms of speed-up and memory management. Using spatial decomposition to create orthogonal computational tasks, a new task management algorithm called H-Dispatch is developed. This algorithm makes efficient use of memory resources by limiting the need for garbage collection and takes optimal advantage of multiple cores by employing a “hungry” pull strategy. The technique is demonstrated on a simple finite difference solver and results are compared to traditional MPI and scatter-gather approaches. The H-Dispatch approach achieves near linear speed-up with results for efficiency of 85% on a 24-core machine. It is noted that the H-Dispatch algorithm is quite general and can be applied to a wide class of computational tasks on heterogeneous architectures involving multi-core and GPGPU hardware.
@article{Williams_Multi,
  pages={11-17},
  author={Williams, John R and Holmes, David and Tilke, Peter},
  title={Multi-core Strategies For Particle Methods},
  issn={0010-4655},
  abstract={In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application to a wide range of numerical simulation problems. Such problems involve time stepping or iteration algorithms where synchronization of multiple threads of execution is required. It is shown that traditional approaches to parallelism including message passing and scatter-gather can be improved upon in terms of speed-up and memory management. Using spatial decomposition to create orthogonal computational tasks, a new task management algorithm called {H-Dispatch} is developed. This algorithm makes efficient use of memory resources by limiting the need for garbage collection and takes optimal advantage of multiple cores by employing a “hungry” pull strategy. The technique is demonstrated on a simple finite difference solver and results are compared to traditional {MPI} and scatter-gather approaches. The {H-Dispatch} approach achieves near linear speed-up with results for efficiency of 85\% on a 24-core machine. It is noted that the {H-Dispatch} algorithm is quite general and can be applied to a wide class of computational tasks on heterogeneous architectures involving multi-core and {GPGPU} hardware.},
  doi={10.1016/j.cpc.2009.10.009},
  year={0}
}
Downloads: 0