高性能处理器体系结构TLSharedMemorymultirocessors共享存储多处理器.ppt

* * Mapping Binding processes to physical processors. Time to reach processor across network does not depend on which processor (roughly). lots of old literature on “network topology”, no longer so important. Basic issue is how many remote accesses. * * Example s = f(A[1]) + … + f(A[n]) Decomposition computing each f(A[j]) n-fold parallelism, where n may be p computing sum s Assignment thread k sums sk = f(A[k*n/p]) + … + f(A[(k+1)*n/p-1]) thread 1 sums s = s1+ … + sp (for simplicity of this example) thread 1 communicates s to other threads Orchestration starting up threads communicating, synchronizing with thread 1 Mapping processor j runs thread j * * Threads and thread teams in OpenMP A thread is a (lightweight) process - an instance of a program + its data. Each thread can follow its own flow of control through a program. Threads can share data with other threads, but also have private data. Threads communicate with each other via the shared data. A thread team is a set of threads which co-operate on a task. The master thread is responsible for co-ordinating the team. PC PC PC Private data Private data Private data Shared data Thread 1 Thread 2 Thread 3 * * OpenMP Programming Model Thread based Parallelism A shared memory process can consist of multiple threads Compiler Directive Based Explicit Parallelism OpenMP is an explicit (not automatic) programming model, offering the programmer full control over parallelization OpenMP parallelism is specified through the use of compiler directives which are imbedded in the source coded Nested Parallelism support Supports parallel constructs inside other parallel constructs Dynamic Threads Provision for dynamically altering the number of threads which may be used to execute different parallel regions * * OpenMP Execution Model OpenMP uses the fork-join model of parallel execution Fork-Join model All OpenMP programs begin as a single process – the master thread. Which executes sequentially until the first pa