Top 80+ Solved Multi-core processors MCQ Questions Answer
Q. them in this case and returning the result to a single process.
a. mpi _ reduce
b. mpi_ bcast
c. mpi_ finalize
d. mpi_ comm size
Q. The easiest way to create communicators with new groups is with .
a. mpi_comm_rank
b. mpi_comm_create
c. mpi_comm_split
d. mpi_comm_group
Q. is an object that holds information about the received message, including, for example, it’s actually count.
a. buff
b. count
c. tag
d. status
Q. The operation similarly computes an element-wise reduction of vectors, but this time leaves the result scattered among the processes.
a. reduce-scatter
b. reduce (to-one)
c. allreduce
d. none of the above
Q. is applicable in ___________________.
a. . amdahl\s law
b. . gustafson-barsis\s law
c. . newton\s law
d. . pascal\s law
Q. programming. The issues related to synchronization include the followings, EXCEPT:
a. . deadlock
b. . livelock
c. . fairness
d. . correctness
Q. Interface (MPI)?
a. . a specification of a shared memory library
b. . mpi uses objects called communicators and groups to define which collection of processes may communicate with each other
c. . only communicators and not groups are accessible to the programmer only by a "handle"
d. . a communicator is an ordered set of processes
Q. workload in the computation of the forces.
a. . cyclic distribution
b. . velocity of each particle
c. . universal gravitation
d. . gravitational constant
Q. parallelizing them using OpenMP.
a. . thread‘s rank
b. . function loopschedule
c. . pthreads
d. . loop variable
Q. Each node of the tree has an , that is, the cost of the partial tour.
a. . euler‘s method
b. . associated cost
c. . three-dimensional problems
d. . fast function
Q. could possibly lead to a least-cost solution.
a. . depth-first search
b. . foster‘s methodology
c. . reduced algorithm
d. . breadth first search
Q. user program and buffersize is its size in bytes.
a. . tour data
b. . node tasks
c. . actual computation
d. . buffer argument
Q. addition to the cost of the communication, the packing and unpacking is very .
a. . global least cost
b. . time- consuming
c. . expensive tours
d. . shared stack