Courses

Introduction. Historical data. Single-process and multi-process computing systems, single or multiple users. Interactive systems. Elements of processor architecture. Interrupt handling. Functions of an Operating System (OS). The concept of a process. Handling processes. Process scheduling - algorithms. Asynchronous concurrent processes. Dekker's algorithm. Semaphores, monitors. Mutual exclusion problems. Deadlocks, deadlock conditions, Banker's algorithm. Memory management. Secondary memory. Disk scheduling. Main memory. Techniques for placing processes in memory, contiguous/non-contiguous placement. Virtual memory. Non-contiguous placement in memory, segmentation-paging. Virtual memory management. Associative memory. Page replacement techniques. The work package. Case study: Linux system and workshops on the concepts developed in the theory.