| Lecture |
Notes |
| 33: Wed Oct 28 |
Exam Revision Lecture |
| 32: Tue Oct 27 |
Transactions (cont) |
| 31: Fri Oct 23 |
Transactions (1-up)
|
| 30: Wed Oct 21 |
Consensus Algorithms (1-up)
|
| 29: Tue Oct 20 |
Global Properties (1-up)
|
| Fri Oct 16 |
Concurrent and Distributed
Computing at Google By Daniel Nadasi
Have you ever wondered how Google's massive computing infrastructure
works? How Google manages to keep petabytes of data and thousands of
machines stable, consistent, responsive, scalable and fault-tolerant?
In this talk, you will be presented with a bottom-up tour of
Google. Starting from the building blocks of concurrent and
distributed computing, you will see how Google's systems are
constructed, through the internal systems that are used, to some of
the newest products, such as Google App Engine.
About the speaker:
Daniel Nadasi joined Google as a Software Engineer in November
2007. He currently works on advertising for Google Maps. Aside from
this, he has also worked on Google Tasks and open source
initiatives. Daniel graduated from ANU in 2007 with a Bachelor of
Science with a double major in Mathematics."
Related papers
Chubby
GFS
BigTable
|
| 28: Wed Oct 14 |
Distributed Mutual Exclusion (cont) and
discussion of assignment 2
|
| 27: Tue Oct 13 |
Distributed Mutual Exclusion (1-up)
Lamports logical clocks and use
in distributed mutual exclusion taken from Distributed Computing, by
Kshemkalyani and Singhal |
| 26: Fri Sep 25 |
Safety and Liveness (cont) |
| 25: Wed Sep 23 |
Bankers Algorithm (1-up) |
| 24: Tue Sep 22 |
Safety and Liveness (1-up) |
23: Fri Sep 18 |
Architectures UNIX 2 (cont)
|
22: Wed Sep 16 |
Architectures UNIX 2
(1 up) |
| 21: Tue Sep 15 |
Architectures UNIX 1 (cont)
|
Fri Sept 11 |
Your Mid Semester Exam!
|
20: Wed Sept 9 |
Architectures UNIX 1
(1 up)
|
19: Tue Sept 8 |
Scheduling (continued)
|
18: Fri Sept 4 |
Scheduling (continued)
|
17: Wed Sept 2 |
Scheduling
(1-up)
|
16: Tue Sept 1 |
Exam Question Discussion (no
notes)
|
15: Fri Aug 28 |
Non-Determinism (1up)
|
14: Wed Aug 26 |
Continued Synchronization#3:
Message Based
Chapter from Concurrent Systems
reference text by Jean Bacon. This is rather unix/pipes oriented,
but provides a different perspective. You could also look at chapter
15 for background, but will need to get that from the actual text book
in library.
|
13: Tue Aug 25 |
Synchronization#3: Message Based (1up)
|
12: Fri Aug 21 |
Continued Synchronization#2: Monitors and Protected Objects
|
11: Wed Aug 19 |
Continued Synchronization#2: Monitors and Protected Objects
|
10: Tue Aug 18 |
Synchronization#2: Monitors and Protected Objects (1up)
|
9: Fri Aug 14 |
Synchronization#1: Semaphores and Condition Critical Regions (1up)
|
Wed Aug 12 |
Away - no lecture (but
labs are running) |
Tue Aug 11 |
Away - no lecture (but
labs are running) |
8: Fri Aug 7 |
Mutual Exclusion (continued from
Wed)
|
7: Wed Aug 5 |
Mutual Exclusion (1up)
Implementing mutual exclusion using only atomic memory read and write
operations.
|
6: Tue Aug 4 |
Ben Ari Chap 2 and 3 (1up)
Some discussion based on chapters 2 and 3 from Ben-Ari (the above is
just the figures).
Copy of Ben-Ari Chapter
2
We may also start mutual exclusion, depending on time.
|
5: Fri Jul 31 |
Ada
Refresher - continuing from Wed at tasks.
|
4: Wed Jul 28 |
Ada
Refresher(!) lecture notes from Uwe Zimmer(1up)
Swapped order to talk about Ada before Ben-Ari
|
3: Tue Jul 27 |
Basic Concepts: Processes and Threads (1up)
|
2: Wed Jul 22 |
Concurrency: Basic Concepts (1up)
|
1: Tue Jul 21 |
Course Overview
(1up)
Everything My CS Teacher Taught Me Was Wrong!: Advertisement in British Airways in flight magazine.
Reinventing Computing
Sprinting to Petaflops!
|
