The graph of tasks (nodes) and their interactions/data exchange (edges)?

Related MCQs

• 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
• All nodes collects _____ message corresponding to √p nodes to their respectively
• The pattern of___________ among tasks is captured by what is known as a task-interaction graph?
• Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?
• A complete graph is a graph in which each pair of vertices is adjacent
• The primary forms of data exchange between parallel tasks are?
• Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
• Time Complexity of DFS is? (V – number of vertices, E – number of edges)
• The number and size of tasks into which a problem is decomposed determines the __
• Multiprocessor is systems with multiple CPUs, which are capable of independently executing different tasks in parallel. In this category every processor and memory module has similar access time?