McqMate

Q. |
## Speedup obtained when the problem size is _______ linearly with the number of processing elements. |

A. | increase |

B. | constant |

C. | decreases |

D. | depend on problem size |

Answer» A. increase |

905

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements?
- The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements.
- Speedup tends to saturate and efficiency _____ as a consequence of Amdahl’s law.
- The number and size of tasks into which a problem is decomposed determines the __
- The number and size of tasks into which a problem is decomposed determines the?
- The___ time collectively spent by all the processing elements Tall = p TP?
- Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
- In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.
- ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
- The number of tasks into which a problem is decomposed determines its?