1) In the dual-pass ring termination algorithm, the token is colored black when
ID: 3560297 • Letter: 1
Question
1) In the dual-pass ring termination algorithm, the token is colored black when
A. it is passed on by a black process
B. it is passed on by a white process
C. it has reached the first process p0
2)When sending a message, if the routine returns after the local actions complete, though the message transfer may not have been completed, the routine is
A. a blocking routine
B. a non-blocking routine
C. a synchronous routine
D. an asynchronous routine
3) Which load balancing technique is used in the following system?
A. decentralized dynamic load balancing
B. fully distributed work pool
C. centralized dynamic load balancing
D. static load balancing
4) If we use tree structured communication to distribute an array of 16 elements evenly across a set of 8 processes, each process compute the partial sum, and then we use the same tree structure to combine partial sums to the root process. how many steps are needed in the communication, including data distribution and partial sum combination?
D. it is generated by the first process p0
Explanation / Answer
1)
B. it is passed on by a white process
2)
A. a blocking routine
3)
D . Static load-balancing
Distribute the work among processors prior to the execution of
the algorithm
Example: Matrix-Matrix Computation
Easy to design and implement
A . Dynamic load-balancing
Distribute the work among processors during the execution of
the algorithm
Algorithms that require dynamic load-balancing are somewhat
more complicated (Examples: Parallel Graph Partitioning and
Adaptive Finite Element Computations)
Tasks are passed between arbitrary processes.
A collection of worker processes operate upon the problem and
interact among themselves, finally reporting to a single process.
A worker process may receive tasks from other worker processes
and may send tasks to other worker processes (to complete or
pass on at their discretion).
C . Master process(or) holds the collection of tasks to be
performed.
Tasks are sent to the slave processes. When a slave
process completes one task, it requests another task from
the master process
Tasks handed out from a centralized location. Master-slave
structure.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.