Ändringar mellan två versioner
Här visas ändringar i "Lectures" mellan 2016-10-20 18:48 av Johan Montelius och 2016-10-24 23:22 av Johan Montelius.
Visa < föregående | nästa > ändring.
Lectures
The lectures and experiments are loosely coordinated. You're expected to do the experiments as we progress through the lectures. Give them a try in advance of the corresponding lectures and then go back and do them again when we have covered the topic in the lectures.
1: Introduction
* Slides
* Handout (handout 2x2)
* 2 Introduction to Operating Systems
* 3 A Dialoge on Virtualization
2: Linux 101
* Slides
* Handouts (handouts 2x2)
* The UNIX family of operating systems
* The shell and basic command line interface.
* The file system, navigation, files, directories, user rights, basic operations.
* Most common commands.
* Environment variables and expansion.
* Using pipes to combine commands
* Kallocain by Karin Boye (download as UTF-8 text file)
* A bit on writing a thesis.
3: Processes
* Slides
* Handout (handout 2x2)
* 4 The Abstraction: The Process
* 5 Interlude: Process API
* 6 Mechanism: Limited Direct Execution
4: Scheduling
* Slides
* Handout (handout 2x2)
* 7 Scheduling: Introduction
* 8 Scheduling: The Multi Level Feedback Queue
* 9 Scheduling: Proportional Share
5: Memory managment
* Slides
* Handout (handout 2x2)
* 17: Free-Space Management
6: Memory Virtualization * Slides
* Handout (handout 2x2)
* 12: A Dialogue on Memory Virtualization
* 13: The abstraction: Address Spaces
* 14: Interlude: Memory API
* 15: Address Translation
* 16: Segmentation
67: Paging
* Slides
* Handout (handout 2x2)
* 18: Paging: Introduction
* 19: Paging: Faster Translations (TLBs)
* 20: Paging: Smaller Tables 7: Memory managment 8: Swapping
* Slides
* Handout (handout 2x2)
* 17: Free-Space Management
* 18: Paging: Introduction
* Slides
* Handout (handout 2x2)
* 21: Beyond Physical Memory: Mechanisms
* 22: Beyond Physical Memory: Policies
9: Concurrency
* Slides
* Handout (handout 2x2)
* 26 Concurrency an Introduction
* 27 Interlude: Thread API
* 28 Locks
10: Locks and Semaphores
* Slides
* Handout (handout 2x2)
* 29 Lock-based Concurrent Data Structures
* 30 Condition Variables
* 31 Semaphores
* 32 Common Concurrency Problems
11: Storage
* Slides
* Handout (handout 2x2)
* 36 I/O Devices
* 37 Hard Disk Drives
* 38 Redundant Arrays of Inexpensive Disks (RAIDs)
* Appendix I, Flash-based SSDs
12: File Systems
* 39 Interlude: Files and Directories
* 40 File System Implementation
* 41 Locality and the Fast File System
13: Journaling
* 42 Crash Consistency: FSCK and Journaling
* 43 Log-structured File Systems
14: Virtual Machines
* Appendix B Virtual Machine Monitors