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.

Related MCQs

• 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?
• Parallel algorithms often require a single process to send identical data to all other processes or to a subset of them. This operation is known as _________?
• A single control unit that dispatches the same Instruction to various processors is?
• The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.
• The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.
• The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
• The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as                       .
• Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
• Which of the following is a combination of several processors on a single chip?
• to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm