Top 150+ Solved Muli-core Architectures and Programming MCQ Questions Answer

From 106 to 120 of 120

Q. An _____________ is a program that finds the solution to an n-body problemby simulating the behavior of the particles.

a. Two N-Body Solvers

b. n-body solver

c. n-body problem

d. Newton‘s second law

  • b. n-body solver

Q. For the reduced n-body solver, a ________________ will best distribute theworkload in the computation of the forces.

a. cyclic distribution

b. velocity of each particle

c. universal gravitation

d. gravitational constant

  • a. cyclic distribution

Q. Parallelizing the two n-body solvers using _______________ is very similar toparallelizing them using OpenMP.

a. thread‘s rank

b. function Loopschedule

c. Pthreads

d. loop variable

  • c. Pthreads

Q. The run-times of the serial solvers differed from the single-process MPIsolvers by ______________.

a. More than 1%

b. less than 1%

c. Equal to 1%

d. Greater than 1%

  • b. less than 1%

Q. Each node of the tree has an_________________ , that is, the cost of the partialtour.

a. Euler‘s method

b. associated cost

c. three-dimensional problems

d. fast function

  • a. Euler‘s method

Q. Using _____________ we can systematically visit each node of the tree that could possibly lead to a least-cost solution.

a. depth-first search

b. Foster‘s methodology

c. reduced algorithm

d. breadth first search

  • a. depth-first search

Q. The newly created stack into our private stack, set the newstack variable to_____________.

a. Infinite

b. Zero

c. NULL

d. None of the above

  • c. NULL

Q. The ____________________ is a pointer to a block of memory allocated by theuser program and buffersize is its size in bytes.

a. tour data

b. node tasks

c. actual computation

d. buffer argument

  • b. node tasks

Q. A _____________ function is called by Fulfillrequest.

a. descendants

b. Splitstack

c. dynamic mapping scheme

d. ancestors

  • b. Splitstack

Q. _____________ begins by checking on the number of tours that the processhas in its stack.

a. Terminated

b. Send rejects

c. Receive rejects

d. Empty

  • a. Terminated

Q. The ____________ is the distributed-memory version of the OpenMP busywait loop.

a. For loop

b. while(1) loop

c. Do while loop

d. Empty

  • b. while(1) loop

Q. ______________ sent to false and continue in the loop.

a. work_request

b. My_avail_tour_count

c. Fulfill_request

d. Split_stack packs

  • a. work_request

Q. ________________ takes the data in data to be packed and packs it intocontig_buf.

a. MPI Unpack

b. MPI_Pack

c. MPI_Datatype

d. MPI_Comm

  • b. MPI_Pack

Q. The _______________ function when executed by a process other than 0 sendsits energy to process 0.

a. Out of work

b. No_work_left

c. zero-length message

d. request for work

  • a. Out of work
Subscribe Now

Get All Updates & News