操作系统第零篇 前言.pptVIP

Operating Systems Hu Xiaopeng xphu@swjtu.edu.cn School of Information Science and Technology SWJTU, Chengdu, Sichuan * Reference Books William Stalling, Operating Systems-Internals and Design Principles(5th Edition), Prentice Hall. Press,2004 Andrew S. Tanenbaum, Operating Systems-Design and implementation(3rd Edition), Prentice Hall. Press,2006 * Reference Books Maurice J.Bach, The Design of the Unix Operating System, Prentice Hall CMP, 2000 于渊著. Oranges : 一个操作系统的实现. 电子工业出版社. 2009 * Prerequisite Computer Principles Data Structures Programming Languages(C, Assembly language) * Why do many programs can be run in a computer with uniprocessor simultaneously? If we ran a program with bugs, other programs will be destroyed? How can we ran several instances of a program？ Small main memory, big programs? How does a program save the running results ？ Why does a program developed on one computer can be run on another computer? How does a computer manage a lot of devices ？ Try to Answer following Questions * Process (进程) - Interleaving Schedule CPU Memory Allocation Storage Management Input Output Process * Trace of Processes (1) * Trace of Processes (2) * Trace of Processes (3) * Shared Memory Access (1) out - next file will be printed in - next free slot c - printer daemon(打印机守护进程) 4 5 6 7 abc prog.c prog.n A B Spooler Directory out=4 in=7 ... ... C * Process A read in=7, save in next_free_slot, clock interrupt occurs, process A is been switched Process B is scheduled to run, B read in=7, save the file to slot 7, update in=8, and continue to run Process A is restored to run, it checks next_free_slot=7, and save the file to slot 7, next_free_slot +1=in, then in=8。 The file which process B saved in slot 7 is lost，and printer daemon would not find this error Shared Memory Access (2) * Process description and control Multithreading Concurrency - synchronization and mutual exclusion Concurrency - deadlock Memory management Processor scheduling I/O management File systems