McqMate

Q. |
## In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION |

A. | true |

B. | false |

Answer» A. true |

1.8k

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- 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
- A complete graph is a graph in which each pair of vertices is adjacent
- 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
- 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.
- In task dependency graph longest directed path between any pair of start and finish node is called as --------------
- In which case, the owner computes rule implies that the output is computed by the process to which the output data is assigned?
- The Owner Computes Rule generally states that the process assigned a particular data item is responsible for?
- The Owner Computes Rule generally states that the process assigned a particular data item are responsible for?
- Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)