Efficient Shared-Array Accesses in Ab Initio Nuclear Structure Calculations on Multicore Architectures

TitleEfficient Shared-Array Accesses in Ab Initio Nuclear Structure Calculations on Multicore Architectures
Publication TypeBook Chapter
Year of Publication2012
AuthorsSrinivasa A, Sosonkina M, Maris P, Vary JP
EditorAli H, Shi Y, Khazanchi D, Lees M, VanAlbada GD, Dongarra J, Sloot PMA
Book TitleProceedings of the International Conference on Computational Science, ICCS 2012
CityAmsterdam
PublisherElsevier Science Bv
Volume9
Pages256-265
Series TitleProcedia Computer Science
ISBN Number1877-0509
Accession NumberWOS:000306288400026
KeywordsAb, affinity, initio nuclear structure calculation, memory, memory multiprocessors, Multithreaded execution, Nonuniform memory access (NUMA) node, physics calculations, Sparse matrix-vector multiply, Vector orthogonalization
Abstract

With the increase in the processing core counts on modern computing platforms, the main memory accesses present a considerable execution bottleneck, leading to poor scalability in multithreaded applications. Even when the memory is physically divided into separate banks, each associated with a set of cores, i.e., exhibiting the so called nonuniform memory access (NUMA) architecture, the access time to the shared data structures may be detrimental to the scalability. Hence, it is imperative to carefully map large shared arrays to specific memory banks based on the nature of the computation and the multithreaded parallelism characteristics. This paper describes memory-pinning strategies pertinent to sparse matrix-vector multiplication and vector orthogonalization phases of an ab initio nuclear structure computation performed by the MFDn package. Several nuclei and nuclear interactions were considered in the large-scale test cases with the dimensions of the sparse symmetric matrices ranging from 32 million to 320 million. Performance gains of up to 25% were observed with the proposed strategies as compared to the default memory placement policy.

URL<Go to ISI>://WOS:000306288400026
DOI10.1016/j.procs.2012.04.027