adplus-dvertising
frame-decoration

Question

A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is
P1 || P2 || P3 || ..... || Pk if and only if:

a.

Pi || Pj for all i ≠ j

b.

Pi || Pj for all i = j+1

c.

Pi || Pj for all i ≤ j

d.

Pi || Pj for all i ≥ j

Answer: (a).Pi || Pj for all i ≠ j

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is P1 || P2 || P3 || ..... || Pk if and only if:

Similar Questions

Discover Related MCQs

Q. The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is

Q. If an integer needs two bytes of storage, then the maximum value of a signed integer is

Q. If an integer needs two bytes of storage, then the maximum value of unsigned integer is

Q. Negative numbers cannot be represented in

Q. X – = Y + 1 means

Q. The absorption law in Boolean algebra say that

Q. The number of 1’s present in the binary representation of

10 × 256 + 5 × 16 + 5 is

Q. The hexadecimal number equivalent to (1762.46)8 is

Q. (A + B)(AB)’ is equivalent to

Q. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

Q. What is decimal equivalent of BCD 11011.1100?

Q. The simplified form of the Boolean expression (X+Y+XY)(X+Z) is

Q. The answer of the operation (10111)2 * (1110)2 in hex equivalence is

Q. How many 1’s are present in the binary representation of

3 × 512 + 7 × 64 + 5 × 8 + 3

Q. The Boolean expression x’y’z+yz+xz is equivalent to:

Q. The octal equivalent of hexadecimal (A.B)16 is:

Q. The dual of the switching function x+yz is:

Q. The octal equivalent of the hexadecimal number FF is:

Q. The idempotent law in Boolean algebra says that:

Q. Simplified form of Boolean expression xy+(~x)z+yz is: