- Page 5 and 6: ContentsvWhich page should be swapp
- Page 7 and 8: Contentsvii1.3 Interacting with pro
- Page 9: ContentsixBalance is a registered t
- Page 13 and 14: chapter 1INTRODUCTIONThe developmen
- Page 15 and 16: The Resource Principle 32 THE RESOU
- Page 17 and 18: Historical development 5executing j
- Page 19 and 20: Historical development 7executing j
- Page 21 and 22: Historical development 9executing j
- Page 23 and 24: Historical development 11control an
- Page 25 and 26: The Beautification Principle 13Beau
- Page 27 and 28: The kernel and processes 155 type6
- Page 29 and 30: The kernel and processes 17For exam
- Page 31 and 32: The kernel and processes 19Service
- Page 33 and 34: Virtual machines 21A second use of
- Page 35 and 36: Virtual machines 23A good test of a
- Page 37 and 38: Exercises 25and a case study for th
- Page 39 and 40: chapter 2TIME MANAGEMENTThe first r
- Page 41 and 42: Goals, measures, and assumptions 29
- Page 43 and 44: Policies 31α =3Probability ofk arr
- Page 45 and 46: 100FCFSPenalty ratio 10HPRNFBRRRRPS
- Page 47 and 48: Policies 353C10181220BE03915AD0 5 1
- Page 49 and 50: Policies 372.2 Round robin (RR)Our
- Page 51 and 52: Policies 39q = 4Process Arrival Ser
- Page 53 and 54: Policies 41simulation results, show
- Page 55 and 56: Policies 43Process Arrival Service
- Page 57 and 58: Policies 45parameters; that is, the
- Page 59 and 60: Perspective 47latter figure rises l
- Page 61 and 62:
Perspective 49Figure 2.13.3.2 Evalu
- Page 63 and 64:
Perspective 51which tracked thousan
- Page 65 and 66:
Further reading 53The quantum size
- Page 67 and 68:
Exercises 557. Here are some proced
- Page 69 and 70:
chapter 3SPACE MANAGEMENTThe manage
- Page 71 and 72:
Preliminaries 59hardware cacheAcces
- Page 73 and 74:
Preliminaries 61Processes deal with
- Page 75 and 76:
Preliminaries 631.6 Initial loading
- Page 77 and 78:
Fixed partitions 65does to Load.Rel
- Page 79 and 80:
Fixed partitions 672.1 SecurityThe
- Page 81 and 82:
Fixed partitions 692.2 OverlaysIf a
- Page 83 and 84:
Single segment 710 13K0process Apro
- Page 85 and 86:
Single segment 73Start 13426Size 72
- Page 87 and 88:
Single segment 75desired size10firs
- Page 89 and 90:
Segmentation 771 const2 BitsPerPhys
- Page 91 and 92:
Segmentation 79in length. In our ex
- Page 93 and 94:
Segmentation 815.2 Storing the nece
- Page 95 and 96:
Segmentation 83The hardware either
- Page 97 and 98:
Paging 85A process that wants to ch
- Page 99 and 100:
Paging 87small pagesvirtual spacein
- Page 101 and 102:
Paging 89virtual addresspageoffsetf
- Page 103 and 104:
Paging 91internal waste.) The load
- Page 105 and 106:
Paging 9328 procedure Translate (VA
- Page 107 and 108:
Paging 95descriptor base registerPa
- Page 109 and 110:
Paging 971 type2 PageFrameNumber =
- Page 111 and 112:
Paging 99example simple, these virt
- Page 113 and 114:
Page-replacement policies 1017 PAGE
- Page 115 and 116:
Page-replacement policies 103100009
- Page 117 and 118:
Page-replacement policies 105Min, o
- Page 119 and 120:
Page-replacement policies 107There
- Page 121 and 122:
Page-replacement policies 109search
- Page 123 and 124:
Page-replacement policies 1111 type
- Page 125 and 126:
Page-replacement policies 1137.11 W
- Page 127 and 128:
Page-replacement policies 115method
- Page 129 and 130:
Perspective 117processesservice cal
- Page 131 and 132:
Exercises 1194. A process generally
- Page 133 and 134:
chapter 4RESOURCE DEADLOCKWe have d
- Page 135 and 136:
Nuts and bolts 1231 type2 ResourceC
- Page 137 and 138:
Deadlock and starvation 125first pl
- Page 139 and 140:
Deadlock and starvation 12767854tap
- Page 141 and 142:
Dining philosophers 129Figure 4.6 s
- Page 143 and 144:
One-shot allocation 131clever, star
- Page 145 and 146:
Advance-claim algorithm 133is not s
- Page 147 and 148:
Advance-claim algorithm 135(3) The
- Page 149 and 150:
Advance-claim algorithm 137Every ti
- Page 151 and 152:
Deadlock detection 139Process Holdi
- Page 153 and 154:
Starvation 141needs to check for de
- Page 155 and 156:
Perspective 143used to make sure th
- Page 157 and 158:
Exercises 1453. What is a one-proce
- Page 159 and 160:
chapter 5TRANSPUTThus far we have t
- Page 161 and 162:
Device hardware 149Disks are the mo
- Page 163 and 164:
Device hardware 151Magnetic tape is
- Page 165 and 166:
Device hardware 153tracksdirections
- Page 167 and 168:
Device hardware 1551.5 Summary of d
- Page 169 and 170:
The device interface 157Sometimes t
- Page 171 and 172:
The device interface 159processeske
- Page 173 and 174:
Device drivers 161address of the da
- Page 175 and 176:
Device drivers 163counter.) These c
- Page 177 and 178:
Device drivers 165impose an order o
- Page 179 and 180:
Device drivers 16716.008.00FCFS4.00
- Page 181 and 182:
Data modification 169encryption met
- Page 183 and 184:
Data modification 171We have seen t
- Page 185 and 186:
The process interface 173device for
- Page 187 and 188:
The process interface 175As we will
- Page 189 and 190:
The process interface 177the channe
- Page 191 and 192:
The process interface 179When the p
- Page 193 and 194:
Perspective 181to that terminal. If
- Page 195 and 196:
Exercises 183used to transmit keys
- Page 197 and 198:
chapter 6FILE STRUCTURESIn Chapter
- Page 199 and 200:
Naming structure of files 187around
- Page 201 and 202:
Naming structure of files 189SetWor
- Page 203 and 204:
Naming structure of files 191the al
- Page 205 and 206:
Naming structure of files 193give h
- Page 207 and 208:
Access control 195directory is impl
- Page 209 and 210:
Access control 197Execute privilege
- Page 211 and 212:
Access control 199This arrangement
- Page 213 and 214:
Access control 201selfgroupworldHel
- Page 215 and 216:
Access control 203Execute privilege
- Page 217 and 218:
Access methods 205directory is /a/b
- Page 219 and 220:
Access methods 207Instead of submit
- Page 221 and 222:
File recovery 209tape 6. Whenever w
- Page 223 and 224:
Transactions 2115 TRANSACTIONSWe ha
- Page 225 and 226:
Transactions 213a file, and to spec
- Page 227 and 228:
Physical representation 2156.1 Allo
- Page 229 and 230:
Physical representation 2176.2 File
- Page 231 and 232:
Physical representation 219date (fo
- Page 233 and 234:
Physical representation 221The stru
- Page 235 and 236:
Physical representation 2236.4 Mult
- Page 237 and 238:
Physical representation 225a dismou
- Page 239 and 240:
Physical representation 2276.6 Impl
- Page 241 and 242:
Perspective 229Each layer smooths o
- Page 243 and 244:
Exercises 231(11) The process submi
- Page 245 and 246:
Exercises 23316. If we use the rule
- Page 247 and 248:
The command interpreter 235operatin
- Page 249 and 250:
The command interpreter 237When it
- Page 251 and 252:
The command interpreter 239Sometime
- Page 253 and 254:
The command interpreter 241command
- Page 255 and 256:
The command interpreter 243In the f
- Page 257 and 258:
The command interpreter 245command
- Page 259 and 260:
The command interpreter 247A new ge
- Page 261 and 262:
Utility programs 249be misunderstoo
- Page 263 and 264:
Utility programs 251data types) the
- Page 265 and 266:
Perspective 2533.4 CommunicationThe
- Page 267 and 268:
Exercises 2556 EXERCISES1. Describe
- Page 269 and 270:
The problems 257operating systems.
- Page 271 and 272:
The problems 259process Aprocess B1
- Page 273 and 274:
Mechanisms 2612.1 Disable interrupt
- Page 275 and 276:
Mechanisms 2631 activity A:2 perfor
- Page 277 and 278:
Mechanisms 265processors, we might
- Page 279 and 280:
Mechanisms 2672.5 LocksThe switch s
- Page 281 and 282:
Mechanisms 2691 procedure Down(var
- Page 283 and 284:
Mechanisms 2711 activity E:2 Down(B
- Page 285 and 286:
Mechanisms 273in the critical regio
- Page 287 and 288:
Mechanisms 275enter through the ent
- Page 289 and 290:
Mechanisms 277urgent queue34entryqu
- Page 291 and 292:
Mechanisms 279(4) Let the programme
- Page 293 and 294:
Mechanisms 28135 procedure Read;36
- Page 295 and 296:
Mechanisms 283they deal with differ
- Page 297 and 298:
Mechanisms 285A completely differen
- Page 299 and 300:
Mechanisms 2872.13 Invariant expres
- Page 301 and 302:
Perspective 2893 PERSPECTIVEIt is n
- Page 303 and 304:
Exercises 291(1977). Event counts a
- Page 305 and 306:
Exercises 29321. Find a case where
- Page 307 and 308:
Process creation and naming 2951 PR
- Page 309 and 310:
Inter-process communication 297When
- Page 311 and 312:
Inter-process communication 299for
- Page 313 and 314:
Inter-process communication 301Ordi
- Page 315 and 316:
Inter-process communication 303its
- Page 317 and 318:
Inter-process communication 305Befo
- Page 319 and 320:
Inter-process communication 307Port
- Page 321 and 322:
Distributed operating systems 309le
- Page 323 and 324:
Distributed operating systems 3113.
- Page 325 and 326:
The communication-kernel approach 3
- Page 327 and 328:
The communication-kernel approach 3
- Page 329 and 330:
Perspective 317may be excessive.Eit
- Page 331 and 332:
Exercises 3191974). StarOs (Jones,
- Page 333 and 334:
14. We suggested that unread data m
- Page 335 and 336:
References 323T. BLOOM, ‘‘Evalu
- Page 337 and 338:
References 325D. E. KNUTH, The Art
- Page 339 and 340:
M. STONEBRAKER, ‘‘Operating Sys
- Page 341 and 342:
Glossary 329Access right. Permissio
- Page 343 and 344:
Glossary 331Bound port. A communica
- Page 345 and 346:
Glossary 333Compute-bound. A proces
- Page 347 and 348:
Glossary 335Device interface. The i
- Page 349 and 350:
Glossary 337Finalization. Action ta
- Page 351 and 352:
Glossary 339I/O. Either input or ou
- Page 353 and 354:
Glossary 341Mode. See Access mode.M
- Page 355 and 356:
Glossary 343Partition. A fixed regi
- Page 357 and 358:
Glossary 345Readers-writers problem
- Page 359 and 360:
Glossary 347Serially reusable. A re
- Page 361 and 362:
Glossary 349Task. A thread of contr
- Page 363:
Glossary 351Waste. Unused space. Ex