retagged by
3,141 views
16 votes
16 votes

A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______

retagged by

1 Answer

Best answer
17 votes
17 votes

A given set of processes can be implemented by using only parbegin/parendstatement, if the precedence graph of these processes is properly nested 

Reference : http://nob.cs.ucdavis.edu/classes/ecs150-2008-04/handouts/sync.pdf

  1. It should be closed under par begin and par end.
  2. Process execute concurrently.


https://gateoverflow.in/1739/gate1998_24#viewbutton

In this question precedence graph is nested.

  1. All the process execute concurrently,  closed under par begin and par end.
     
  2. If you see all the serial  execution come then signal the resource and and parallel process down the value (resource ) similar all the process which are which are dependent to other one, other one release the resource then it will be got that with down and after release the its own resource. In the sense all the process are executing concurrently.
edited by

Related questions

51 votes
51 votes
4 answers
1
Kathleen asked Sep 12, 2014
11,434 views
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
19 votes
19 votes
3 answers
2
Kathleen asked Sep 12, 2014
5,681 views
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
37 votes
37 votes
1 answer
3
Kathleen asked Sep 12, 2014
4,784 views
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
24 votes
24 votes
3 answers
4
Kathleen asked Sep 12, 2014
4,369 views
Consider the following PASCAL program segment:if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < 0 then i := i - 1; else i := i – 2; end;An appropria...