Final Report: Programming Models for Shared Memory Clusters

May, J. ; de Supinski, B. ; Pudliner, B. ; Taylor, S. ; Baden, S.

Lawrence Livermore National Laboratory

关键词: Computer Architecture;    99 General And Miscellaneous//Mathematics, Computing, And Information Science;    Mathematical Models;    Parallel Processing;    Memory Management;   

DOI  :  10.2172/792330
RP-ID  :  URCL-ID-137002
RP-ID  :  W-7405-Eng-48
RP-ID  :  792330

美国|英语

来源: UNT Digital Library

【 摘 要 】

Most large parallel computers now built use a hybrid architecture called a shared memory cluster. In this design, a computer consists of several nodes connected by an interconnection network. Each node contains a pool of memory and multiple processors that share direct access to it. Because shared memory clusters combine architectural features of shared memory computers and distributed memory computers, they support several different styles of parallel programming or programming models. (Further information on the design of these systems and their programming models appears in Section 2.) The purpose of this project was to investigate the programming models available on these systems and to answer three questions: (1) How easy to use are the different programming models in real applications? (2) How do the hardware and system software on different computers affect the performance of these programming models? (3) What are the performance characteristics of different programming models for typical LLNL applications on various shared memory clusters?