1. CS1253- OPERATING SYSTEMS

4. SYLLABUS UNIT I PROCESSES AND THREADS 9 Introduction to operating systems – Review of computer organization – Operating system structures – System calls System programs – System structure – Virtual machines – Processes – Process concept – Process scheduling – Operations on processes –Cooperating processes – Interprocess communication – Communication in client – Server tems – Case study – IPC in linux – Threads – Multi-threading models – Threading issues – Case study – Pthreads library.

5. Cont… UNIT II PROCESS SCHEDULING AND SYNCHRONIZATION 10 CPU scheduling – Scheduling criteria – Scheduling algorithms Multiple – Processor scheduling – Real time scheduling – Algorithm evaluation – Case study – Process scheduling in Linux – Process synchronization – The critical-section problem – Synchronization hardware – Semaphores – Classic problems of synchronization – Critical regions – Monitors – Deadlock – System model – Deadlock characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.

6. Cont… UNIT III STORAGE MANAGEMENT 9 Memory management – Background – Swapping – Contiguous memory allocation –Paging – Segmentation – Segmentation with paging – Virtual memory – Background –Demand paging – Process creation – Page replacement – Allocation of frames Thrashing – Case study – Memory management in linux.

7. Cont… UNIT IV FILE SYSTEMS 9 File system interface – File concept – Access methods Directory structure – File-system mounting – Protection – File system implementation – Directory implementation – Allocation methods – Free space management – Efficiency and performance – Recovery – Log-structured file systems – Case studies – File system in linux – File system in Windows XP.

8. Cont… UNIT V I/O SYSTEMS 8 I/O systems – I/O hardware – Application I/O interface – Kernel I/O subsystem – Streams – Performance – Mass storage structure – Disk scheduling – Disk management – Swap-space management – RAID – Disk attachment – Stable storage – Tertiary storage – Case study – I/O in linux.

9. LECTURE DURATION 1. PROCESSES AND THREADS 9 hours 2. PROCESS SCHEDULING AND SYNCHRONIZATION 10 hours 3. STORAGE MANAGEMENT 9 hours 4. FILE SYSTEMS 9 hours 5.I/O SYSTEMS 8 hours ________ 45 hours

10. OBJECTIVES To have an overview of different types of operating systems To know the components of an operating system. To have a thorough knowledge of process management To have a thorough knowledge of storage management To know the concepts of I/O and file systems.

11. Highlights of units PROCESSES AND THREADS PROCESS SCHEDULING AND SYNCHRONIZATION STORAGE MANAGEMENT FILE SYSTEMS I/O SYSTEMS

12. EXAMPLES OF OS 1. Linux 2. Mac OS X 3. Windows Server 2008 4. Windows Server 2000 5. Windows Vista 6. Windows Server 2003 7. Windows XP 8. Solaris

13. UNIT- I PROCESSES AND THREADS Basic concepts are, Introduction to operating systems System call Interprocess Communication

14. PROCESS

15. THREAD

16. UNIT-II PROCESS SCHEDULING AND SYNCHRONIZATION This unit covers the following concepts.. CPU scheduling Monitors Deadlock system model

17. CPU SCHEDULING First-Come, First-Served (FCFS) Scheduling Shortest-Job-First (SJF) Scheduling Priority (PR) Scheduling Round Robin (RR) Scheduling

19. DEAD LOCK

20. UNIT III STORAGE MANAGEMENT Aim of this unit is to describe the following concepts, Memory management Paging Segmentation

21. Dynamic relocation using a relocation register

22. SWAPPING

23. PAGING

24. UNIT-IV FILE SYSTEMS This unit contains the concepts such as File system interface Allocation methods Log structured file systems

25. Sequential-access File

26. UNIT V I/O SYSTEMS Basic concepts in this unit are, I/O Systems Disk scheduling RAID

27. Disk Scheduling 1)FCFS

28. 2) SSTF

29. RAID

30. TEXT BOOK “Operating System Concepts”, Silberschatz, Galvin and Gagne, 6th Edition, Wiley India Pvt. Ltd., 2003.

31. REFERENCES “Modern Operating Systems”, Tanenbaum, A.S., 2nd Edition, Pearson Education, 2004.

32. Cont.,  “Operating Systems”, Gary Nutt, 3rd Edition, Pearson Education, 2004. “Operating Systems”, William Stallings, 4th Edition, Prentice Hall of India, 2003.

33. WEBSITES http://www.en.wikipedia.org/wiki/Scheduling_ (computing) http://www.en.wikipedia.org/wiki/Scheduling_ (computing) http://www1bpt.bridgeport.edu/sed/projec ts/cs503/Spring_2001/kode/os/scheduling.h tm http://www1bpt.bridgeport.edu/sed/projec ts/cs503/Spring_2001/kode/os/scheduling.h tm http://www.cs.jhu.edu/~yairamir/cs418/os4 /tsld011.htm http://www.cs.jhu.edu/~yairamir/cs418/os4 /tsld011.htm http://eprints.iisc.ernet.in/3840/1/deadlock.pdf http://eprints.iisc.ernet.in/3840/1/deadlock.pdf http://www.wiziq.com/tutorials/Deadlock- prevention http://www.wiziq.com/tutorials/Deadlock- prevention

34. SEMINAR TOPICS Process scheduling Inter process communication CPU scheduling Monitors Virtual memory Page replacement Free space management Disk scheduling

35. ASSIGNMENT TOPICS System calls Process scheduling Scheduling algorithms Semaphores Paging Thrashing Free space management Application I/O interface File system in Linux RAID