UNIT-4: PARALLEL COMPUTER MODELS STRUCTURE - Csbdu.in

More documents

Recommendations

Info

Figure 4.3 The UMA multiprocessor model Approximated performance of a multiprocessor This example exposes the reader to parallel program execution on a shared memory multiprocessor system. Consider the following Fortran program written for sequential execution on a uniprocessor system. All the arrays , A(I), B(I), and C(I), are assumed to have N elements. L1: Do 10 I=1, N L2: A(I) = B(I) + C(I). L3: 10 Continue L4: SUM = 0. L5: Do 20 J = 1, N L6: SUM = SUM + A(J). L7: 20 Continue Suppose each line of code L2, L4, and L6 takes 1 machine cycle to execute. The time required to execute the program control statements L1, L3, L5, and L7 is ignored to simplify the analysis. Assume that k cycles are needed for each interprocessor communication operation via the shared memory. Initially, all arrays are assumed already loaded in the main memory and the short program fragment already loaded in the instruction cache. In other words instruction fetch and data loading overhead is ignored. Also, we ignore bus contention or memory access conflicts problems. In this way, we can concentrate on the analysis of CPU demand.
The above program can be executed on a sequential machine in 2N cycles under the above assumption. N cycles are needed to execute the N independent iterations in the I loop. Similarly, N cycles are needed for the J loop, which contains N recursive iterations. To execute the program on an M-processor system, we partition the looping operations into M sections with L= N/M elements per section. In the following parallel code, Doall declares that all M sections be executed by M processors in parallel. Doall K=1,M Do 10 I = L(K-1) + 1, KL A(I) = B(I) + C(I). 10 Continue SUM(K) = 0 Do 20 J = 1, L SUM(K) = SUM(K) + A(L(K – 1) + J) 20 Continue Endall For M-way parallel execution, the sectioned I loop can be done in L cycles. The sectioned J loop produces M partial sums in L cycles. Thus 2L cycles are consumed to produce all M partial sums. Still, we need to merge these M partial sums to produce the final sum of N elements. The NUMA Model: A NUMA multiprocessor is a shared-memory system in which the access time varies with the location of the memory word. Two NUMA machine models are depicted in the Figure 4.4 (a) Shared local memories
Page 1 and 2: STRUCTURE 4.0 Objectives 4.1 Introd
Page 3 and 4: (b) SIMD architecture (with distrib
Page 5 and 6: (f=1/T in megahertz). The size of a
Page 7 and 8: Programming Environments: The progr
Page 9: 4.2.4 Multiprocessors and Multicomp
Page 13 and 14: All clusters have equal access to t
Page 15 and 16: If the instructions are decoded as
Page 17 and 18: 4.2.6 PRAM and VLSI Models Theoreti
Page 19 and 20: Various combinations of the above o
Page 21 and 22: __ (b)Communication-limited bound o
Page 23: • In COMA model remote cache acce

UNIT-4: PARALLEL COMPUTER MODELS STRUCTURE - Csbdu.in

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?