In task dependency graph longest directed path between any pair of start and finish node is called as --------------

Related MCQs

• The length of the longest path in a task dependency graph is called?
• A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
• A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
• Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
• Task dependency graph is ------------------
• A complete graph is a graph in which each pair of vertices is adjacent
• Topological sort of a Directed Acyclic graph is?
• 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
• In a eight node ring, node ____ is source of broadcast
• In the scatter operation ____ node send message to every other node