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

Home / Engineering / High Performance Computing / Question

M

Mr. Dubey • 51.43K Points
Coach

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

(A) is referred to as a task interaction graph

(B) is referred to as a task communication graph

(C) is referred to as a task interface graph

(D) none of above

Correct answer : Option (A) - is referred to as a task interaction graph

Share

Discusssion

Login to discuss.

Related MCQs on High Performance Computing

Q. Which of the following statement regarding sets is false?

Q. Example of dictionary based compression is

Q. The command echo welcome > /dev / tty

Q. Which of the following is a faulty S-AES step function?

Q. allows individual row operation to be performed on a given result set or on the generated by a selected by a selected statement.

Q. An assertion that contains one or more variable is called a….

Q. The time required for a pulse to decrease from 90 to 10 per cent of its maximum value is called

Q. If variable a is host variable and dev_a is a device (GPU) variable, to copy input from variable a to variable dev_a select correct statement:

Q. Which of the following is not a characteristic of good test data

Q. With the use of an electronic counter six capsules are to be filled in bottles automatically. In such a counter what will be the number of flip- flops required ?