《高性能处理器体系结构》TLP-Shared Memory Multiprocessors共享存储多处理器.pptVIP

* * 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