CONTEXT DIAGRAM

Requests to enter CS

A New Fairness Algorithm for Priority Processes

Nodes/ Processes

Order of entry to CS & Response time & total no. of control messages

Relationship Array
2.0
Transfer of requests to p​hold
Nodes/ Processes

​LEVEL 1- DFD

Links between nodes and priority of each node

Links
1.0
Network
Creation

Request to enter CS
Token from p​hold
Response​ t​ ime & total no. of control messages

OUTPUT
4.0
Calculation of response​ t​ ime & no. of control messages
3.0
Transfer of token to requesting
nodes

Parent-child relationship

Link
Request from token
Exit from CS
Critical Section

Relationship Array
LEVEL 2-DFD
 Links between nodes and priority of each node

1.0
Network
Creation

Nodes/ Processes

2.1
Request processed by requester

Node wishing to enter CS

Req. queue to be used for servicing

2.2 Request services by parent till request reaches p​hold

Requests from requester

Link

Child’s id

Requesters’ priority

Priority queue to be used for servicing

3.2
Transfer token to children till token reaches the requesting node

Child’s priority
Requester id
Priority queue to be used for servicing
Req. queue to be used for servicing

Request Queue
Priority Queue

Token from p​hold

1​st​ entry in Queue
1​st​ entry in Queue

4.0
Calculate Response tome and total no. of control messages

3.1
Check if the node is the same as the entry at the head of queue

Request to enter CS
Exit from CS
Response​ t​ ime & total no. of control messages

Request to enter CS
OUTPUT

Critical Section