Exploiting Processor Groups to Extend Scalability of the GA Shared Memory Programming Model

Conference · Wed May 04 04:00:00 EDT 2005

DOI:https://doi.org/10.1145/1062261.1062305· OSTI ID:965625

Nieplocha, Jarek; Krishnan, Manoj Kumar; Palmer, Bruce J; Tipparaju, Vinod; Zhang, Yeliang

Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. This paper discusses the requirements, functionality and development of multilevel-parallelism based on processor groups in the context of the Global Array (GA) shared memory programming model. The main effort involves management of shared data, rather than interprocessor communication. Experimental results for the NAS NPB Conjugate Gradient benchmark and a molecular dynamics (MD) application are presented for a Linux cluster with Myrinet and illustrate the value of the proposed approach for improving scalability. While the original GA version of the CG benchmark lagged MPI, the processor-group version outperforms MPI in all cases, except for a few points on the smallest problem size. Similarly, the group version of the MD application improves execution time by 58% on 32 processors.

• Research Organization: Pacific Northwest National Laboratory (PNNL), Richland, WA (US)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 965625
• Report Number(s): PNNL-SA-44286
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS
BENCHMARKS
COMPUTER NETWORKS
DATA TRANSMISSION
MEMORY MANAGEMENT
MOLECULAR DYNAMICS METHOD
PROGRAMMING