Parallel Distributed Programming Quiz 2

Choose the most accurate (CORRECT) statement:

• Scalability is a measure of the capacity to increase speedup in proportion to the number of processors

• Efficiency is the ratio of the serial run time of the best sequential algorithm for solving a problem to the time taken by the parallel algorithm to solve the same problem on p processors

• Run time is the time that elapses from the moment a parallel computation starts to the moment the last processor finishes.

• Superlinear is the fraction of time for which a processor is usefully employed

Parallelism can be used to increase the (parallel) size of the problem is applicable in ___________________.

• Amdahl's Law

• Gustafson-Barsis's Law

• Newton's Law

• Pascal's Law

____________ is due to load imbalance, synchronization, or serial components as parts of overheads in parallel programs.

• Interprocess interaction

• Synchronization

• Idling

• Excess computation

Which of the following parallel methodological design elements focuses on recognizing opportunities for parallel execution?

• Partitioning

• Communication

• Aggromeration

• Mapping

Domain and functional decomposition are considered in the following parallel methodological design elements, EXCEPT:

• Partitioning

• Communication

• Agglomeration

• Mapping

Which of the following parallel algorithm models is applicable to web server?

• Task graph

• Work pool

• Master-slave

• Pipeline

Synchronization is one of the common issues in parallel programming. The issues related to synchronization include the followings, EXCEPT:

• Deadlock

• Livelock

• Fairness

• Correctness

Considering to use weak or strong scaling is part of ______________ in addressing the challenges of distributed memory programming.

• Splitting the problem

• Speeding up computations

• Speeding up communication

• Speeding up hardware

Which of the followings is the BEST description of Message Passing Interface (MPI)?

• A specification of a shared memory library

• MPI uses objects called communicators and groups to define which collection of processes may communicate with each other

• Only communicators and not groups are accessible to the programmer only by a "handle"

• A communicator is an ordered set of processes