1,117 views
2 votes
2 votes

A set of processors $P1, P2, \dots Pk$ can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is $ P1 \parallel P2 \parallel P3 \parallel \dots \parallel Pk$ if and only if:

  1. $Pi \parallel Pj \text{ for all } i \neq j$
  2. $Pi \parallel Pj \text{ for all } i =j+1$
  3. $Pi \parallel Pj \text{ for all } i \leq j$
  4. $Pi \parallel Pj \text{ for all } i \geq j$

1 Answer

0 votes
0 votes
Answer A

Solution is simple.

Suppose 3 processors want to run in parallel. The instructions on each processor should not depend on instructions executed by other processor.

It means

P1 || P2

P2 || P3

P3 || P1

In given question, parallelism should be there whenever i !=j
Answer:

Related questions

3 votes
3 votes
1 answer
2
go_editor asked Jul 14, 2016
4,044 views
A virtual memory based memory management algorithm partially swaps out a process. This is an example ofshort term schedulinglong term schedulingmedium term schedulingmutu...
2 votes
2 votes
3 answers
3
1 votes
1 votes
1 answer
4
go_editor asked Jul 14, 2016
2,200 views
A test contains 100 true/false questions. How many different ways can a student answer the question on the test, if the answer may be left blank also.$^{100}P_2$$^{100}C_...