Parallel Algorithms for the Exascale Era

Robey, Robert W.¹ 

[1] Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

关键词: Parallel Algorithms;    reproducible global sums;    enhanced precision sums;    spatial hashing;   

DOI  :  10.2172/1330080
RP-ID  :  LA-UR--16-28005
PID  :  OSTI ID: 1330080

学科分类：数学（综合）

美国|英语

来源: SciTech Connect

【 摘 要 】

New parallel algorithms are needed to reach the Exascale level of parallelism with millions of cores. We look at some of the research developed by students in projects at LANL. The research blends ideas from the early days of computing while weaving in the fresh approach brought by students new to the field of high performance computing. We look at reproducibility of global sums and why it is important to parallel computing. Next we look at how the concept of hashing has led to the development of more scalable algorithms suitable for next-generation parallel computers. Nearly all of this work has been done by undergraduates and published in leading scientific journals.