Message Passing Fundamentals Self Test

1.A shared memory computer has access to: a)the memory of other nodes via a proprietary high- speed communications network b)a directives-based data-parallel language c)a global memory space d)communication time

Self Test 2.A domain decomposition strategy turns out not to be the most efficient algorithm for a parallel program when: a)data can be divided into pieces of approximately the same size. b)the pieces of data assigned to the different processes require greatly different lengths of time to process. c)one needs the advantage of maintaining a single flow of control. d)one must parallelize a finite differencing scheme.

Self Test 3.In the message passing approach: a)serial code is made parallel by adding directives that tell the compiler how to distribute data and work across the processors. b)details of how data distribution, computation, and communications are to be done are left to the compiler. c)is not very flexible. d)it is left up to the programmer to explicitly divide data and work across the processors as well as manage the communications among them.

Self Test 4.Total execution time does not involve: a)computation time. b)compiling time. c)communications time. d)idle time.

Self Test 5.One can minimize idle time by: a)occupying a process with one or more new tasks while it waits for communication to finish so it can proceed on another task. b)always using nonblocking communications. c)never using nonblocking communications. d)frequent use of barriers.

Matching Question 1.Message passing 2.Domain decomposition 3.Idle time 4.Load balancing 5.Directives-based data parallel language 6.Distributed memory 7.Shared memory 8.Computation time 9.Functional decomposition 10.Communication time a)When each node has rapid access to its own local memory and access to the memory of other nodes via some sort of communications network. b)When multiple processor units share access to a global memory space via a high speed memory bus. c)Data are divided into pieces of approximately the same size, and then mapped to different processors. d)The problem is decomposed into a large number of smaller tasks and then the tasks are assigned to the processors as they become available. e)Serial code is made parallel by adding directives that tell the compiler how to distribute data and work across the processors. f)The programmer explicitly divides data and work across the processors as well as managing the communications among them. g)Dividing the work equally among the available processes. h)The time spent performing computations on the data. i)The time a process spends waiting for data from other processors. j)The time for processes to send and receive messages

Course Problem The initial problem implements a parallel search of an extremely large (several thousand elements) integer array. The program finds all occurrences of a certain integer, called the target, and writes all the array indices where the target was found to an output file. In addition, the program reads both the target value and all the array elements from an input file. Using these concepts of parallel programming, write a description of a parallel approach to solving the problem described above. (No coding is required for this exercise.)