-
Notifications
You must be signed in to change notification settings - Fork 0
/
syllabus.html
276 lines (270 loc) · 9.71 KB
/
syllabus.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
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html
PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xml:lang="en" lang="en">
<head>
<title>CS-240 Syllabus</title>
<link rel="stylesheet" type="text/css" href="style.css" />
<meta http-equiv="Content-Script-Type" content="text/javascript" />
</script>
</head>
<body>
<h1>CS-240 Syllabus</h1>
<div id="topnavbar">
<ul class="topnavlist">
<li><a href="index.html">CS-240 Home</a></li>
<li><a href="syllabus.html">Syllabus</a></li>
<li><a href="assignments.html">Assignments</a></li>
<li><a href="announcements.html">Announcements</a></li>
<li><a href="https://piazza.com/kaust.edu.sa/fall2017/cs240/home">Q & A</a></li>
</ul>
</div>
<h2>Schedule<a name="Schedule"></a></h2>
<p>This schedule and syllabus is preliminary and subject to change.</p>
<p>
Lectures and related materials are licensed for use under a
<a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/3.0/">Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License</a>.
Michael Freedman and Kyle Jamieson developed much of the original material.
</p>
<p><a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-nc-sa/3.0/88x31.png" /></a>
</p>
<table class="schedule">
<tr>
<th>Date</th>
<th>Topics</th>
<th>Readings</th>
<th>Notes</th>
</tr>
<tr class="lechead">
<td class="lechead" colspan="4">Fundamentals</td>
</tr>
<tr class="recitation">
<td>Sun 08/20</td>
<td>Go systems programming [<a href="slides/01-intro-to-go.pdf">pdf</a>] [<a href="slides/01-intro-to-go.pptx">pptx</a>]
</td> <td> </td>
<td></td>
</tr>
<tr class="recitation">
<td>Wed 08/23</td>
<td>Concurrency in Go [<a href="slides/02-concurrency-in-go.pdf">pdf</a>] [<a href="slides/02-concurrency-in-go.pptx">pptx</a>] [<a href="slides/02-code.tar.gz">code</a>]
</td> <td><i>Suggested reading:</i> <a href="https://tour.golang.org">Go Tutorial</a> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 08/27</td>
<td>Course overview, principles, MapReduce [<a href="slides/L1-intro.pdf">pdf</a>] [<a href="slides/L1-intro.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/map-reduce.pdf">Map Reduce</a> </td>
<td><a href="a1.html">Assignment 1</a> out</td>
</tr>
<tr class="lecture alt">
<td>Wed 08/30</td>
<td>Network communication and Remote Procedure Calls [<a href="slides/L2-rpc.pdf">pdf</a>] [<a href="slides/L2-rpc.pptx">pptx</a>]
</td> <td> </td>
<td></td>
</tr>
<tr class="noclass">
<td>Sun 09/03</td>
<td>Eid Al-Adha break
</td> <td> </td>
<td></td>
</tr>
<tr class="noclass">
<td>Wed 09/06</td>
<td>Eid Al-Adha break
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 09/10</td>
<td>Virtualization and Cloud computing [<a href="slides/L3-cloud-VM.pdf">pdf</a>] [<a href="slides/L3-cloud-VM.pptx">pptx</a>]
</td> <td>See also the <a href="http://pages.cs.wisc.edu/~remzi/OSTEP/vmm-intro.pdf">book chapter on Virtual Machines from the Wisconsin OS book</a> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 09/13</td>
<td>Network file systems [<a href="slides/L4-nfs.pdf">pdf</a>] [<a href="slides/L4-nfs.pptx">pptx</a>]
</td> <td>See also the <a href="http://ostep.org">book chapters on AFS and NFS from the Wisconsin OS book</a></td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 09/17</td>
<td><strike>GFS</strike> Time synchronization and logical clocks [<a href="slides/L5-time.pdf">pdf</a>] [<a href="slides/L5-time.pptx">pptx</a>]
</td> <td> </td>
<td>Prof. Mootaz Elnozahy</td>
</tr>
<tr class="recitation">
<td>Wed 09/20</td>
<td>Lab 1: Virtualization, sockets, RPCs [<a href="labs/lab1-handout.pdf">pdf</a>] [<a href="labs/lab1-code.tar.gz">code</a>]
</td> <td> </td>
<td><a href="a1.html">Assignment 1</a> due<br/><a href="a2.html">Assignment 2</a> out</td>
</tr>
<tr class="noclass">
<td>Sun 09/24</td>
<td>Saudi National Day
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 09/27</td>
<td>Global state and gossip [<a href="slides/L6-global.pdf">pdf</a>] [<a href="slides/L6-global.pptx">pptx</a>]
</td> <td> </td>
<td></td>
</tr>
<tr class="lechead">
<td class="lechead" colspan="4">Fault Tolerance</td>
</tr>
<tr class="lecture">
<td>Sun 10/01</td>
<td>Primary-backup replication [<a href="slides/L7-pb.pdf">pdf</a>] [<a href="slides/L7-pb.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/scales-vm.pdf">VM replication</a> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Tue 10/03 5:30-7:00PM</td>
<td>GFS [<a href="slides/L4b-gfs.txt">txt</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/gfs.pdf">GFS</a> </td>
<td>Bldg 9: Room 3125</td>
</tr>
<tr class="noclass">
<td>Wed 10/04</td>
<td>No class
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 10/08</td>
<td>Two-phase commit, introducing safety and liveness [<a href="slides/L8-2pc.pdf">pdf</a>] [<a href="slides/L8-2pc.pptx">pptx</a>]
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 10/11</td>
<td><span>Consensus I:</span> FLP Impossibility, Paxos [<a href="slides/L9-consensus-1.pdf">pdf</a>] [<a href="slides/L9-consensus-1.pptx">pptx</a>]
</td> <td>See also <a href="https://the-paper-trail.org/blog/a-brief-tour-of-flp-impossibility/">A Brief Tour of FLP Impossibility
</a> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 10/15</td>
<td><span>Consensus II:</span> Replicated State Machines, Raft [<a href="slides/L10-consensus-2.pdf">pdf</a>] [<a href="slides/L10-consensus-2.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/raft.pdf">Raft</a><br/>See also an <a href="https://www.youtube.com/watch?v=YbZ3zDzDnrw">online lecture about Raft by John Ousterhout</a> </td>
<td><a href="a2.html">Assignment 2</a> due<br/><a href="a3.html">Assignment 3</a> out</td>
</tr>
<tr class="lecture alt">
<td>Wed 10/18</td>
<td>Byzantine Fault Tolerance [<a href="slides/L11-bft.pdf">pdf</a>] [<a href="slides/L11-bft.pptx">pptx</a>]
</td> <td><i>Suggested reading:</i> <a href="papers/bft.pdf">Practical BFT</a><br/>See also an <a href="http://techtv.mit.edu/genres/19-engineering/videos/16444-practical-byzantine-fault-tolerance">online lecture about BFT by Barbara Liskov</a> </td>
<td></td>
</tr>
<tr class="lechead">
<td class="lechead" colspan="4">Scalability, Consistency, and Transactions</td>
</tr>
<tr class="lecture alt">
<td>Sun 10/22</td>
<td>Peer-to-Peer Systems and Distributed Hash Tables [<a href="slides/L12-dhts.pdf">pdf</a>] [<a href="slides/L12-dhts.pptx">pptx</a>]
</td> <td><i>Suggested reading:</i> <a href="papers/chord.pdf">Chord</a> </td>
<td></td>
</tr>
<tr class="exam">
<td>Tue 10/24 2:30-4:00PM</td>
<td>Midterm review session
</td> <td> </td>
<td>Bldg 9: Room 4225 (tentative)<br/>Bring your questions!</td>
</tr>
<tr class="lecture">
<td>Wed 10/25</td>
<td>Eventual consistency [<a href="slides/L13-eventual.pdf">pdf</a>] [<a href="slides/L13-eventual.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/bayou.pdf">Bayou</a><br/><i>Suggested reading:</i> <a href="papers/flexible.pdf">Flexible Updates</a> </td>
<td></td>
</tr>
<tr class="exam">
<td>Sun 10/29</td>
<td>Midterm in-class exam
</td> <td> </td>
<td>Covering till Byzantine Fault Tolerance</td>
</tr>
<tr class="lecture alt">
<td>Wed 11/01</td>
<td><span>Scaling Services:</span> Key-Value Storage [<a href="slides/L14-scaling.pdf">pdf</a>] [<a href="slides/L14-scaling.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/dynamo.pdf">Dynamo</a> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 11/05</td>
<td>Strong consistency and CAP Theorem [<a href="slides/L15-strong-cap.pdf">pdf</a>] [<a href="slides/L15-strong-cap.pptx">pptx</a>]
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 11/08</td>
<td>Causal consistency [<a href="slides/L16-causal.pdf">pdf</a>] [<a href="slides/L16-causal.pptx">pptx</a>]
</td> <td><i>Suggested reading:</i> <a href="papers/cops.pdf">COPS</a> </td>
<td><a href="a3.html">Assignment 3</a> due<br/><a href="a4.html">Assignment 4</a> out</td>
</tr>
<tr class="lecture">
<td>Sun 11/12</td>
<td>Concurrency Control, Locking, and Recovery [<a href="slides/L17-cc.pdf">pdf</a>] [<a href="slides/L17-cc.pptx">pptx</a>]
</td> <td><b>Pre-reading:</b> <a href="papers/franklin97.pdf">Franklin</a>, up to and including §3.2 </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 11/15</td>
<td>Concurrency Control 2 and Distributed Transactions
</td> <td><i>Suggested reading:</i> <a href="papers/spanner.pdf">Spanner</a> </td>
<td></td>
</tr>
<tr class="lechead">
<td class="lechead" colspan="4">Boutique Topics</td>
</tr>
<tr class="lecture">
<td>Sun 11/19</td>
<td>Security
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture alt">
<td>Wed 11/22</td>
<td>Blockchains
</td> <td><b>Pre-reading:</b> <a href="papers/bitcoin.pdf">Bitcoin</a> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 11/26</td>
<td>Performance evaluation
</td> <td> </td>
<td></td>
</tr>
<tr class="lechead">
<td class="lechead" colspan="4">More Big Data Processing</td>
</tr>
<tr class="lecture alt">
<td>Wed 11/29</td>
<td>Data-intensive computing I: graph processing, distributed ML
</td> <td> </td>
<td></td>
</tr>
<tr class="lecture">
<td>Sun 12/03</td>
<td>Data-intensive computing II: stream processing, coordination
</td> <td> </td>
<td></td>
</tr>
<tr class="exam">
<td>Wed 12/06</td>
<td>Final review session
</td> <td> </td>
<td>Bring your questions!<br/><a href="a4.html">Assignment 4</a> due</td>
</tr>
<tr class="exam">
<td>Sun 12/10 9:00AM-12:00PM</td>
<td>Final exam
</td> <td> </td>
<td>Bldg 9: Lecture Hall 1</td>
</tr>
</table>
</div>
<hr />
<p class="lastupdated">Last updated: 2017-11-12 12:47:27</p>
</body>
</html>