Operating Systems - David Vernon

More documents

Recommendations

Info

Processes InterProcess Communication IPC – Mutual Exclusion with Busy Waiting » Technique 3: Strict Alternation » Continuous testing of a variable is called busy waiting should be avoided as it wastes CPU time » Another problem: strict alternation (my turn, your turn, my turn, …) means that if Process A can’t re-enter its critical region until Process B has had a turn consider what would happen if B didn’t need to take a turn for a long time Copyright © 2007 David Vernon (www.vernon.eu) » This is not a real contender as a solution
Processes InterProcess Communication IPC – Mutual Exclusion with Busy Waiting » Technique 4: Peterson’s Solution (1981) » processes call routine enter_region before entering critical region pass their process number as an argument if resource is available, enter_region returns having set a flag to say that process n is now active in its critical region otherwise it starts busy waiting until the other process is no longer active » processes call routine leave_region after exiting critical Copyright © 2007 region David Vernon (www.vernon.eu)
Page 1 and 2:
Operating Systems David Vernon Copy
Page 3 and 4:
Course Content Historical overview
Page 5 and 6:
Course Content Device management -
Page 7 and 8:
Course Content Networking issues -
Page 9 and 10:
Course Textbook “Modern Operating
Page 11 and 12:
Assessment of Performance First exa
Page 13 and 14:
The Need for Operating Systems Why
Page 15 and 16:
The Need for Operating Systems Comp
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
The Need for Operating Systems Exam
Page 25 and 26:
Load B DR ← M(AR) A B C 11111111
Page 27 and 28:
Load B Increment PC A B C 11111111
Page 29 and 30:
Load B AR ← DR(address) A B C 111
Page 31 and 32:
Load B AC ← DR A B 11111111 01001
Page 33 and 34:
The Need for Operating Systems Mach
Page 35 and 36:
Page 37 and 38:
What is an Operating System There a
Page 39 and 40:
What is an Operating System OS as a
Page 41 and 42:
History of Operating Systems First
Page 43 and 44:
History of Operating Systems Second
Page 45 and 46:
History of Operating Systems Third
Page 47 and 48:
History of Operating Systems Third
Page 49 and 50:
History of Operating Systems Fourth
Page 51 and 52:
Operating System Concepts System ca
Page 53 and 54:
Operating System Concepts Processes
Page 55 and 56:
Page 57 and 58:
Page 59 and 60: Operating System Concepts Files - O
Page 61 and 62: Operating System Concepts Copyright
Page 63 and 64: Operating System Concepts Files -Pr
Page 65 and 66: Operating System Concepts Files - O
Page 67 and 68: Operating System Concepts System Ca
Page 69 and 70: Operating System Concepts The Shell
Page 71 and 72: Operating System Structure Monolith
Page 73 and 74: Operating System Structure Monolith
Page 75 and 76: Operating System Structure Virtual
Page 77 and 78: Operating System Structure Virtual
Page 79 and 80: Operating System Structure Client-S
Page 81 and 82: Operating System Structure Client-S
Page 83 and 84: Processes All modern computer syste
Page 85 and 86: Processes Single program counter Fo
Page 87 and 88: Processes Because the OS schedules
Page 89 and 90: Processes Process Hierarchies - pro
Page 91 and 92: Processes Running 1 Blocked 4 3 2 R
Page 93 and 94: Processes Device I/O … the differ
Page 95 and 96: Processes Interrupts and device I/
Page 97 and 98: Processes InterProcess Communicatio
Page 99 and 100: Processes Process A Spooler directo
Page 101 and 102: Processes Process A Process B Print
Page 109: Processes InterProcess Communicatio
Page 113 and 114: Processes /* process 0 */ main () {
Page 117 and 118: while (turn == process && intereste
Page 119 and 120: while (turn == process && intereste
Page 131 and 132: Processes void consumer(void) { int
Page 141 and 142: Processes #include “prototypes.h
Page 157 and 158: Processes void consumer(void) { int
Page 161 and 162:
Processes void writer(void) { while
Page 163 and 164:
Processes Process Scheduling - Crit
Page 165 and 166:
Processes Process Scheduling - Roun
Page 167 and 168:
Processes Process Scheduling - Prio
Page 169 and 170:
Processes Process Scheduling - ‘S
Page 171 and 172:
Processes Process Scheduling - Two
Page 173 and 174:
Memory Management The part of the o
Page 175 and 176:
Memory Management Memory management
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Memory Management Swapping - memory
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Memory Management Virtual Memory -
Page 191 and 192:
Memory Management Disk Page 1 Proce
Page 193 and 194:
Memory Management Disk Page 1 Proce
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Memory Management Virtual Address S
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Memory Management Second-level page
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Memory Management Segmentation - Th
Page 225 and 226:
Memory Management Segmentation - To
Page 227 and 228:
Memory Management Segmentation » O
Page 229 and 230:
Memory Management Segmentation - It
show all

Operating Systems - David Vernon

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?