The following FORTRAN program is to be executed on a computer, and a parallel version is to be executed on a 32-computer cluster.

Suppose lines 2 and 4 each take two machine cycle times, including all processor and memory-access activities. Ignore the overhead caused by the software loop control statements (lines 1, 3, 5) and all other system overhead and resource conflicts.
a. What is the total execution time (in machine cycle times) of the program on a single computer?
b. Divide the I-loop iterations among the 32 computers as follows: Computer 1 executes the first 32 iterations processor 2 executes the next 32 iterations, and so on. What are the execution time and speedup factor compared with part (a)? (Note that the computational workload, dictated by the J-loop, is unbalanced among the computers.)
c. Explain how to modify the parallelizing to facilitate a balanced parallel execution of all the computational workload over 32 computers. By a balanced load is meant an equal number of additions assigned to each computer with respect to both loops.
d. What is the minimum execution time resulting from the parallel execution on 32 computers? What is the resulting speedup over a single computer?

Transcribed Image Text:

LI: し2: L3 L4: 20 し5:10 DO 10 I = 1,1024 SUM(I) 0 DO 20 J = 1,1 SUM(I) = SUM(I) + 1 CONTINUE