-
Notifications
You must be signed in to change notification settings - Fork 0
/
indexSolutions2021.html
485 lines (459 loc) · 31.6 KB
/
indexSolutions2021.html
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
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en-gb" lang=
"en-gb">
<head>
<meta name="style" content="cs" />
<title>University of Bristol - Computer Science - COMS20008 Computer Systems A</title>
<link rel="stylesheet" type="text/css" href="corporate.css" />
<link rel="stylesheet" type="text/css" href="uob.css" />
<script language="javascript">
//LAYOUT CUSTOMIZATION
var currentWeek = 13; // current week [triggers full week visibility, starting with 1, usually going up to 12]
var startWeekNum = 1; // start week number [usual start is prepartion week 1]
var totalWeeks = 13; // total teaching weeks for unit [usually 12] - 5
var activityNum = 10; // number of activities per week (empty slots possible) - 5
var columnNum = 5; // desired columns per week (yet, autofitted to max 2 rows per week)
var title = "Computer Systems A"; // content title at top of the table
var headerOn = 1; // table column headers on(=1) or off(=0), min of 4 columns needed to render
var header1 = "Synchronous Sessions"; // leftmost 1x column header
var header2 = "Asynchronous Materials"; // middle 2x column header
var header3 = "Courseworks & Labs"; // rest of the columns header
var inactColour = "#999999"; // font colour for inactive content
var titleColour = "#191919"; // table title colour
var titleBColour = "#BBBBBB"; // table title background colour
var bkgColour = "#CCCCCC"; // table border background colour
var embossColour = "#AAAAAA"; // table border emboss colour
var fontSizePix = 12; // font size in pixels
var extendCats = ["8", "10", "14"]; // number of categories that have no border to above cell (e.g. for multi-week coursework)
//ACTIVITY CATEGORIES
var y = [
["0", "Concurrency Lecture", "#D2CDF4", "1", "", "Videos", ],
["1", "Distributed Systems Lecture", "#B8D2F4", "1", "", "Content", ],
["2", "Concurrency Lab", "#EFBD81", "1", "Solutions", "", ],
["3", "Distributed Systems Lab", "#FED872", "1", "Solutions", "", ],
["4", "Live Q&A", "#B3EA9A", "1", "Recording", "", ],
["5", "Preparation", "#DDDDDD", "0", "", "", ],
["6", "Formative Coursework", "#EEEEDD", "1", "", "Materials", ],
["7", "Coursework Lab", "#EEEEDD", "1", "", "", ],
["8", "Coursework Continued", "#EEEEDD", "0", "", "", ], // Joining box for coursework over two rows
["9", "", "#CCCCCC", "0", "", "", ], // Grey box
["10", "", "#CCCCCC", "0", "", "", ], // Grey box with no top border
["11", "Join Microsoft Teams", "#DDDDDD", "0", "Link", "", ],
["12", "Laptop Setup", "#DDDDDD", "0", "Link", "", ],
["13", "Pair Signup", "#DDDDDD", "0", "Link", "", ],
["14", "", "#EFBD81", "0", "", "", ], // joining box for concurrency lab over two rows
["15", "", "#D2CDF4", "0", "", "", ], // Joining box for concurrency lecture over two rows
["16", "Intro to Go", "#D9ABAB", "1", "Solutions", "", ],
["17", "Concurrency Lecture Short", "#cce6ff", "1", "", "Videos", ],
["18", "Navigating the Unit", "#DDDDDD", "0", "", "Videos", ],
["19", "All videos on Microsoft Stream channel", "#DDDDDD", "0", "Link", "", ],
["20", "", "#FED872", "0", "", "", ],// joining box for distributed lab over two rows
];
var a = [
//WEEKLY ACTIVITIES
//Category, DATE|TIME, ACTIVITY TITLE, ACTIVITY URL, SLIDES URL, MATERIAL array
// Week 00
["9","","","","",[]],
["18","","Guide to getting started","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008_navigating_unit.pdf","",[5]],
["11","","","","https://teams.microsoft.com/l/team/19%3aecaa5d359adf45e4bc4a4914801294df%40thread.tacv2/conversations?groupId=b48b81f3-96e8-4540-8284-0b84e55a6e85&tenantId=b2e47f30-cd7d-4a4e-a5da-b18cf1a4151b",[]], // Add link
["12","","","","https://github.com/UoB-CSA/setup-guides",[]],
["13","","","","https://doodle.com/poll/349eakgezig7wtde",[]], // Add link
["9","","","","",[]],
["19","","","","https://web.microsoftstream.com/channel/78f83e21-c374-4fe8-bf6a-3e33387f5032",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 01
["4","28/9/21 | 4:00pm | Microsoft Teams","","/?autoplay=true&app=microsoftteams&showinfo=false","",[]],
["0","","Introduction & History","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh01.pdf","",[0,1]],
["0","","Towards Concurrent Programming","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh02.pdf","",[3,4]],
["16","27/9/21 | 4:00pm | Microsoft Teams", "Lab 1","https://github.com/UoB-CSA/intro-to-go-lab-1", "https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK", []],
["16","1/10/21 | 9:00am | Microsoft Teams","Lab 2","https://github.com/UoB-CSA/intro-to-go-lab-2","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK", []],
["9","","","","",[]],
["17","","Producer Consumer at high Level","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/ProducerConsumerProblemComs20008.pdf","",[2]],
["17","","Select and Timers","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008_SelectAndTimers.pdf","",[6]],
["9","","","","",[]],
["9","","","","",[]],
// Week 02
["4","5/10/21 | 4:00pm | Microsoft Teams","","","https://web.microsoftstream.com/video/ffcefe10-1b7d-4738-86dd-5e9b44a8ef2e",[]],
["0","","Deadlock & Channel Communication","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh03.pdf","",[7,8]],
["1","","Introduction to Distributed Systems","","",[10,20,11,21,12]],
["2","4/10/21 | 4:00pm | Microsoft Teams","Median Filter & Parallel Tree Reduction","https://github.com/UoB-CSA/concurrency-lab-1","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["3","8/10/21 | 9:00am | Microsoft Teams","Chat server","https://github.com/UoB-CSA/distributed-lab-1","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 03
["4","12/10/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","Sharing Memory, Locks, semaphores, suspension and Critical Sections ","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh05.pdf","",[13, 14]],
["1","","Remote Invocation","","",[17,22,18,23,19]],
["2","11/10/21 | 4:00pm | Microsoft Teams","Producer Consumer & The Bank","https://github.com/UoB-CSA/concurrency-lab-2","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["3","15/10/21 | 9:00am | Microsoft Teams","Secret Strings & Bottles","https://github.com/UoB-CSA/distributed-lab-2","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["9","","","","",[]],
["0","","Sharing Memory: mutexes and critical sections completed, producer consumer in detail with sempahores","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh06.pdf","",[15, 16]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 04
["4","19/10/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","Sharing memory, locks, critical sections, condition variables and example application","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh07.pdf","",[28,29,30]],
["1","","Indirect Communication","","",[24,25,26,27]],
["14","18/10/21 | 4:00pm | Microsoft Teams","Bank Continued","https://github.com/UoB-CSA/concurrency-lab-2","",[]],
["20","22/10/21 | 9:00am | Microsoft Teams","Secret Strings & Bottles [continued]","https://github.com/UoB-CSA/distributed-lab-2","",[]],
["9","","","","",[]],
["17","","COMS20008, Lecture 6, Trailer","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh07.pdf","",[31]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 05
["4","26/10/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","Inter Process Data Exchange in Go","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008sh04.pdf","",[36]],
["1","","Global State","","",[32,33,34,35]],
["2","25/10/21 | 4:00pm | Microsoft Teams","Posix Threads in C","https://github.com/UoB-CSA/concurrency-lab-3","https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["3","29/10/21 | 9:00am | Microsoft Teams","Message Broker in Go","https://github.com/UoB-CSA/distributed-lab-3", "https://uob-my.sharepoint.com/:f:/g/personal/kg17815_bristol_ac_uk/Ek5jxaSHCAhOkaYVyz5C4nUBIrIUHRolVcVQiOqx_0sl8g?e=ekjsGK",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 06
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 07
["4","9/11/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","Communicating Sequential Processes (CSP) Abstraction: Events, Processes, Traces and Refinement","","",[37, 38]],
["1","","Logical Time","","",[45,46,47,48]],
["2","8/11/21 | 4:00pm | Microsoft Teams","Catch up lab","","",[]],
["3","12/11/21 | 9:00am | Microsoft Teams","Catch up lab","", "",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 08
["4","16/11/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","CSP: Choice, Refusals, Failures","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008_CSP2.pdf","",[39, 40]],
["1","","Leaders & Synchronisers","","",[49,50,51,52]],
["7","15/11/21 | 4:00pm | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["7","19/11/21 | 9:00am | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 09
["4","23/11/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","CSP: External vs Internal Choice, Deadlock, Livelock","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008_CSP3.pdf","",[41, 42]],
["1","","Spanning Trees","","",[53,54,55,56]],
["7","22/11/21 | 4:00pm | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["7","26/11/21 | 9:00am | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 10
["4","30/11/21 | 4:00pm | Microsoft Teams","","https://web.microsoftstream.com/video/7a1f29aa-dc16-4135-8aae-0839e8552ba0","",[]],
["0","","Introduction to Petri Nets","https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008_PetriNets.pdf","",[43, 44]],
["1","","Consensus","","",[57,58,59,60]],
["7","29/11/21 | 4:00pm | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["7","3/12/21 | 9:00am | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
// Week 11
["4","7/12/21 | 4:00pm | Microsoft Teams","","","",[]],
["0","","","","",[]],
["1","","","","",[]],
["7","6/12/21 | 4:00pm | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["7","10/12/20 | 10:00am | Microsoft Teams","Game of Life","https://github.com/UoB-CSA/gol-skeleton-2020","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
["9","","","","",[]],
];
var files = [
//UNIT RESOURCES & MATERIALS
[ "0", "https://mediasite.bris.ac.uk/Mediasite/Play/f30d87bbd7a94516be78f5010fe25a531d", "Part 1, Introduction"],
[ "1", "https://mediasite.bris.ac.uk/Mediasite/Play/ff6e4cf208014c578fb12dfeec4129a71d", "Part 2, History"],
[ "2", "https://mediasite.bris.ac.uk/Mediasite/Play/92defe1312fd4cf8b041dee40bf41c4a1d", "Producer Consumer Problem"],
[ "3", "https://mediasite.bris.ac.uk/Mediasite/Play/37ef01f58922400e8dbea769975cdf761d", "Part 1 (Conceptual)"],
[ "4", "https://mediasite.bris.ac.uk/Mediasite/Play/49522945f1634f17aa74a2db0b1123091d", "Part 2 (Go syntax)"],
[ "5", "https://mediasite.bris.ac.uk/Mediasite/Play/893802e722ab4a2eaf85658fb20970bd1d", "Navigating the unit"],
[ "6", "https://mediasite.bris.ac.uk/Mediasite/Play/9eff0a3277e64d1caffe0c7e245c64891d", "here"],
[ "7", "https://mediasite.bris.ac.uk/Mediasite/Play/40772fccfd8b4bfea5df778cd53ad0ec1d", "Lec 3, Part 1"],
[ "8", "https://mediasite.bris.ac.uk/Mediasite/Play/ce83a30b88a84c56886a2a2f0c44a5c61d", "Lec 3, Part 2"],
[ "9", "grade.c", "grade.c"],
[ "10", "https://mediasite.bris.ac.uk/Mediasite/Play/a0f5f63857f344e69e6d0c20cc357ce91d", "Introduction to Distributed Computing"],
[ "11", "https://mediasite.bris.ac.uk/Mediasite/Play/61a1466318d940cd83d17e08cb363dd41d", "Networks & Models"],
[ "12", "https://mediasite.bris.ac.uk/Mediasite/Play/ade6137f51694f2c8f8183c0d375c53f1d", "Message Passing in Go"],
[ "13", "https://mediasite.bris.ac.uk/Mediasite/Play/f6102004ecab4dcd90219a76d7705bfa1d", "Memory sharing, locks etc. Part 1"],
[ "14", "https://mediasite.bris.ac.uk/Mediasite/Play/7297cf1b135546a7b487b9f384ed50751d", "Memory sharing, locks etc. Part 2"],
[ "15", "https://mediasite.bris.ac.uk/Mediasite/Play/ca5937b493cc49ff924f334fed8fe7a71d", "Part 1: Memory sharing and mutexes completed"],
[ "16", "https://mediasite.bris.ac.uk/Mediasite/Play/824728f331fa4947ae5e8c249a9e37de1d", "Part 2: Producer Consumer with semaphores"],
[ "17", "https://mediasite.bris.ac.uk/Mediasite/Play/71338462962143a195aa6471ce5f6f7f1d", "UDP & TCP"],
[ "18", "https://mediasite.bris.ac.uk/Mediasite/Play/1dcfffb5a04d4739896f687ee16c1d961d", "Remote Procedure Calls"],
[ "19", "https://mediasite.bris.ac.uk/Mediasite/Play/b3dcbb2035b5430c863a07920357aa211d", "RPC in Go"],
[ "20", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me01.pdf", "Introduction to Distributed Computing [slides]"],
[ "21", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me02.pdf", "Networks & Models [slides]"],
[ "22", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me03.pdf", "UDP & TCP [slides]"],
[ "23", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me04.pdf", "Remote Procedure Calls [slides]"],
[ "24", "https://mediasite.bris.ac.uk/Mediasite/Play/986a28e3970744e39bcc98916e26e9fb1d", "The Publish-Subscribe Model"],
[ "25", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me05.pdf", "The Publish-Subscribe Model [slides]"],
[ "26", "https://mediasite.bris.ac.uk/Mediasite/Play/e65543d8640b4ac191e35ad42b4ca5571d", "Distributed Shared Memory"],
[ "27", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me06.pdf", "Distributed Shared Memory [slides]"],
[ "28", "https://mediasite.bris.ac.uk/Mediasite/Play/3bee7b5216be4cd9b48f8cbbd9736a5a1d", "Critical section, mutex and semaphore recap"],
[ "29", "https://mediasite.bris.ac.uk/Mediasite/Play/87b579329cb14b0aabe970dabb2cbdec1d", "Condition variables in full detail"],
[ "30", "https://mediasite.bris.ac.uk/Mediasite/Play/27a3e18f4aab47539cf84590bc02318f1d", "Real-ish world example: semaphores for mutliple client server application"],
[ "31", "https://mediasite.bris.ac.uk/Mediasite/Play/994659b85c004f9983599ab504aeaf4a1d", "COMS20008, Lecture 6, Trailer"],
[ "32", "https://mediasite.bris.ac.uk/Mediasite/Play/820d954e4c0c4bea8bd9f9984923a29b1d", "Consistent Global State"],
[ "33", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me07.pdf", "Consistent Global State [slides]"],
[ "34", "https://mediasite.bris.ac.uk/Mediasite/Play/544aaee177f246379897a6ee6960ef711d", "Chandy-Lamport Snapshotting Algorithm"],
[ "35", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me08.pdf", "Chandy-Lamport Snapshotting Algorithm [slides]"],
[ "36", "https://mediasite.bris.ac.uk/Mediasite/Play/97d7884cb5254403a8960fb64d64b2801d", "Channels and goroutines under the hood"],
[ "37", "https://mediasite.bris.ac.uk/Mediasite/Play/96bc9ff3fe6d4ab0935cd722536313dd1d", "CSP intro, processes, prefixing, recursion, DFA vs process"],
[ "38", "https://mediasite.bris.ac.uk/Mediasite/Play/67e18fb0b9da4f308ee378d2e3cfeb341d", "Traces, trace refinement, safety, alphabetised parallel"],
[ "39", "https://mediasite.bris.ac.uk/Mediasite/Play/c955a485f6fa4eeea6196b5a4017e7171d", "Specification via trace refinement, deadlock, cardinality of state spaces, prefix closure"],
[ "40", "https://mediasite.bris.ac.uk/Mediasite/Play/a587b354a8e0434685ce27663329a5851d", "Refusals, failures, failure refinement, liveness"],
[ "41", "https://mediasite.bris.ac.uk/Mediasite/Play/8aa1651be7a049b1a29a361ae48597e31d", "External vs internal choice, internal choice and traces, refusals and failures"],
[ "42", "https://mediasite.bris.ac.uk/Mediasite/Play/0e01b8d02af64549a8c6aabda7db2d9a1d", "Divergence, livelock, hiding, deadlock in depth, failure divergence refinement"],
[ "43", "https://mediasite.bris.ac.uk/Mediasite/Play/d942a503acb949d5a4605944e128c4411d", "Petri net definition, semaphore example, dynamics and non-determinism, inhibitor arcs"],
[ "44", "https://mediasite.bris.ac.uk/Mediasite/Play/ca44e667f96741528004830f7db4e88f1d", "Petri net analysis, reachabilty graph, boundedness, Karp-Miller algorithm, coverability tree"],
[ "45", "https://mediasite.bris.ac.uk/Mediasite/Play/d4d8975c0b8e4fbebc93df3ba1447b7c1d", "No Shared Clock & Scalar Time"],
[ "46", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me09.pdf", "No Shared Clock & Scalar Time [slides]"],
[ "47", "https://mediasite.bris.ac.uk/Mediasite/Play/9ca139642f8a49dea6d64d91663ec4aa1d", "Vector Clocks"],
[ "48", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me10.pdf", "Vector Clocks [slides]"],
[ "49", "https://mediasite.bris.ac.uk/Mediasite/Play/d19393b620054dc6b28118956ecadb6f1d", "Synchronisers"],
[ "50", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me11.pdf", "Synchronisers [slides]"],
[ "51", "https://mediasite.bris.ac.uk/Mediasite/Play/d850c2a31b4648ea83dc6f66712be42d1d", "Leader Elections"],
[ "52", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me12.pdf", "Leader Elections [slides]"],
[ "53", "https://mediasite.bris.ac.uk/Mediasite/Play/a6744409c4e34531bd3b00f540954fc21d", "Distributed Systems as Graphs"],
[ "54", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me13.pdf", "Distributed Systems as Graphs [slides]"],
[ "55", "https://mediasite.bris.ac.uk/Mediasite/Play/b240c1bbafe54462b69f76207792d7481d", "Spanning Tree Algorithms"],
[ "56", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me14.pdf", "Spanning Tree Algorithms [slides]"],
[ "57", "https://mediasite.bris.ac.uk/Mediasite/Play/6803397858ac425585d434ff15e515a51d", "The Byzantine Generals Problem"],
[ "58", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me15.pdf", "The Byzantine Generals Problem [slides]"],
[ "59", "https://mediasite.bris.ac.uk/Mediasite/Play/b5c9ad6db563406f921046982a0534f11d", "The Byzantine Generals Solutions"],
[ "60", "https://www.ole.bris.ac.uk/bbcswebdav/courses/COMS20008_2021_TB-1/CONTENT_2021/LecturePDFs/coms20008me16.pdf", "The Byzantine Generals Solutions [slides]"]
];
//TILO'S RENDERING CODE
var c = currentWeek,
s = startWeekNum,
t = totalWeeks,
p = activityNum,
pp = columnNum,
b = bkgColour,
o = embossColour,
v = fontSizePix,
ic = inactColour,
cw = extendCats,
tc = titleBColour,
to = titleColour,
f = "#FFFFFF",
x = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
function on(i) {
var x = document.getElementById(i);
x.style.display = "block";
}
function off(i) {
var x = document.getElementById(i);
x.style.display = "none";
}
function tog(i) {
var x = document.getElementById(i);
if (x.style.display == "none") {
x.style.display = "block";
} else {
x.style.display = "none";
}
}
function e(i) {
document.write(i);
}
function r(i) {
return "<tr>" + i + "<\/tr>";
}
function g(i) {
return '<table width="100%" border="0" cellpadding="2" cellspacing="0"><tbody>' + i + "<\/tbody><\/table>";
}
function dd(i, c, n, m, q) {
return '<td width="' + m.toString() + '%" height="0" colspan="' + n.toString() + '" valign="' + q + '" bgcolor="' + c + '"><div style="font-size:' + v.toString() + 'px">' + i + "<\/div><\/td>";
}
function d(i, c, n, m) {
return dd(i, c, n, m, "top");
}
function rr(i, kk) {
var ii = "";
for (k = 0; k < pp; k++) {
if (cw.includes(a[i * p + k + kk - pp][0])) {
ii = ii + d("", o, 1, 0) + d("", b, 1, 0) + d("", y[parseInt(a[i * p + k + kk - pp][0])][2], 1, 0);
} else ii = ii + d("", o, 1, 0) + d("", b, 2, 0);
}
return "<tr>" + d("", o, 1, 0) + d("", b, 1, 0) + ii + d("", b, 1, 0) + d("", o, 1, 0) + "<\/tr>";
}
function z(i) {
return dd(
'<div style="font-size:' + (v + 3).toString() + 'px;transform:rotate(270deg);"><strong><font color="' + o + '">Week<\/font><font color="' + b + '">.<\/font><font color="' + o + '">' + i + "<\/font><\/strong><\/div>",
b,
1,
0,
"middle"
);
}
function u(i) {
var uu = "'";
return r(d("", o, 1, 0) + d("", tc, 3, 0) + d('<div style="font-size:' + (v + 3).toString() + 'px"><strong><font color="' + to + '">' + title + "<\/font><\/strong><\/div>", tc, i - 2, 0) + d("", o, 1, 0));
}
function uu(i) {
if (headerOn == 0) return "";
var uuu = "'";
return (
r(d("", o, 1, 0) + d("", tc, 1, 0) + d("", o, 2 + 3 * pp, 0)) +
r(
d("", o, 1, 0) +
d("", tc, 1, 0) +
d("", o, 1, 0) +
d("", b, 1, 0) +
d('<div style="font-size:' + (v + 3).toString() + 'px"><strong><font color="' + to + '">' + header1 + "<\/font><\/strong><\/div>", b, 1, 0) +
d("", o, 1, 0) +
d('<div style="font-size:' + (v + 3).toString() + 'px"><strong><font color="' + to + '">' + header2 + "<\/font><\/strong><\/div>", b, 5, 0) +
d("", o, 1, 0) +
d('<div style="font-size:' + (v + 3).toString() + 'px"><strong><font color="' + to + '">' + header3 + "<\/font><\/strong><\/div>", b, i - 10, 0) +
d("", o, 1, 0)
)
);
}
function xx(i) {
if (y[parseInt(a[i][0])][3] == "1") return x[parseInt(a[i][0])].toString() + ":";
else return "";
}
function mmm(i) {
var ii = a[i][1] + '<br/><div style="font-size:' + (v + 3).toString() + 'px"><strong>' + y[parseInt(a[i][0])][1] + " " + xx(i) + '<\/strong><\/div><a target="_blank" href="' + a[i][3] + '"><strong>' + a[i][2] + "<\/strong><\/a>";
if ((i + 1) / p - 1 > c - s)
ii =
'<font color="' +
ic +
'">' +
a[i][1] +
'<\/font><br/><div style="font-size:' +
(v + 3).toString() +
'px"><font color="' +
ic +
'"><strong>' +
y[parseInt(a[i][0])][1] +
" " +
xx(i) +
'<\/strong><\/font><\/div><strong><font color="' +
ic +
'">' +
a[i][2] +
"<\/font><\/strong>";
return ii;
}
function gg(i, k) {
var ii = d("", o, 1, 0);
for (j = 0; j < pp; j++) {
if (i * p + j + k - pp < i * p + p) {
if (cw.includes(a[i * p + j + k - pp][0])) {
ii = ii + d("", b, 1, 0) + d("", y[parseInt(a[i * p + j + k - pp][0])][2], 1, 0);
if (j == pp - 1) ii = ii + d("", b, 1, 0);
else ii = ii + d("", o, 1, 0);
} else ii = ii + d("", o, 3, 0);
} else ii = ii + d("", o, 3, 0);
}
return ii + d("", o, 1, 0);
}
function zz(i) {
var k,
m = "";
for (k = 0; k < a[i][5].length; k++) {
m = m + '<a target="_blank" href="' + files[a[i][5][k]][1] + '"><i>' + files[a[i][5][k]][2] + "<\/i><\/a>";
if (k + 1 < a[i][5].length) m = m + "<br/>";
}
return m;
}
function mm(i) {
if ((i + 1) / p - 1 > c - s) return "";
var uu = "'";
var m = "";
if (y[parseInt(a[i][0])][4] != "" && a[i][4]) m = m + '<a target="_blank" href="' + a[i][4] + '">' + y[parseInt(a[i][0])][4] + "<\/a>";
if (y[parseInt(a[i][0])][4] != "" && y[parseInt(a[i][0])][5] != "") m = m + ", ";
if (y[parseInt(a[i][0])][5] != "") m = m + '<a href="javascript:tog(' + uu + "l" + i.toString() + uu + ')">' + y[parseInt(a[i][0])][5] + "<\/a>";
if (y[parseInt(a[i][0])][4] + y[parseInt(a[i][0])][5] == "") m = "";
else m = "(" + m + ")";
m =
m +
'<div id="l' +
i.toString() +
'"><hr/><table width="100%" border="0" cellpadding="2" cellspacing="0"><tbody><tr><td width="0%" valign="top"><u><i>' +
y[parseInt(a[i][0])][5] +
':<\/i><\/u><\/td><td width="100%" valign="top">' +
zz(i) +
"<\/td><\/tr><\/tbody><\/table><\/div>";
return m;
}
function w(i) {
x[parseInt(a[i][0])]++;
return d(mmm(i) + "<br/>" + mm(i), y[parseInt(a[i][0])][2], 1, 100 / pp);
}
function m() {
if ((1.0 * p) / pp > 2) pp = p / 2;
if (pp > p) pp = p;
if (pp < 4) header = 0;
var i,
j = r(d("", o, 4 + 3 * pp, 0)) + u(1 + 3 * pp) + uu(1 + 3 * pp);
for (i = 0; i < t; i++) {
var hh = 1;
var hhh = 0;
var h = d("", o, 1, 0) + z((i + s).toString());
for (k = 0; k < p; k++) {
hhh++;
h = h + d("", o, 1, 0) + d("", b, 1, 0) + w(i * p + k);
if (k + 1 == pp * hh && k + 1 < p) {
j = j + r(d("", o, 1, 0) + d("", o, 1, 0) + gg(i, pp * hh)) + rr(i, pp * hh) + r(h + d("", b, 1, 0) + d("", o, 1, 0));
hh++;
h = d("", o, 1, 0) + d("", b, 1, 0) + d("", o, 1, 0) + d("", b, 1, 0) + w(i * p + k);
}
}
var bb = o;
if (hh > 1) bb = b;
while (hhh + 1 < hh * pp) {
h = h + d("", o, 1, 0) + d("", b, 2, 0);
hhh++;
}
j = j + r(d("", o, 1, 0) + d("", bb, 1, 0) + gg(i, pp * hh)) + rr(i, pp * hh) + r(h + d("", b, 1, 0) + d("", o, 1, 0));
}
e(g(j + r(d("", o, 4 + 3 * pp, 0)) + r(d("", b, 4 + 3 * pp, 0))));
}
function make() {
m();
var i;
for (i = 0; i < t * p; i++) off("l" + i.toString());
}
</script>
</head>
<body>
<script async src="https://www.googletagmanager.com/gtag/js?id=G-J794G6LM93"></script>
<script language="javascript">
make();
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'G-J794G6LM93');
</script>
</body>
</html>