McqMate

Q. |
## the cost of the parallel algorithm is higher than the sequential run time by a factor of __ |

A. | 2020-03-02 00:00:00 |

B. | 2020-02-03 00:00:00 |

C. | 3*2 |

D. | 2/3+3/2 |

Answer» A. 2020-03-02 00:00:00 |

1.3k

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- The search overhead factor of the parallel system is defined as the ratio of the work done by the parallel formulation to that done by the sequential formulation
- 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
- CUDA Hardware programming model supports: a) fully generally data-parallel archtecture; b) General thread launch; c) Global load-store; d) Parallel data cache; e) Scalar architecture; f) Integers, bit operation
- If we port algorithm to higher dimemsional network it would cause
- 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.
- A parallel algorithm is evaluated by its runtime in function of
- efficiency of data parallel algorithm depends on the
- which of the following is not an parallel algorithm model
- Which of the following is not parallel algorithm model