Download Operating System Tutorial (PDF Version) - Tutorials Point

More documents

Recommendations

Info

Shortest Job First (SJF) Best approach to minimize waiting time. Impossible to implement Processer should know in advance how much time process will take. Wait time of each process is following Process Wait Time : Service Time - Arrival Time P0 3 - 0 = 3 P1 0 - 0 = 0 P2 16 - 2 = 14 P3 8 - 3 = 5 Average Wait Time: (3+0+14+5) / 4 = 5.50 TUTORIALS POINT Simply Easy Learning Page 33
Priority Based Scheduling Each process is assigned a priority. Process with highest priority is to be executed first and so on. Processes with same priority are executed on first come first serve basis. Priority can be decided based on memory requirements, time requirements or any other resource requirement. Wait time of each process is following Process Wait Time : Service Time - Arrival Time P0 0 - 0 = 0 P1 3 - 1 = 2 P2 8 - 2 = 6 P3 16 - 3 = 13 Average Wait Time: (0+2+6+13) / 4 = 5.25 TUTORIALS POINT Simply Easy Learning Page 34
Page 1 and 2: Operating System Tutorial
Page 3 and 4: ABOUT THE TUTORIAL Operating System
Page 5 and 6: Multiprogramming ..................
Page 7 and 8: Clocks ............................
Page 9 and 10: Following are some of important fun
Page 11 and 12: CHAPTER 2 Types of Operating System
Page 13 and 14: Distributed operating System Distri
Page 15 and 16: Real Time operating System Real tim
Page 17 and 18: Program execution Operating system
Page 19 and 20: Error handling Error can occur anyt
Page 21 and 22: Increased performance as a new job
Page 23 and 24: Multiprogramming When two or more p
Page 25 and 26: Spooling Spooling is an acronym for
Page 27 and 28: Program A program by itself is not
Page 29 and 30: Process Control Block, PCB Each pro
Page 31 and 32: CHAPTER 6 Operating System Process
Page 33 and 34: Two State Process Model Two state p
Page 35 and 36: Running process may become suspende
Page 37 and 38: Context Switch A context switch is
Page 39: First Come First Serve (FCFS) Jo
Page 43 and 44: Multi Queue Scheduling Multiple
Page 45 and 46: Difference between Process and Thre
Page 47 and 48: Types of Thread Threads are impleme
Page 49 and 50: Multithreading Models Some operatin
Page 51 and 52: Difference between User Level & Ker
Page 53 and 54: Instructions and data to memory add
Page 55 and 56: Logical versus Physical Address Spa
Page 57 and 58: Memory Allocation Main memory usual
Page 59 and 60: Paging External fragmentation is av
Page 61 and 62: Address generated by CPU is divided
Page 63 and 64: Virtual memory is commonly implemen
Page 65 and 66: Step Description Step 1 Check an in
Page 67 and 68: Page Replacement Algorithm Page rep
Page 69 and 70: Least Recently Used (LRU) algorithm
Page 71 and 72: I/O port An I/O port typically cons
Page 73 and 74: I/O devices I/O Devices can be cate
Page 75 and 76: 4 Disk controller sends each byte t
Page 77 and 78: CHAPTER 12 I/O Software This sectio
Page 79 and 80: Clocks Clocks are also called timer
Page 81 and 82: Device driver Device driver is a pr
Page 83 and 84: File Type File type refers to the a
Page 85 and 86: Space Allocation Files are allocate
Page 87 and 88: Authentication Authentication refer
Page 89 and 90: Program Threats Operating system's
Page 91 and 92:
Computer Security Classifications A
Page 93 and 94:
Components of Linux System Linux Op
Page 95 and 96:
Basic Features Following are some o
Page 97:
APPENDIX A About tutorialspoint.com
show all

Download Operating System Tutorial (PDF Version) - Tutorials Point

Create successful ePaper yourself

Delete template?

Save as template?