+/EE360P

distributed systems

git clone https://git.julia.blue/+/EE360P

vijaygarg1init5384742

master
1.6 KiB65 linesraw
1package mutex;
2import dist.*;
3public class DinMutex extends dist.MyProcess implements Lock {
4	private static final int thinking = 0, hungry = 1, eating = 2;
5	Boolean fork[] = null,  dirty[] = null, request[] = null;
6	int myState = thinking;
7	int n = neighbors.size();
8	public DinMutex(MsgHandler initComm) {
9		super(initComm);
10		fork = new Boolean[n]; dirty = new Boolean[n];
11		request = new Boolean[n];
12		for (int i=0; i < n; i++) { 
13			if (myId > neighbors.get(i)) {
14				fork[i] = false; request[i] = true;
15			} else { fork[i] = true; request[i] = false; }
16			dirty[i] = true;
17		}
18	}
19	public synchronized void requestCS() {
20		myState = hungry;
21		if (haveForks()) myState = eating;
22		else
23			for (int i=0; i < n; i++)
24				if (request[i] && !fork[i]) {
25					sendMsg(neighbors.get(i), "Request"); 
26					request[i]=false;
27				}
28		while (myState != eating) myWait();
29	}
30	public synchronized void releaseCS() {
31		myState = thinking;
32		for (int i=0; i < n; i++){
33			dirty[i] = true;
34			if (request[i]) {
35				sendMsg(neighbors.get(i), "Fork"); 
36				fork[i]=false;
37			}
38		}
39	}
40	boolean haveForks() {
41		for (int i=0; i < n; i++)
42			if (!fork[i]) return false;
43		return true;
44	}
45
46	public synchronized void handleMsg(Msg m, int src, String tag) {
47		int nid = neighbors.indexOf(src);
48		if (tag.equals("Request")) {
49			request[nid] = true;
50			if ((myState != eating) && fork[nid] && dirty[nid]) {
51				sendMsg(src, "Fork") ;
52				fork[nid] = false;
53				if (myState == hungry) {
54					sendMsg(src, "Request");
55					request[nid] = false;
56				}
57			}
58		} else if (tag.equals("Fork")) {
59			fork[nid] = true; dirty[nid] = false;
60			if (haveForks()) 
61				myState = eating; 
62		}
63		notifyAll();
64	}
65}