jekyll-theme-gaeblogx 0.2 → 1.0.1

Sign up to get free protection for your applications and to get access to all the features.
Files changed (102) hide show
  1. checksums.yaml +4 -4
  2. data/README.md +63 -5
  3. data/assets/page/{4about.html → 4about.md} +0 -0
  4. metadata +2 -100
  5. data/assets/10.jpg +0 -0
  6. data/assets/AWS-Introduction-ec2.png +0 -0
  7. data/assets/Cache-Oblivious-Algorithms-FunnelSort.jpg +0 -0
  8. data/assets/Condition-Variables-fig1.png +0 -0
  9. data/assets/Dynamic-Compilation-adaptJVM.pdf +0 -0
  10. data/assets/Dynamic-Compilation-dyncomp.pdf +0 -0
  11. data/assets/Fibonacci-Heap-Fig3.png +0 -0
  12. data/assets/Fibonacci-Heap-Fig5.png +0 -0
  13. data/assets/Fibonacci-Heap-Fig6.png +0 -0
  14. data/assets/Fibonacci-Heap-Fig7.png +0 -0
  15. data/assets/File-System-bc.jpg +0 -0
  16. data/assets/File-System-filetable.rich.jpg +0 -0
  17. data/assets/GIL-Battle.png +0 -0
  18. data/assets/GIL-CPU.png +0 -0
  19. data/assets/GIL-Check.png +0 -0
  20. data/assets/GIL-IO.png +0 -0
  21. data/assets/GIL-Measure-1.png +0 -0
  22. data/assets/GIL-Measure-2.png +0 -0
  23. data/assets/GIL-Signal.png +0 -0
  24. data/assets/GIL-Tick.png +0 -0
  25. data/assets/Garbage-Collection-Slides-gc.pdf +0 -0
  26. data/assets/Garbage-Collection-copying-1.png +0 -0
  27. data/assets/Garbage-Collection-copying-2.png +0 -0
  28. data/assets/Garbage-Collection-free-list.png +0 -0
  29. data/assets/Garbage-Collection-generation-1.png +0 -0
  30. data/assets/Garbage-Collection-mark-sweep.png +0 -0
  31. data/assets/Garbage-Collection-nursery-1.png +0 -0
  32. data/assets/Garbage-Collection-nursery-2.png +0 -0
  33. data/assets/Garbage-Collection-nursery-3.png +0 -0
  34. data/assets/Garbage-Collection-nursery-4.png +0 -0
  35. data/assets/Garbage-Collection-nursery-5.png +0 -0
  36. data/assets/Garbage-Collection-process.png +0 -0
  37. data/assets/Garbage-Collection-ref-counting.png +0 -0
  38. data/assets/Interpreter-Optimization-interp.pdf +0 -0
  39. data/assets/Memory-Management-fig1.png +0 -0
  40. data/assets/Memory-Management-fig2.png +0 -0
  41. data/assets/Memory-Management-fig3.png +0 -0
  42. data/assets/Memory-Management-fig4.png +0 -0
  43. data/assets/Memory-Management-fig5.png +0 -0
  44. data/assets/Memory-Management-fig6.png +0 -0
  45. data/assets/Memory-Management-fig7.png +0 -0
  46. data/assets/Memory-Management-fig8.png +0 -0
  47. data/assets/Multicore-GIL-1.png +0 -0
  48. data/assets/Multicore-GIL-2.png +0 -0
  49. data/assets/My-Photo.JPG +0 -0
  50. data/assets/Operating-System-Virtualization-ept.png +0 -0
  51. data/assets/Operating-System-Virtualization-guest-page.png +0 -0
  52. data/assets/Operating-System-Virtualization-kvm-arch.png +0 -0
  53. data/assets/Operating-System-Virtualization-kvm-process.png +0 -0
  54. data/assets/Operating-System-Virtualization-kvm-qemu.png +0 -0
  55. data/assets/Operating-System-Virtualization-kvm-state.png +0 -0
  56. data/assets/Operating-System-Virtualization-vtx.png +0 -0
  57. data/assets/Operating-System-Virtualization-xen-arch.png +0 -0
  58. data/assets/Program-Profiling-profiling.pdf +0 -0
  59. data/assets/Programming-Language-Virtual-Machine-vm.pdf +0 -0
  60. data/assets/Remote-Shell-Session-Setup-1.png +0 -0
  61. data/assets/Signals-1.png +0 -0
  62. data/assets/Signals-2.png +0 -0
  63. data/assets/Signals-3.png +0 -0
  64. data/assets/Some-Slides-about-Containers-Kubernetes.pdf +0 -0
  65. data/assets/Some-Slides-about-Containers-UCSB-nurmi.pdf +0 -0
  66. data/assets/Some-Slides-about-PaaS-CS293B_CloudPlatforms.pdf +0 -0
  67. data/assets/avg-1thread.c +0 -172
  68. data/assets/avg-manythread.c +0 -284
  69. data/assets/avg-nothread.c +0 -71
  70. data/assets/file-create1.c +0 -75
  71. data/assets/file-create2.c +0 -120
  72. data/assets/file-fd1.c +0 -56
  73. data/assets/file-fd2.c +0 -25
  74. data/assets/file-fd3.c +0 -23
  75. data/assets/file-read1.c +0 -62
  76. data/assets/file-read2.c +0 -66
  77. data/assets/file-seek1.c +0 -87
  78. data/assets/fork-1.c +0 -35
  79. data/assets/fork-2.c +0 -44
  80. data/assets/fork-3.c +0 -60
  81. data/assets/fork-4.c +0 -64
  82. data/assets/joinall-1.c +0 -163
  83. data/assets/joinall-2.c +0 -162
  84. data/assets/market-kthreads.c +0 -465
  85. data/assets/market-semaphore.c +0 -504
  86. data/assets/market1.c +0 -478
  87. data/assets/market2.c +0 -490
  88. data/assets/market3.c +0 -503
  89. data/assets/market4.c +0 -509
  90. data/assets/my-cat.c +0 -35
  91. data/assets/pipe-1.c +0 -45
  92. data/assets/pipe-2.c +0 -80
  93. data/assets/pipe-3.c +0 -83
  94. data/assets/pipe-4.c +0 -116
  95. data/assets/race1.c +0 -75
  96. data/assets/race2.c +0 -77
  97. data/assets/race3.c +0 -87
  98. data/assets/race_ABC.c +0 -144
  99. data/assets/semaphore.book.ps +0 -8827
  100. data/assets/sys-call1.c +0 -20
  101. data/assets/sys-call2.c +0 -16
  102. data/assets//350/265/253/347/202/2161.PNG +0 -0
data/assets/market2.c DELETED
@@ -1,490 +0,0 @@
1
- /*
2
- * cs170 -- Rich wolski
3
- * producer-consumer example
4
- * uses condition variables for full/empty conditions
5
- */
6
- #include <unistd.h>
7
- #include <stdlib.h>
8
- #include <stdio.h>
9
- #include <pthread.h>
10
- #include <string.h>
11
-
12
- #include "c-timer.h"
13
-
14
- #define RAND() (drand48())
15
-
16
- struct order
17
- {
18
- int stock_id;
19
- int quantity;
20
- int action; /* buy or sell */
21
- int fulfilled;
22
- };
23
-
24
- struct order_que
25
- {
26
- struct order **orders;
27
- int size;
28
- int head;
29
- int tail;
30
- pthread_mutex_t lock;
31
- pthread_cond_t full;
32
- pthread_cond_t empty;
33
- };
34
-
35
- struct market
36
- {
37
- pthread_mutex_t lock;
38
- int *stocks;
39
- int count;
40
- };
41
-
42
- struct order *InitOrder(int id, int quantity, int action)
43
- {
44
- struct order *order;
45
-
46
- order = (struct order *)malloc(sizeof(struct order));
47
- if(order == NULL) {
48
- return(NULL);
49
- }
50
- order->stock_id = id;
51
- order->quantity = quantity;
52
- order->action = action;
53
- order->fulfilled = 0;
54
- return(order);
55
- }
56
-
57
- void FreeOrder(struct order *order)
58
- {
59
- free(order);
60
- }
61
-
62
- struct order_que *InitOrderQue(int size)
63
- {
64
- struct order_que *oq;
65
-
66
- oq = (struct order_que *)malloc(sizeof(struct order_que));
67
- if(oq == NULL) {
68
- return(NULL);
69
- }
70
- memset(oq,0,sizeof(struct order_que));
71
-
72
- oq->size = size+1; /* empty condition burns a slot */
73
- oq->orders = (struct order **)malloc(oq->size*sizeof(struct order *));
74
- if(oq->orders == NULL) {
75
- free(oq);
76
- return(NULL);
77
- }
78
- memset(oq->orders,0,size*sizeof(struct order *));
79
-
80
- pthread_mutex_init(&oq->lock,NULL);
81
- pthread_cond_init(&oq->full,NULL);
82
- pthread_cond_init(&oq->empty,NULL);
83
-
84
- return(oq);
85
- }
86
-
87
- void FreeOrderQue(struct order_que *oq)
88
- {
89
- while(oq->head != oq->tail) {
90
- FreeOrder(oq->orders[oq->tail]);
91
- oq->tail = (oq->tail + 1) % oq->size;
92
- }
93
-
94
- free(oq->orders);
95
- free(oq);
96
- return;
97
- }
98
-
99
- struct market *InitMarket(int stock_count, int init_quantity)
100
- {
101
- struct market *m;
102
- int i;
103
-
104
- m = (struct market *)malloc(sizeof(struct market));
105
- if(m == NULL) {
106
- return(NULL);
107
- }
108
- m->count = stock_count;
109
-
110
- m->stocks = (int *)malloc(stock_count*sizeof(int));
111
- if(m->stocks == NULL) {
112
- free(m);
113
- return(NULL);
114
- }
115
-
116
- for(i=0; i < stock_count; i++) {
117
- m->stocks[i] = init_quantity;
118
- }
119
-
120
- pthread_mutex_init(&m->lock,NULL);
121
-
122
- return(m);
123
- }
124
-
125
- void FreeMarket(struct market *m)
126
- {
127
- free(m->stocks);
128
- free(m);
129
- return;
130
- }
131
-
132
- void PrintMarket(struct market *m)
133
- {
134
- int i;
135
- for(i=0; i < m->count; i++) {
136
- printf("stock: %d, quantity: %d\n",
137
- i,m->stocks[i]);
138
- }
139
-
140
- return;
141
- }
142
-
143
- struct client_arg
144
- {
145
- int id;
146
- int order_count;
147
- struct order_que *order_que;
148
- int max_stock_id;
149
- int max_quantity;
150
- int verbose;
151
- };
152
-
153
- struct trader_arg
154
- {
155
- int id;
156
- struct order_que *order_que;
157
- struct market *market;
158
- int *done;
159
- int verbose;
160
- };
161
-
162
- void *ClientThread(void *arg)
163
- {
164
- struct client_arg *ca = (struct client_arg *)arg;
165
- int i;
166
- int next;
167
- struct order *order;
168
- int stock_id;
169
- int quantity;
170
- int action;
171
- int queued;
172
- double now;
173
-
174
-
175
- for(i=0; i < ca->order_count; i++) {
176
- /*
177
- * create an order for a random stock
178
- */
179
- stock_id = (int)(RAND() * ca->max_stock_id);
180
- quantity = (int)(RAND() * ca->max_quantity);
181
- if(RAND() > 0.5) {
182
- action = 0; /* 0 => buy */
183
- } else {
184
- action = 1; /* 1 => sell */
185
- }
186
- order = InitOrder(stock_id,quantity,action);
187
- if(order == NULL) {
188
- fprintf(stderr,"no space for order\n");
189
- exit(1);
190
- }
191
- /*
192
- * queue it for the traders
193
- */
194
- queued = 0;
195
- while(queued == 0) {
196
- pthread_mutex_lock(&(ca->order_que->lock));
197
- next = (ca->order_que->head + 1) % ca->order_que->size;
198
- /*
199
- * is the queue full?
200
- */
201
- while(next == ca->order_que->tail) {
202
- pthread_cond_wait(&(ca->order_que->full),
203
- &(ca->order_que->lock));
204
- next = (ca->order_que->head + 1) % ca->order_que->size;
205
- }
206
- /*
207
- * there is space in the queue, add the order and bump
208
- * the head
209
- */
210
- if(ca->verbose == 1) {
211
- now = CTimer();
212
- printf("%10.0f client %d: ",now,ca->id);
213
- printf("queued stock %d, for %d, %s\n",
214
- order->stock_id,
215
- order->quantity,
216
- (order->action ? "SELL" : "BUY"));
217
- }
218
- ca->order_que->orders[next] = order;
219
- ca->order_que->head = next;
220
- queued = 1;
221
- pthread_cond_signal(&(ca->order_que->empty));
222
- pthread_mutex_unlock(&(ca->order_que->lock));
223
-
224
- /*
225
- * spin waiting until the order is fulfilled
226
- */
227
- while(order->fulfilled == 0);
228
- /*
229
- * done, free the order and repeat
230
- */
231
- FreeOrder(order);
232
- }
233
- }
234
-
235
- return(NULL);
236
- }
237
-
238
- void *TraderThread(void *arg)
239
- {
240
- struct trader_arg *ta = (struct trader_arg *)arg;
241
- int dequeued;
242
- struct order *order;
243
- int tail;
244
- double now;
245
- int next;
246
-
247
- while(1) {
248
- dequeued = 0;
249
- while(dequeued == 0) {
250
- pthread_mutex_lock(&(ta->order_que->lock));
251
- /*
252
- * is the queue empty?
253
- */
254
- while(ta->order_que->head == ta->order_que->tail) {
255
- /*
256
- * if the queue is empty, are we done?
257
- */
258
- if(*(ta->done) == 1) {
259
- pthread_cond_signal(&(ta->order_que->empty));
260
- pthread_mutex_unlock(&(ta->order_que->lock));
261
- pthread_exit(NULL);
262
- }
263
- pthread_cond_wait(&(ta->order_que->empty),
264
- &(ta->order_que->lock));
265
- }
266
- /*
267
- * get the next order
268
- */
269
- next = (ta->order_que->tail + 1) % ta->order_que->size;
270
- order = ta->order_que->orders[next];
271
- ta->order_que->tail = next;
272
- pthread_cond_signal(&(ta->order_que->full));
273
- pthread_mutex_unlock(&(ta->order_que->lock));
274
- dequeued = 1;
275
- }
276
- /*
277
- * have an order to process
278
- */
279
- pthread_mutex_lock(&(ta->market->lock));
280
- if(order->action == 1) { /* BUY */
281
- ta->market->stocks[order->stock_id] -= order->quantity;
282
- if(ta->market->stocks[order->stock_id] < 0) {
283
- ta->market->stocks[order->stock_id] = 0;
284
- }
285
- } else {
286
- ta->market->stocks[order->stock_id] += order->quantity;
287
- }
288
- pthread_mutex_unlock(&(ta->market->lock));
289
- if(ta->verbose == 1) {
290
- now = CTimer();
291
- printf("%10.0f trader: %d ",now,ta->id);
292
- printf("fulfilled stock %d for %d\n",
293
- order->stock_id,
294
- order->quantity);
295
- }
296
- /*
297
- * tell the client the order is done
298
- */
299
- order->fulfilled = 1;
300
- }
301
-
302
- return(NULL);
303
- }
304
-
305
- #define ARGS "c:t:o:q:s:V"
306
- char *Usage = "market1 -c clients -t traders -o orders -q queue-size -s stock-count -V <verbose on>\n";
307
-
308
- #define INIT_COUNT 5000
309
-
310
- int main(int argc, char **argv)
311
- {
312
- int c;
313
- int client_threads;
314
- int trader_threads;
315
- int orders_per_client;
316
- int que_size;
317
- int max_stock;
318
- int verbose;
319
- struct client_arg *ca;
320
- struct trader_arg *ta;
321
- pthread_t *client_ids;
322
- pthread_t *trader_ids;
323
- struct order_que *order_que;
324
- struct market *market;
325
- int i;
326
- int done;
327
- int err;
328
- double start;
329
- double end;
330
-
331
-
332
- /*
333
- * defaults
334
- */
335
- client_threads = 1;
336
- trader_threads = 1;
337
- orders_per_client = 1;
338
- verbose = 0;
339
- que_size = 1;
340
- max_stock = 1;
341
-
342
- while((c = getopt(argc,argv,ARGS)) != EOF) {
343
- switch(c) {
344
- case 'c':
345
- client_threads = atoi(optarg);
346
- break;
347
- case 't':
348
- trader_threads = atoi(optarg);
349
- break;
350
- case 'o':
351
- orders_per_client = atoi(optarg);
352
- break;
353
- case 'q':
354
- que_size = atoi(optarg);
355
- break;
356
- case 's':
357
- max_stock = atoi(optarg);
358
- break;
359
- case 'V':
360
- verbose = 1;
361
- break;
362
- default:
363
- fprintf(stderr,
364
- "unrecognized command %c\n",
365
- (char)c);
366
- fprintf(stderr,"usage: %s",Usage);
367
- exit(1);
368
- }
369
- }
370
-
371
- client_ids = (pthread_t *)malloc(client_threads*sizeof(pthread_t));
372
- if(client_ids == NULL) {
373
- exit(1);
374
- }
375
-
376
- ca = (struct client_arg *)malloc(client_threads*sizeof(struct client_arg));
377
- if(ca == NULL) {
378
- exit(1);
379
- }
380
-
381
- trader_ids = (pthread_t *)malloc(trader_threads*sizeof(pthread_t));
382
- if(trader_ids == NULL) {
383
- exit(1);
384
- }
385
-
386
- ta = (struct trader_arg *)malloc(trader_threads*sizeof(struct trader_arg));
387
- if(ta == NULL) {
388
- exit(1);
389
- }
390
-
391
- order_que = InitOrderQue(que_size);
392
- if(order_que == NULL) {
393
- exit(1);
394
- }
395
-
396
- market = InitMarket(max_stock,INIT_COUNT);
397
- if(market == NULL) {
398
- exit(1);
399
- }
400
-
401
- start = CTimer();
402
- for(i=0; i < client_threads; i++) {
403
- ca[i].id = i;
404
- ca[i].order_count = orders_per_client;
405
- ca[i].max_stock_id = max_stock;
406
- ca[i].max_quantity = INIT_COUNT;
407
- ca[i].order_que = order_que;
408
- ca[i].verbose = verbose;
409
- err = pthread_create(&client_ids[i],NULL,
410
- ClientThread,(void *)&ca[i]);
411
- if(err != 0) {
412
- fprintf(stderr,"client thread create %d failed\n",i);
413
- exit(1);
414
- }
415
- }
416
-
417
- done = 0;
418
- for(i=0; i < trader_threads; i++) {
419
- ta[i].id = i;
420
- ta[i].order_que = order_que;
421
- ta[i].market = market;
422
- ta[i].done = &done;
423
- ta[i].verbose = verbose;
424
- err = pthread_create(&trader_ids[i],NULL,
425
- TraderThread,(void *)&ta[i]);
426
- if(err != 0) {
427
- fprintf(stderr,"trader thread create %d failed\n",i);
428
- exit(1);
429
- }
430
- }
431
-
432
- /*
433
- * wait for the clients to finish
434
- */
435
- for(i=0; i < client_threads; i++) {
436
- err = pthread_join(client_ids[i],NULL);
437
- if(err != 0) {
438
- fprintf(stderr,"client join %d failed\n",i);
439
- exit(1);
440
- }
441
- }
442
-
443
- /*
444
- * tell the traders we are done
445
- */
446
- pthread_mutex_lock(&order_que->lock);
447
- done = 1;
448
- pthread_cond_signal(&order_que->empty);
449
- pthread_mutex_unlock(&order_que->lock);
450
-
451
- for(i=0; i < trader_threads; i++) {
452
- err = pthread_join(trader_ids[i],NULL);
453
- if(err != 0) {
454
- fprintf(stderr,"trader join %d failed\n",i);
455
- exit(1);
456
- }
457
- }
458
- end = CTimer();
459
-
460
- if(verbose == 1) {
461
- PrintMarket(market);
462
- }
463
-
464
- printf("%f transactions / sec\n",
465
- (double)(orders_per_client*client_threads) / (end-start));
466
-
467
- free(ca);
468
- free(ta);
469
- free(client_ids);
470
- free(trader_ids);
471
- FreeMarket(market);
472
- FreeOrderQue(order_que);
473
-
474
- return(0);
475
- }
476
-
477
-
478
-
479
-
480
-
481
-
482
-
483
-
484
-
485
-
486
-
487
-
488
-
489
-
490
-