-
Notifications
You must be signed in to change notification settings - Fork 1
/
simulator.cpp
462 lines (391 loc) · 12.8 KB
/
simulator.cpp
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
// this is not working
// we are making now
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <string>
using namespace std;
class Namenode;
class File;
class Data;
class Node;
class Container;
class ResourceManager;
class Application;
int main_working_time = 0;
//Data Class
class Data {
friend class File;
friend class NameNode;
private:
int file_idx; // index of file where this data located
int data_idx; // index of data
int node_position; // node position of the data
bool is_cached;
public:
Data();
Data(int nodenum, int fileidx, int dataidx);
int GetFileIdx();
int GetDataIdx();
int GetNodePosition();
bool IsCached();
};
//File Class
class File {
friend class NameNode;
private:
int file_idx;
int file_size;
Data **datas; // datas in the file
public:
File(int fileidx, int size, int nodesize);
int GetFileIdx();
int GetFileSize();
Data GetData(int dataidx, int order);
bool IsInNode(int nodenum, int dataidx);
};
//NameNode Class
class NameNode {
private:
int node_size; // size of each node
int file_num; // number of files
bool *failed_worker_check;
int **node_file_num;
public:
File **file;
NameNode(int nodesize, Node *worker[], int file_num, File *f[]);
int GetNodeSize();
int GetNodeFileNum(int nodeindex, int fileindex);
int FindNode(int fileindex, int blockindex);
int FindNode(int fileindex, int blockindex, int order);
int *FindData(int nodeindex, int fileindex);
bool IsInNode(int nodeindex, int fileindex, int blockindex);
// void AddFile(File f); <<<< how to add files whenever we want? linked list?
};
//Container Class
class Container {
friend class Node;
friend class ResourceManager;
private:
int start_time;
int end_time;
Application *task;
int task_index;
bool is_working;
public:
Container();
void TaskExecute(Node *node, Application *job, int fileidx, int blockidx, string state);
int GetStartTime();
bool GetIsWorking();
int GetAvgTaskTime();
};
//Node Class
class Node {
friend class ResourceManager;
private:
int node_idx;
bool is_fail;
int cache_size;
int container_size;
Container *container;
public:
Node(int idx, int cachesize, int contsize);
int GetContSize();
};
//Application Class
class Application {
friend class ResourceManager;
private:
int app_idx; // index of the job
string app_type; // name of the job
int file_idx; // index of needed file
int mapper_num; // number of mappers = number of blocks
int reducer_num;
int avg_task_time_per_block; // <<<<< access_time과 같은 것?
int skip_count;
int skip_checker;
bool *working_state;
int task_pointer;
int task_counter;
// int access_time;
int cache_local_avg_map_time;
int data_local_avg_map_time;
int rack_local_avg_map_time;
int avg_reduce_time;
public:
Application(int appnum, string type, File *f, int rednum, int avgtasktime, int cachetime, int datatime, int racktime, int reducetime, int skipcount);
void SetProcessed(int taskidx);
void SetWorkingState(int taskidx);
int GetAvgTaskTime();
int GetSkipCount();
bool IsCompleted();
bool GetWorkingState(int taskidx);
bool GetProcessingState(int taskidx);
void AddTaskCounter();
};
class Grep : public Application {
private:
public:
// Grep(int appnum, string type, File *f, int rednum, int avgtasktime, int skipcount) : Application(appnum, type, f, rednum, avgtasktime, accesstime, skipcount) {
//}
};
class WordCount: public Application {
private:
public:
// WordCount(int appnum, string type, File *f, int rednum, int avgtasktime, int skipcount) : Application(appnum, type, f, rednum, avgtasktime, accesstime, skipcount) {
//}
};
//ResourceManager Class
class ResourceManager {
private:
Application *job_pointer;
public:
void JobCompleteManager(NameNode *NM, Node *nodes[]);
void DelayScheduling(NameNode *NM, Node *nodes[], Application *jobs[], int app_num);
};
//Data Class implementation------------------------------------------------------------------------
Data::Data() {
this->file_idx = -1;
this->data_idx = -1;
this->node_position = -1;
this->is_cached = false;
}
Data::Data(int nodenum, int fileidx, int dataidx) {
file_idx = fileidx;
data_idx = dataidx;
node_position = nodenum;
is_cached = false;
}
int Data::GetFileIdx() { return file_idx; }
int Data::GetDataIdx() { return data_idx; }
int Data::GetNodePosition() { return node_position; }
bool Data::IsCached() { return is_cached; }
//File Class implementation------------------------------------------------------------------------
File::File(int fileidx, int size, int nodesize) {
file_idx = fileidx;
file_size = size;
datas = new Data*[file_size];
for(int i=0; i<file_size; i++) {
datas[i] = new Data[3];
for(int j=0; j<3; j++) {
datas[i][j].file_idx = file_idx;
datas[i][j].data_idx = i;
datas[i][j].node_position = rand()%nodesize;
}
}
}
int File::GetFileIdx() { return file_idx; }
int File::GetFileSize() { return file_size; }
Data File::GetData(int dataidx, int order) { return datas[dataidx][order]; }
bool File::IsInNode(int nodenum, int dataidx) {
for(int i=0; i<3; i++) {
if(nodenum == datas[dataidx][i].GetNodePosition()) {
return true;
}
}
return false;
}
//NameNode Class implementation--------------------------------------------------------------------
NameNode::NameNode(int nodesize, Node *worker[], int filenum, File *f[]) {
node_size = nodesize;
file_num = filenum;
file = f;
failed_worker_check = new bool[node_size];
for(int i=0; i<node_size; i++) {
failed_worker_check = false;
}
node_file_num = new int*[node_size];
for(int i=0; i<node_size; i++) {
node_file_num[i] = new int[file_num];
}
}
int NameNode::GetNodeSize() { return node_size; }
int NameNode::GetNodeFileNum(int nodeindex, int fileindex) { return node_file_num[nodeindex][fileindex]; }
int NameNode::FindNode(int fileindex, int blockindex) {
return file[fileindex]->GetData(blockindex, 0).GetNodePosition();
}
int NameNode::FindNode(int fileindex, int blockindex, int order) {
return this->file[fileindex]->GetData(blockindex, order).GetNodePosition();
}
int *NameNode::FindData(int nodeindex, int fileindex) {
int arr_size_tmp = file[fileindex]->GetFileSize();
int return_arr[arr_size_tmp];
for(int i=0; i<arr_size_tmp; i++) {
return_arr[i] = -1;
}
int flag = 0;
for(int i=0; i<arr_size_tmp; i++) {
for(int j=0; j<3; j++) {
if(nodeindex == file[fileindex]->GetData(i, j).GetNodePosition()) {
return_arr[flag] = i;
flag++;
}
}
}
node_file_num[nodeindex][fileindex] = flag;
int *return_arr_final = new int[flag];
for(int i=0; i<flag; i++) {
return_arr_final[i] = return_arr[i];
}
return return_arr_final;
}
bool NameNode::IsInNode(int nodeindex, int fileindex, int blockindex) {
}
//Container Class implementation-------------------------------------------------------------------
Container::Container() {
is_working = false;
start_time = 0;
}
void Container::TaskExecute(Node *node, Application *job, int fileidx, int blockidx, string state) {
task = job;
//cache local--------------------------------
if(state == "cache_local") {
start_time += job->GetAvgTaskTime();
job->SetWorkingState(blockidx);
}
}
int Container::GetStartTime() { return start_time; }
bool Container::GetIsWorking() { return is_working; }
int Container::GetAvgTaskTime() { return task->GetAvgTaskTime(); }
//Node Class implementation------------------------------------------------------------------------
Node::Node(int idx, int cachesize, int contsize) {
node_idx = idx;
is_fail = false;
cache_size = cachesize;
container_size = contsize;
container = new Container[container_size];
}
int Node::GetContSize() { return container_size; }
//Application Class implementation--------------------------------------------------------------------
Application::Application(int appnum, string type, File *f, int rednum, int avgtasktime, int cachetime, int datatime, int racktime, int reducetime, int skipcount) {
app_idx = appnum;
app_type = type;
file_idx = f->GetFileIdx();
mapper_num = f->GetFileSize();
reducer_num = rednum;
task_counter = 0;
task_pointer = 0;
avg_task_time_per_block = avgtasktime;
skip_count = skipcount;
skip_checker = 0;
working_state = new bool[mapper_num];
cache_local_avg_map_time = cachetime;
data_local_avg_map_time = datatime;
rack_local_avg_map_time = racktime;
avg_reduce_time = reducetime;
for(int i=0; i<mapper_num; i++) {
working_state[i] = false;
}
}
void Application::SetWorkingState(int taskidx) { working_state[taskidx] = true; }
int Application::GetAvgTaskTime() { return avg_task_time_per_block; }
int Application::GetSkipCount() {return skip_count; }
bool Application::IsCompleted() {
if(skip_count == skip_checker) { return true; }
else { return false; }
}
bool Application::GetWorkingState(int taskidx) { return working_state[taskidx]; }
void Application::AddTaskCounter() { task_counter++; }
//Resourece Manager implemenatation----------------------------------------------------------------
/*
void ResourceManager::JobCompleteManager(NameNode *NM, Node *nodes[]) {
for(int i=0; i<NM->GetNodeSize(); i++) {
for(int j=0; j<nodes[0]->GetContSize(); j++) {
if(nodes[i]->container[j].GetIsWorking() && nodes[i]->container[j].GetWorkingTime()+nodes[i]->container[j].GetAvgTaskTime() >= main_working_time) {
nodes[i]->container[j].task->AddTaskCounter();
nodes[i]->container[j].is_working = false;
}
}
}
}
void ResourceManager::DelayScheduling(NameNode *NM, Node *nodes[], Application *jobs[], int app_num) {
job_pointer = jobs[0];
for(int i=0; i<NM->GetNodeSize(); i++) {
for(int j=0; j<nodes[0]->GetContSize(); j++) {
while(nodes[i]->container[j].GetIsWorking() == false) {
if(job_pointer->IsCompleted()==false && NM->IsInNode(i , job_pointer->file_idx, job_pointer->task_pointer)==true) {
nodes[i]->container[j].TaskExecute(nodes[i], job_pointer, job_pointer->file_idx, job_pointer->task_pointer);
}
if(job_pointer.IsCompleted()==false && NM.IsInNode(i, job_pointer->file_idx, job_pointer->task_pointer)==false) {
job_pointer->skip_count++;
if(job_pointer->skip_count >= job_pointer->skip_checker) {
nodes[i]->container[j].TaskExecute(nodes[i], job_pointer, job_pointer->file_idx, job_pointer->task_pointer);
}
}
job_pointer = job_pointer+4;
//cycling in range
}
}
}
}
*/
void ResourceManager::JobCompleteManager(NameNode *NM, Node *nodes[]) { }
void ResourceManager::DelayScheduling(NameNode *NM, Node *nodes[], Application *jobs[], int app_num) { }
//Main Function
int main() {
// Randomize
srand((unsigned int)time(NULL));
// 1. Node setting
// First, we set each node's size, cache size, container number. Every node have same size.
int node_num, cache_size, container_size;
cout << "Set node numbers, cache size, number of container. \n";
cin >> node_num >> cache_size >> container_size;
Node *nodes[node_num];
for(int i=0; i<node_num; i++) { nodes[i] = new Node(i, cache_size, container_size); }
// 2. Data distribution into node
int file_num;
cout << "How many files do you want to save? \n";
cin >> file_num;
File *files[file_num];
int file_size;
cout << "Set file size n times\n";
for(int i=0; i<file_num; i++) {
cin >> file_size;
files[i] = new File(i, file_size, node_num);
cout << "The file which size is " << file_size << " is stored and distributed in " << node_num << "nodes.\n";
}
NameNode Name(node_num, nodes, file_num, files);
cout << "All files are stored!\n";
cout << Name.GetNodeSize() << endl;
// test print
for(int i=0; i<file_num; i++) {
cout << "############"<<endl;
for(int j=0; j<files[i]->GetFileSize(); j++) cout << files[i]->GetData(j, 0).GetNodePosition() << " ";
cout << endl;
for(int j=0; j<files[i]->GetFileSize(); j++) cout << files[i]->GetData(j, 1).GetNodePosition() << " ";
cout << endl;
for(int j=0; j<files[i]->GetFileSize(); j++) cout << files[i]->GetData(j, 2).GetNodePosition() << " ";
cout << endl;
}
cout << "Each node has these datas.\n";
// test print
for(int i=0; i<node_num; i++) {
cout << "Node " << i << " has\n";
for(int j=0; j<file_num; j++) {
int *arr = Name.FindData(i, j);
for(int k=0; k<Name.GetNodeFileNum(i, j); k++) cout << "(" << j << ", " << arr[k] << ") ";
}
cout << endl;
}
// 3. Job Setting
int app_num;
string apptype;
int inputfile;
int reducenum;
int avgtasktime;
int requesttime;
int skipcount;
cout << "How many Apps do you assign?\n";
cin >> app_num;
Application *Apps[app_num];
cout << "Set job type, input file, reduce tasks, average task time, requesting time, skip count.\n";
for(int i=0; i<app_num; i++) {
cin >> apptype >> inputfile >> reducenum >> avgtasktime >> requesttime >> skipcount;
//Apps[i] = new Application(i, apptype, files[inputfile], reducenum, avgtasktime, requesttime, skipcount);
}
cout << "Application setting is complete.\n";
// 4. Main Task Start
// while(true) {
// }
return 0;
}