TDDB68: Concurrent Programming and Operating Systems
Lectures and Lessons VT 2016
Slides and Reading directions
This page contains the lecture series and links to the slides to be used in the lectures and lab lessons. The references to the course book relate to the 7th, 8th and 9th edition of the book (2005, 2010 resp. 2013). You may even use the 5th or 6th edition, but note that some chapters have been added, removed or rewritten in later editions.
Note 1: We offer a special lecture (F2, tuesday 19/1/2016 13:15-15:00) introducing C for systems programming, with focus on pointer programming, address calculations, compiling, and linking. It will be complemented by the C lab session (Lab 0) during the first week (see below).
Note 2: Due to a business trip, the first two lectures will be given by my colleague Mikael Asplund, IDA.
Note 3: The slide material will be made available before the
corresponding lecture and may be subject to updates without notice.
We will not always go through all slide material in the lectures. Some slide material is intended for self-studying only.
The lab series startup session on tuesday 19/1/2015 15:15-17:00
(for groups A, B, C; group D starts on wednesday 20/1
and group E starts on thursday 21/1,
see the schedule) is mandatory.
Demonstration of Lab-0 is mandatory, to make sure that you have the C programming skills required for doing the Pintos labs.
If not already signed up on a specific lab group in webreg, then join any of the groups in the rooms announced in the schedule, no matter which of the assistants is supervising it. To pass Lab-0 you need to be registered in webreg and show your solution to your lab group's assistant.
The remaining lab sessions are not shown in the list below, check the course time table for the lab dates.
(The slides below might be updated for 2016 shortly before each lecture. Lecture/lesson times given below are preliminary and might be subject to change; check the course time table.)
|Time||Lecture topics||By||Reading (SGG 7e, 8e, 9e)|
Interrupts and system calls.
Ch. 1.1-1.7, 13.2, 2.3-2.5;
|2||19/1 13:15-15:00||A short introduction to system programming in C (optional). Pointer programming, Storage classes, Compiling, Linking, Debugging.||M. Asplund||see slide material|
|19/1 15:15-17:00 (A,C,D)|
20/1 10:00-12:00 (D)
21/1 17:00-19:00 (E)
Lab series kick-off session.|
Pointer programming in C. Debugging. Lab system installation and test.
Demonstration of Lab-0.
Processes and threads|
How to switch between processes
|C. Kessler||Chapters 3 (not 3.6) and 4|
|4||25/1 08:15-10:00||Synchronisation I||C. Kessler||Chapter 6|
|26/1 13:15-15:00||Lesson 1 (important information for Lab 1)||E. Hansson|
|5||27/1 10:15-12:00||Synchronisation II||C. Kessler||Chapter 6 (9e: not 6.10)|
Muddy-card mid-term evaluation
|C. Kessler||Chapter 5 (9e: not 5.6)|
|7||3/2 10:15-12:00||Memory management||C. Kessler||Chapter 8;|
Whiteboard drawing: linking and loading)
|5/2 08:15-10:00||Lesson 2 (important information for Lab 2)||E. Hansson|
|8||10/2 10:15-12:00||Virtual memory||C. Kessler||Chapter 9|
|15/2 08:15-10:00||Lesson 3 (important information for Labs 3 and 4)||E. Hansson|
|9||19/2 08:15-10:00||File system interface||C. Kessler||Chapter 10|
|File system implementation||Chapter 11|
|10||23/2 13:15-15:00||Mass storage, disk scheduling, RAID||Chapter 12|
Operating System Structures.|
7e, 8e: Section 2.8; 9e: Section 1.11.6
Deadlock analysis, detection and avoidance
||C. Kessler||Chapter 7|
Protection and Security|
Outlook: From concurrency to parallelism
|C. Kessler||Chapter 14 (excl. 14.8, 14.9), Chapter 15 (excl. 15.4, 15.6, 15.7, 15.8)|
- Lesson 1: Slides 1x1. Updated 2016.
- Lesson 2: Slides 1x1. Updated 2016
- Lesson 3: Slides 1x1, Slides 2x2. Updated 2015.
Page responsible: Christoph W Kessler
Last updated: 2016-02-07