-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTransactionManager.cpp
More file actions
512 lines (450 loc) · 13.9 KB
/
TransactionManager.cpp
File metadata and controls
512 lines (450 loc) · 13.9 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
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
#include <iostream>
#include <map>
#include <list>
#include <unordered_set>
#include <stack>
#include <utility>
#include "TransactionManager.hpp"
using namespace std;
TransactionManager::TransactionManager(const list<Operation> ops)
{
operations = ops;
time = 0;
initSites();
}
void TransactionManager::initSites()
{
for (int i = 1; i < 11; i++)
{
allSites.push_back(Site(i));
}
}
void TransactionManager::checkForConflict(map<int, map<int, int>> &transactionAccesses, map<int, map<int, int>> &conflicts, Operation op)
{
// map<int, int> conflicts;
auto &transactionConflicts = conflicts[op.tID];
for (auto &tx : transactionAccesses)
{
int transactionID = tx.first;
if (transactionID == op.tID)
continue;
map<int, int> &variableAccesses = tx.second;
for (auto &targetVar : variableAccesses)
{
if (targetVar.first == op.varID)
{
// potential conflict
if (op.type == OP::READ && targetVar.second == 0)
continue; // no conflict
else
{
if (op.type == OP::WRITE && targetVar.second == 0)
{
// RW
transactionConflicts[transactionID] = 0;
}
else if (op.type == OP::WRITE && targetVar.second == 1)
{
// WW
transactionConflicts[transactionID] = 1;
}
else
{
// WR
if (transactionMap[transactionID].curStatus == TransactionStatus::COMMITTED)
transactionConflicts[transactionID] = 2;
else
{
conflicts[transactionID][op.tID] = 0;
// transactionConflicts[transactionID] = 0;
}
}
}
}
}
}
}
bool TransactionManager::hasRWCycle(int startNode)
{
// Visited set to track nodes in current DFS path
std::unordered_set<int> visited;
// Stack to perform DFS
// Store: {current node, consecutive RW edge count}
std::stack<std::pair<int, int>> dfsStack;
dfsStack.push({startNode, 0});
while (!dfsStack.empty())
{
int currentNode = dfsStack.top().first;
int currentRWCount = dfsStack.top().second;
dfsStack.pop();
// If node already visited in current path, we have a cycle
if (visited.count(currentNode) > 0 && currentRWCount >= 2)
{
return true;
}
visited.insert(currentNode);
// Check outgoing edges from current node
auto nodeConflicts = conflicts.find(currentNode);
if (nodeConflicts != conflicts.end())
{
bool inTransactionGraph = false;
for (const auto &edge : nodeConflicts->second)
{
if (transactionGraph.count(edge.first) || edge.first == startNode)
{
inTransactionGraph = true;
int nextNode = edge.first;
int edgeType = edge.second;
// Track consecutive RW edges
int newRWCount = (edgeType == 0) ? currentRWCount + 1 : 0;
if (currentRWCount == 2)
{
newRWCount = 2;
}
// If not visited, add to stack for further exploration
if (visited.count(nextNode) == 0)
{
dfsStack.push({nextNode, newRWCount});
}
// Also check if this node creates a cycle
else if (visited.count(nextNode) > 0 && newRWCount >= 2)
{
return true;
}
}
}
if (!inTransactionGraph)
{
return false;
}
}
}
return false;
}
void TransactionManager::removeConflictEdges(int tid)
{
conflicts.erase(tid);
}
void TransactionManager::beginTransaction(int tid, int beginTime)
{
Transaction tr(tid, beginTime);
transactionMap[tid] = tr;
for (int i = 0; i < 10; i++)
{
Site *st = &allSites[i];
st->readLog[beginTime] = st->committedData;
}
}
void TransactionManager::SiteFail(int siteID)
{
allSites[siteID - 1].fail(time);
failureHistory[siteID - 1].push_back(time);
}
void TransactionManager::SiteRecover(int siteID)
{
// status = up
// search for waiting transactions that need to read site's data
allSites[siteID - 1].recover();
for (auto waitingTransaction = waitingTransactionReads.begin(); waitingTransaction != waitingTransactionReads.end(); waitingTransaction++)
{
if (waitingTransaction->first == -1)
{
continue;
}
Transaction tr = transactionMap[waitingTransaction->first];
int varCheck = waitingTransaction->second;
bool upContinuously = true;
for (auto failTime : failureHistory[siteID - 1])
{
if (failTime > allSites[siteID - 1].lastCommitTimes[varCheck] && failTime < tr.startTime)
{
upContinuously = false;
}
}
if (upContinuously)
{
int readVal = allSites[siteID - 1].committedData[varCheck];
std::cout << "x" << varCheck << ": " << readVal << std::endl;
// waitingTransactionReads.erase(waitingTransaction);
waitingTransaction->first = -1;
}
}
}
void TransactionManager::transactionRead(int tid, int var, Operation op)
{
Transaction *tr = &transactionMap[tid];
bool replicated = (var % 2 == 0);
transactionAccesses[tid][var] = 0;
checkForConflict(transactionAccesses, conflicts, op);
if (tr->curStatus == TransactionStatus::ABORTED)
return;
bool hasBeenRead = false;
int readVal;
if (replicated)
{
// in the case of replicated variable, if a site recovers after it fails
// then the replicated vairables of that site cannot be read until a commit
// happens after it recovers
for (int i = 0; i < 10; i++)
{
if (hasBeenRead)
{
break;
}
Site *st = &allSites[i];
if (st->status == SiteStatus::DOWN)
{
continue;
}
// case where no commit has occured on a site after its failed and
// recovered
if (st->failtime > st->lastCommitTimes[var] || st->lastCommitTimes[var] > tr->startTime)
{
continue;
}
readVal = st->readLog[tr->startTime][var];
hasBeenRead = true;
}
}
else
{
int siteNum = (var % 10) + 1;
if (allSites[siteNum - 1].status != SiteStatus::DOWN)
{
readVal = allSites[siteNum - 1].readLog[tr->startTime][var];
hasBeenRead = true;
}
}
if (hasBeenRead)
{
std::cout << "x" << var << ": " << readVal << std::endl;
}
else
{
tr->curStatus = TransactionStatus::WAITING;
std::pair<int, int> waitOp(tid, var);
waitingTransactionReads.push_back(waitOp);
std::cout << "T" << tid << " waits for var x" << var << std::endl;
}
}
void TransactionManager::transactionWrite(int tid, int var, int val, Operation op)
{
Transaction *tr = &transactionMap[tid];
// if tr = active ... continue
bool replicated = (var % 2 == 0);
bool notWritten = true;
transactionAccesses[tid][var] = 1;
checkForConflict(transactionAccesses, conflicts, op);
if (!replicated)
{
int siteNum = (var % 10) + 1;
if ((allSites[siteNum].status == SiteStatus::DOWN))
{
return; // something else here (what happens when we try to write to a site that is down)
}
else
{
Site *st = &allSites[siteNum - 1];
st->snapshots[tid][var] = val; // update variable with value
tr->variablesWrittenTo.push_back(var);
if (tr->firstWriteTime == -1)
{
tr->firstWriteTime = time;
}
printf("T%d writes to site %d\n", tid, siteNum);
}
}
else
{
for (int i = 0; i < 10; i++)
{
Site *st = &allSites[i];
if (st->status == SiteStatus::DOWN)
{
continue;
}
st->snapshots[tid][var] = val;
tr->variablesWrittenTo.push_back(var);
if (tr->firstWriteTime == -1)
{
tr->firstWriteTime = time;
}
printf("T%d writes to site %d\n", tid, i + 1);
}
}
}
void TransactionManager::dump()
{
for (auto site : allSites)
{
printf("site %d - ", site.getID());
string comma = "";
for (auto val : site.committedData)
{
cout << comma << " ";
printf("x%d: %d", val.first, val.second);
comma = ",";
}
cout << endl;
}
}
void TransactionManager::transactionEnd(int tid, int endTime)
{
// vector of things done
// records[tid] --> will give all things done by this transaction
Transaction *tr = &transactionMap[tid];
if (tr->curStatus == TransactionStatus::ABORTED)
{
std::cout << "T" << tid << " aborts" << std::endl;
return;
}
bool canCommit = true;
// check first commit wins rule
for (auto site : allSites)
{
for (auto v : tr->variablesWrittenTo)
{
if (site.lastCommitTimes[v] > tr->startTime)
{
canCommit = false;
}
}
}
for (auto writeVar : tr->variablesWrittenTo)
{
bool replicated = (writeVar % 2 == 0);
if (replicated)
{
for (auto site : allSites)
{
if ((tr->firstWriteTime != -1) && (site.failtime > tr->firstWriteTime))
{
tr->curStatus = TransactionStatus::ABORTED;
std::cout << "T" << tid << " aborts" << std::endl;
return;
}
}
}
else
{
int siteNum = (writeVar % 10) + 1;
// check only sites that transaction has accessed
// for the case of non-replicated variables
if ((tr->firstWriteTime != -1) && (allSites[siteNum - 1].failtime > tr->firstWriteTime))
{
tr->curStatus = TransactionStatus::ABORTED;
std::cout << "T" << tid << " aborts" << std::endl;
return;
}
}
}
// check for RW-Cycle
if (hasRWCycle(tid))
{
canCommit = false;
removeConflictEdges(tid);
}
if (canCommit)
{
// update all sites
for (int i = 0; i < 10; i++)
{
Site *st = &allSites[i];
if (st->status == SiteStatus::UP)
{
if (st->snapshots.find(tid) == st->snapshots.end())
{
continue;
}
for (auto updateVar : st->snapshots[tid])
{
st->committedData[updateVar.first] = updateVar.second;
}
for (auto var : tr->variablesWrittenTo)
{
st->lastCommitTimes[var] = time;
}
}
}
std::cout << "T" << tid << " commits" << std::endl;
tr->curStatus = TransactionStatus::COMMITTED;
transactionGraph.insert(tid);
}
else
{
tr->curStatus = TransactionStatus::ABORTED;
std::cout << "T" << tid << " aborts" << std::endl;
return;
}
}
void TransactionManager::run()
{
while (!operations.empty())
{
currentOP = operations.front();
operations.pop_front();
time++;
switch (currentOP.type)
{
case OP::BEGIN:
{
// std::cout << "begin T" << currentOP.tID << std::endl;
beginTransaction(currentOP.tID, currentOP.timestamp);
}
break;
case OP::READ:
{
// std::cout << "Read T" << currentOP.tID << " x" << currentOP.varID << std::endl;
transactionRead(currentOP.tID, currentOP.varID, currentOP);
}
break;
case OP::WRITE:
{
// std::cout << "Write T" << currentOP.tID << " x" << currentOP.varID << " " << currentOP.val << std::endl;
transactionWrite(currentOP.tID, currentOP.varID, currentOP.val, currentOP);
}
break;
case OP::FAIL:
{
// std::cout << "Site " << currentOP.site << " Failed" << std::endl;
SiteFail(currentOP.site);
}
break;
case OP::RECOVER:
{
SiteRecover(currentOP.site);
// std::cout << "Site " << currentOP.site << " Recovered" << std::endl;
}
break;
case OP::END:
{
// std::cout << "end T" << currentOP.tID << std::endl;
transactionEnd(currentOP.tID, time);
}
break;
case OP::DUMP:
{
// std::cout << "dump()" << std::endl;
dump();
}
break;
default:
std::cout << "no operation" << std::endl;
exit(1);
}
}
}
void TransactionManager::addOperation(Operation op)
{
operations.push_back(op);
}
void TransactionManager::endSimulation()
{
for (auto tr : transactionMap)
{
if ((tr.second.curStatus != TransactionStatus::ABORTED) && ((tr.second.curStatus != TransactionStatus::COMMITTED)))
{
std::cout << "T" << tr.first << " aborts" << std::endl;
}
}
}