Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism?

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
• The graph of tasks (nodes) and their interactions/data exchange (edges)?
• 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
• Which model is equally suitable to shared-address- space or message- passing paradigms, since the interaction is naturally two ways.
• CUDA thought that 'unifying theme' of every form of parallelism is
• Which of the following is not a form of parallelism supported by CUDA
• The style of parallelism supported on GPUs is best described as
• The VLIW architecture follows ..... approach to achieve parallelism.
• Which formulation of Dijkstra's algorithm exploits more parallelism