Q. workload in the computation of the forces.

  • (A) . cyclic distribution
  • (B) . velocity of each particle
  • (C) . universal gravitation
  • (D) . gravitational constant
πŸ’¬ Discuss
βœ… Correct Answer: (B) . velocity of each particle

Q. parallelizing them using OpenMP.

  • (A) . thread‘s rank
  • (B) . function loopschedule
  • (C) . pthreads
  • (D) . loop variable
πŸ’¬ Discuss
βœ… Correct Answer: (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
πŸ’¬ Discuss
βœ… Correct Answer: (C) . three-dimensional problems

Q. could possibly lead to a least-cost solution.

  • (A) . depth-first search
  • (B) . foster‘s methodology
  • (C) . reduced algorithm
  • (D) . breadth first search
πŸ’¬ Discuss
βœ… Correct Answer: (C) . reduced algorithm

Q. user program and buffersize is its size in bytes.

  • (A) . tour data
  • (B) . node tasks
  • (C) . actual computation
  • (D) . buffer argument
πŸ’¬ Discuss
βœ… Correct Answer: (A) . tour data

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
πŸ’¬ Discuss
βœ… Correct Answer: (C) . expensive tours

Q. has in its stack.

  • (A) . terminated
  • (B) . send rejects
  • (C) . receive rejects
  • (D) . empty
πŸ’¬ Discuss
βœ… Correct Answer: (D) . empty

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

  • (A) . mpi unpack
  • (B) . mpi_pack
  • (C) . mpi_datatype
  • (D) . mpi_comm
πŸ’¬ Discuss
βœ… Correct Answer: (C) . mpi_datatype

Jump to