-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathStarter2.cpp
More file actions
472 lines (409 loc) · 13.7 KB
/
Starter2.cpp
File metadata and controls
472 lines (409 loc) · 13.7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
#include "Starter.h"
Starter::Starter() {
printf("In Starter\n");
id=-1;
quorumSize=0;
NumNodes=0;
//decideAlgorithm();
}
Starter::~Starter() {
for(int i = 0; i < NumNodes; ++i)
delete Quorum[i];
delete Quorum;
}
void Starter::init(){
char controllerIP[MAXLENGTH_IP_ADDR] = CONTROLLER_IP;
//messageCounter=0;
//char controllerIP[16] = "10.176.67.88";
int port = LISTEN_PORT;
registerAtController(controllerIP, port);
decideAlgorithm();
}
void Starter::parseMsg(const string& s,const string& delim,std::vector<string>& tokens)
{
size_t s0 = 0, s1 = string::npos;
string token;
while(s0 != string::npos)
{
s1 = s.find_first_of(delim, s0);
// if(s1 != s0 && s1 != string::npos) // the second check added for space
if(s1 != s0) // no need check Defect FIX 1,2 -> 2 will not be added in the list
{
token = s.substr(s0, s1 - s0);
if( token != "")
{
//cout<<"Token :"<<token<<" length:"<<token.length()<<endl;
//cout<<token<<endl;
tokens.push_back(token);
}
}
s0 = s.find_first_not_of(delim, s1);
}
//EXIT
token.clear();
return;
}
/*
* send a message to controller when a node starts on a amachine.
*/
void Starter::registerAtController(char controllerIP[15],int port){
//communication
communication com;
int sockfd = com.connectToServer(controllerIP,port);
int z;
char buf[128]={'\0',};
z = gethostname(buf,sizeof buf);
if ( z == -1 ) {
fprintf(stderr, "%s: gethostname(2)\n",
strerror(errno));
exit(1);
}
int sd = 999;
printf("\nContacted Controller, sent my hostname:%s\n",buf);
com.writeToSocket(sockfd,buf,128);
com.readFromSocket(sockfd,&id,sizeof(int));
int qsize,nsize;
com.readFromSocket(sockfd,&qsize,sizeof(int));
com.readFromSocket(sockfd,&nsize,sizeof(int));
//int size;
//com.readFromSocket(sockfd,&size,sizeof(int));
printf("Received ID: %d, Qsize: %d, NumNodes: %d\n",id,qsize,nsize);
NumNodes = nsize;
quorumSize = qsize;
Quorum = new int*[nsize];
for(int i = 0; i < nsize; ++i)
Quorum[i] = new int[qsize];
for (int i = 0; i < nsize; ++i) {
for (int j = 0; j < qsize; ++j) {
Quorum[i][j] = 0;
}
}
puts("Getting quorum table\n");
char recvdMsg[4096] = {'\0',};
com.readFromSocket(sockfd,recvdMsg,4095);
string recvdStr = recvdMsg;
vector<string> recvdValues;
string delimiter = ":";
parseMsg(recvdStr,delimiter,recvdValues);
/*
for (int i=0; i<recvdValues.size();i++)
{
cout<<recvdValues[i]<<endl; //<-- extract values from this vector and push into the attay in 123 line
}*/
for(int i=0; i<nsize;i++)
{
for(int j=0; j<qsize;j++)
{
//cout<<"Here"<<endl;
Quorum[i][j] = atoi(recvdValues[i*qsize+j].c_str());
//cout<<"Here1"<<endl;
}
}
for(int i=0;i<nsize;i++){
for(int j=0;j<qsize;j++){
printf("%d\t",Quorum[i][j]);
}
printf("\n");
}
shutdown(sockfd,2);
int k = com.closeSocket(sockfd);
if (k < 0) {
printf("\nError in Closing");
exit(0);
}else
printf("Node disconnected from Controller\n");
}
void Starter::decideAlgorithm(){
printf("\nIn decideAlgorithm() of Node\n");
communication com;
int serfd;
int clifd = com.OpenListener(serfd,LISTEN_PORT2);
//char buffer[4095]={'\0',};
int intbuf;
com.readFromSocket(clifd,&intbuf,sizeof(int));
printf("recvd: %d\n",intbuf);
puts("Getting ID to IP map\n");
//assigining memory to mapIDtoIP
mapIDtoIP = new char*[NumNodes];
for(int i = 0; i < NumNodes; ++i){
mapIDtoIP[i] = new char[MAXLENGTH_IP_ADDR];
}
char recvdMsg[4096] = {'\0',};
strcpy(mapIDtoIP[0],"hello");
com.readFromSocket(clifd,recvdMsg,4095);
string recvdStr = recvdMsg;
vector<string> recvdValues;
string delimiter = ":";
parseMsg(recvdStr,delimiter,recvdValues);
for(int i=0;i<NumNodes;i++){
strcpy(mapIDtoIP[i],recvdValues[i].c_str());
printf("%d\t%s\n",i,mapIDtoIP[i]);
}
com.readFromSocket(clifd,CS_FileName,25);
printf("File Name of Critical section resource is %s\n",CS_FileName);
shutdown(clifd,2);
com.closeSocket(clifd);
com.closeSocket(serfd);
int algo = intbuf;
if(algo == 1){
Algorithm1();
}else if(algo == 2){
Algorithm2();
}else
printf("Invalid input\n");
}
void Starter::Algorithm1(){
printf("Starting Algorithm 1: Maekawa\n");
mnode = MaekawaAlgorithm::getInstance();
mnode->initialization();
mnode->setProcessID(id);
mnode->getQuorumTable(Quorum,quorumSize, NumNodes);
mnode->com.setMapIDtoIP(mapIDtoIP);
wqueue<Packet*> queue;
pthread_t ListenerThread;
pthread_create(&ListenerThread, NULL, MaekawaListen, (void *)&queue);
sleep(1);
pthread_t ProcessingThread;
pthread_create(&ProcessingThread, NULL, MaekawaProcess,(void *)&queue);
pthread_join(ListenerThread, NULL);
pthread_join(ProcessingThread, NULL);
printf("Maekawa Algorithm execution done\n");
}
void Starter::Algorithm2(){
printf("Starting Algorithm 2: Torum\n");
node = Torum::getInstance();
node->init();
node->setID(id);
node->getQuorumTable(Quorum,quorumSize,NumNodes);
//000
node->com.setMapIDtoIP(mapIDtoIP);
strcpy(node->CS_FILENAME,CS_FileName);
wqueue<Packet*> mqueue;
pthread_t ListenerThread;
pthread_create(&ListenerThread, NULL, TorumListen, (void *)&mqueue);
sleep(1);
pthread_t ProcessingThread;
pthread_create(&ProcessingThread, NULL, TorumProcess,(void *)&mqueue);
pthread_join(ListenerThread, NULL);
pthread_join(ProcessingThread, NULL);
printf("Torum execution done\n");
}
void endProcessing(int id, long messageCounter,long timeCounter){
printf("Ending...\nID:%d, MessageCount:%ld, TimeCount:%ld",id,messageCounter,timeCounter);
sleep(3);
communication com;
char cIP[MAXLENGTH_IP_ADDR]=CONTROLLER_IP;
int sockFd=com.connectToServer(cIP,LISTEN_PORT_END);
int nodeid = id;
com.writeToSocket(sockFd,&nodeid,sizeof(int));
long counter=messageCounter;
com.writeToSocket(sockFd,&counter,sizeof(long));
counter = timeCounter;
com.writeToSocket(sockFd,&counter,sizeof(long));
shutdown(sockFd,0);
close(sockFd);
printf("Bye!!!\n\n\n");
exit(0);
}
void *TorumListen(void* mqueue) {
printf("TorumListener Thread created\n");
wqueue<Packet*> *m_queue=((wqueue<Packet*>*)mqueue);
communication com;
com.serverListen(LISTEN_PORT3,m_queue);
return NULL;
}
bool randDecision(){
int r = rand()%100;
if(r<30)
return false;
else
return true;
}
void *TorumProcess(void* mqueue) {
printf("TorumProcess Thread created\n");
long messageCounter = 0;
long timeCounter = 0;
wqueue<Packet*>*m_queue=(wqueue<Packet*>*)mqueue;
//getting time for CS grant
long utime, seconds, useconds;
queue<struct timeval> timequeue;
Torum *node = Torum::getInstance();
sleep(5);
node->displayStatus();
// Remove 1 item at a time and process it. Blocks if no items are
// available to process.
for (int i = 0;; i++) {
printf("\nTorumProcessing Thread , loop %d - waiting for message...\n", i);
Packet* item = m_queue->remove();
//printf("thread loop %d - got one item\n", i);
//printf("Received: messageType - %d, SEQ number - %ld\n",item->TYPE, item->SEQ);
//uncomment for unreliable
if(!randDecision()){
printf("===>Missed a packet from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
delete item;
continue;
}
if (item->TYPE == SEND_TOKEN){
printf("##SEND_TOKEN recieved from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
node->flagforCS = false;
struct timeval end;
gettimeofday(&end, NULL);
struct timeval start = timequeue.front();
seconds = end.tv_sec - start.tv_sec;
useconds = end.tv_usec - start.tv_usec;
utime = ((seconds) * 1000000 + useconds) + 0.5;
node->receiveToken(*item);
if(node->flagforCS){//node entered CS using this Token
//struct timeval end;
//gettimeofday(&end, NULL);
//struct timeval start = timequeue.front();
timequeue.pop();
//seconds = end.tv_sec - start.tv_sec;
//useconds = end.tv_usec - start.tv_usec;
//utime = ((seconds) * 1000000 + useconds) + 0.5;
timeCounter += utime;
}
if(item->sender != node->ID)
messageCounter++;
}else if (item->TYPE == MAKE_REQUEST){
printf("##MAKE_REQUEST recieved from Controller %d and packet type is %d\n",item->ORIGIN,item->TYPE);
struct timeval start;
gettimeofday(&start, NULL);
timequeue.push(start);
node->requestCS();
}else if (item->TYPE == HAVE_TOKEN){
if(item->sender != node->ID)
messageCounter++;
printf("##HAVE_TOKEN recieved from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
node->receiveHaveTkn(*item);
}else if (item->TYPE == RELEASE){
if(item->sender != node->ID)
messageCounter++;
printf("##RELEASE recieved from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
node->receiveRelease(*item);
}else if (item->TYPE == REQUEST){
if(item->sender != node->ID)
messageCounter++;
printf("##REQUEST recieved from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
node->receiveRequest(*item);
}
else if(item->TYPE == END_PROCESS)
{
printf("##END_PROCESS recieved from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
endProcessing(node->ID,messageCounter,timeCounter);
}
delete item;
node->displayStatus();
}
return NULL;
}
void *MaekawaListen(void* iqueue) {
printf("MaekawaListener Thread created\n");
wqueue<Packet*> *m_queue=((wqueue<Packet*>*)iqueue);
communication com;
com.serverListen(LISTEN_PORT3,m_queue);
return NULL;
}
void *MaekawaProcess(void* iqueue) {
printf("MaekawaProcess Thread created\n");
long messageCounter = 0;
long timeCounter = 0;
//getting time for CS grant
long utime, seconds, useconds;
queue<struct timeval> timequeue;
//struct timeval start1;
wqueue<Packet*>*m_queue=(wqueue<Packet*>*)iqueue;
MaekawaAlgorithm *mnode = MaekawaAlgorithm::getInstance();
sleep(5);
long s=1;
long e =0;
// Remove 1 item at a time and process it. Blocks if no items are
// available to process.
for (int i = 0;; i++) {
printf("MaekawaProcessing Thread , loop %d - waiting for item...\n", i);
Packet* item = m_queue->remove();
//printf("thread loop %d - got one item\n", i);
//uncomment for unreliable
if(!randDecision()){
printf("===>Missed a packet from Node %d(Origin: %d) and packet type is %d\n",item->sender,item->ORIGIN,item->TYPE);
continue;
}
printf("Received: messageType - %d, SEQ number - %ld\n",item->TYPE, item->SEQ);
switch (item->TYPE) {
case MAKE_REQUEST:
printf(" ## MAKE_REQUEST received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
struct timeval start;
gettimeofday(&start, NULL);
timequeue.push(start);
s = start.tv_sec;
printf("start time: %l\n",s);
mnode->receiveMakeRequest(*item);
break;
case REQUEST:
printf(" ## REQUEST received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->receiveRequest(*item);
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case INQUIRE:
printf(" ## INQUIRE received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->receiveInquire(*item);
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case FAILED:
printf(" ## FAILED received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->receiveFailed(*item);
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case RELEASE:
printf(" ## RELEASE received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->receiveRelease(*item);
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case RELINQUISH:
printf(" ## RELINQUISH received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->receiveRelinquish(*item);
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case LOCKED:
printf(" ## LOCKED received from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
mnode->flagforCS = false;
struct timeval end;
gettimeofday(&end, NULL);
e = end.tv_sec;
struct timeval start1;
start1 = timequeue.front();
seconds = end.tv_sec - start1.tv_sec;
useconds = end.tv_usec - start1.tv_usec;
utime = ((seconds) * 1000000 + useconds) + 0.5;
printf("end time:%l, totaltime: %l",e,utime);
mnode->receiveLocked(*item);
if(mnode->flagforCS){//node entered CS on this Locked
//struct timeval end;
//gettimeofday(&end, NULL);
//struct timeval start = timequeue.front();
timequeue.pop();
//seconds = end.tv_sec - start.tv_sec;
//useconds = end.tv_usec - start.tv_usec;
//utime = ((seconds) * 1000000 + useconds) + 0.5;
timeCounter += utime;
}
if(item->ORIGIN != mnode->processID)
messageCounter++;
break;
case END_PROCESS:
printf("END_PROCESS recieved from Node %d and packet type is %d\n",item->ORIGIN,item->TYPE);
delete item;
endProcessing(mnode->processID,messageCounter,timeCounter);
break;
default:
break;
}
delete item;
}
return NULL;
}