The length of the longest path in a task dependency graph is called?

Related MCQs

• In task dependency graph longest directed path between any pair of start and finish node is called as --------------
• A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
• Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
• Task dependency graph is ------------------
• 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
• The pattern of___________ among tasks is captured by what is known as a task-interaction graph?
• A complete graph is a graph in which each pair of vertices is adjacent
• In ------------task are defined before starting the execution of the algorithm
• work pool model uses ---------------- approach for task assignment
• Select relevant task characteristics from the options given below: