- Page 3 and 4: To my children, Lemar, Sivan, and A
- Page 5 and 6: Operating systems are an essential
- Page 7 and 8: management, and the effectiveness o
- Page 9 and 10: programs run on any operating syste
- Page 11 and 12: The following teaching supplencents
- Page 13 and 14: PART ONE • OVERVIEW Chapter 1 Int
- Page 15: Chapter 9 Virtual-Memory Management
- Page 19: Part One An operating system acts a
- Page 22 and 23: 4 Chapter 1 compiler assembler text
- Page 24: 6 Chapter 1 1.2 STORAGE DEFINITIONS
- Page 29 and 30: 1.3 15 Figure 1.6 Symmetric multipr
- Page 39 and 40: 1.8 1.8 25 memory during the instru
- Page 45 and 46: 1.10 31 increases computation speed
- Page 47 and 48: 1.11 33 of memory management for re
- Page 50 and 51: 36 Chapter 1 The provides an interf
- Page 52 and 53: 38 Chapter 1 1.13.1 History In the
- Page 54 and 55: 40 Chapter 1 1.14 has its open-sour
- Page 56 and 57: 42 Chapter 1 computer system. Secur
- Page 58 and 59: 44 Chapter 1 c. Clear memory. d. Is
- Page 60 and 61: 46 Chapter 1 Brookshear [2003] prov
- Page 63: 2.1 An operating system provides th
- Page 68 and 69:
54 Chapter 2 Traditionally, UNIX sy
- Page 74 and 75:
60 Chapter 2 Process control o end,
- Page 76:
62 Chapter 2 EXAMPLE OF STANDARD C
- Page 88 and 89:
74 Chapter 2 One benefit of the mic
- Page 91 and 92:
2.8 77 the original concepts are fo
- Page 93 and 94:
2.8 79 the new machine will run slo
- Page 95 and 96:
2.8 81 will see, these virtual mach
- Page 97 and 98:
2.8 THE .NET FRAMEWORK The .NET Fra
- Page 99 and 100:
2.9 Kernighan's Law "Debugging is t
- Page 101 and 102:
2.9 87 loops are allowed, and only
- Page 103 and 104:
2.11 2.11 89 How will the boot disk
- Page 105 and 106:
when in an interactive or time-shar
- Page 107 and 108:
2.19 What are the advantages and di
- Page 109:
user can choose during machine boot
- Page 112 and 113:
98 Chapter 2 http: I lwww. apple. c
- Page 118 and 119:
104 Chapter 3 • • • Figure 3.
- Page 120:
106 Chapter 3 PROCESS REPRESENTATIO
- Page 124 and 125:
110 Chapter 3 3.3 3.2.3 Context Swi
- Page 126:
112 Chapter 3 subprocess may be abl
- Page 129 and 130:
3.3 115 creation and management in
- Page 131 and 132:
3.4 117 process A process A 2 kerne
- Page 133 and 134:
item nextProduced; 3.4 while (true)
- Page 137 and 138:
3.5 3.5 123 waiting. The link's cap
- Page 139 and 140:
#include #include #include int m
- Page 141:
3.5.3 An Example: Windows XP 3.5 12
- Page 144:
130 Chapter 3 import java.net.*; im
- Page 147 and 148:
3.6 133 during link, load, or execu
- Page 149 and 150:
3.6 135 parent child fd(O) fd(1) fd
- Page 151 and 152:
3.6 #include #include #include #
- Page 153 and 154:
3.6 #include #include #define BUF
- Page 155 and 156:
The processes executing in the oper
- Page 157 and 158:
#include #include #include int m
- Page 159 and 160:
145 Write an echo server using the
- Page 161 and 162:
which is available in the /usr/incl
- Page 163 and 164:
Part 2: The Message Passing System
- Page 165 and 166:
151 mentioning at this point. After
- Page 167 and 168:
4.1 CHAPTER The process model intro
- Page 169 and 170:
client (1) request 4.1 (2) create n
- Page 171 and 172:
4.2 4.2 157 Data dependency. The da
- Page 175 and 176:
#include #include 4.3 int sum; I*
- Page 177 and 178:
4.3 #include #include DWORD Sum;
- Page 182 and 183:
168 Chapter 4 Handling signals in s
- Page 185 and 186:
4.5 4.5 171 one thread can run at o
- Page 189 and 190:
program will then create a separate
- Page 193 and 194:
K C,j = L A;, 11 X Bn,j 11=:1 For e
- Page 195 and 196:
#define NUM_THREADS 10 I* an array
- Page 197:
5.1 CPU scheduling is the basis of
- Page 201:
5.2 5.1.4 Dispatcher 5.2 187 Anothe
- Page 204 and 205:
190 Chapter 5 that has the smallest
- Page 206:
192 Chapter 5 than what is left of
- Page 209:
5.3 195 process's CPU burst exceeds
- Page 213 and 214:
5.4 5.4 199 In general, a multileve
- Page 215 and 216:
#include #include #define NUM_THR
- Page 220 and 221:
206 Chapter 5 5.6 system and many g
- Page 222 and 223:
208 Chapter 5 CPU-intensive. As sho
- Page 224 and 225:
210 Chapter 5 .15 12 10 14 11 9 13
- Page 226 and 227:
212 Chapter 5 numeric priority 0 99
- Page 229 and 230:
5.7 215 cases where we are running
- Page 231:
5.8 5.8 217 space. Finally, the des
- Page 234:
220 Chapter 5 5.9 Which of the foll
- Page 237:
Part Three
- Page 241 and 242:
6.2 6.2 227 The concurrent executio
- Page 244 and 245:
230 Chapter 6 do { flag [i] = TRUE;
- Page 246 and 247:
232 Chapter 6 do { while (TestAndSe
- Page 248 and 249:
234 Chapter 6 6.5 To prove that the
- Page 250:
236 Chapter 6 where a single CPU is
- Page 254 and 255:
240 Chapter 6 do { II produce an it
- Page 256 and 257:
242 Chapter 6 do { wait(wrt); II wr
- Page 258 and 259:
244 Chapter 6 6.7 do { wait(chopsti
- Page 261:
shared data operations initializati
- Page 264 and 265:
250 Chapter 6 6.7.3 Implementing a
- Page 266 and 267:
252 Chapter 6 6.8 Unfortunately, th
- Page 268:
254 Chapter 6 An protects access to
- Page 271 and 272:
6.9 6.9 257 Spinlocks-along with en
- Page 274 and 275:
260 Chapter 6 Nonvolatile storage.
- Page 276:
262 Chapter 6 The presence of a re
- Page 281 and 282:
6.10 The timestamp protocol ensures
- Page 283 and 284:
do { while (TRUE) { flag[i] = want_
- Page 285 and 286:
6.14 Show that the two-phase lockin
- Page 287 and 288:
6.26 Discuss the tradeoff between f
- Page 289 and 290:
#include "buffer.h" I* the buffer *
- Page 291 and 292:
Pthreads Mutex Locks #include pthr
- Page 293:
279 the mutex. However, because we
- Page 297 and 298:
7.1 CH ER In a multiprogramming env
- Page 299 and 300:
7.2 7.2 285 now requests another dr
- Page 303 and 304:
7.2 Deadlock Characterization 289 F
- Page 305:
7.4 7.4 291 Although this method ma
- Page 308 and 309:
294 Chapter 7 7.5 acquires the lock
- Page 311 and 312:
7.5 297 Figure 7.6 Resource-allocat
- Page 313 and 314:
7.5 299 Let Work and Finish be vect
- Page 315 and 316:
7.6 7.6 301 If a system does not em
- Page 317 and 318:
7.6 303 You may wonder why we recla
- Page 319 and 320:
7.7 305 Aborting a process may not
- Page 321 and 322:
7.1 A single-lane bridge connects t
- Page 323 and 324:
7.9 Compare the circular-wait schem
- Page 325:
The various prevention algorithms w
- Page 329 and 330:
8.1 In Chapter 5, we showed how the
- Page 331 and 332:
8.1 317 main memory. A memory buffe
- Page 333 and 334:
} 8.1 compile time load time execut
- Page 335 and 336:
8.1 321 loading, a routine is not l
- Page 337 and 338:
8.2 323 lower-priority process can
- Page 339 and 340:
8.3 325 In. contiguous memory alloc
- Page 341 and 342:
8.3 327 Best fit. Allocate the smal
- Page 345:
8.4 331 When we use a paging scheme
- Page 348 and 349:
334 Chapter 8 TLB miss TLB p TLB hi
- Page 351 and 352:
8.5 ed 1 .. ed 2 ed 3 data .1 proce
- Page 353 and 354:
outer page table 8.5 Figure 8."15 A
- Page 355 and 356:
8.5 341 address, regardless of the
- Page 357 and 358:
subroutine main program logical add
- Page 360 and 361:
346 Chapter 8 I CPU I Figure 8.21 L
- Page 362 and 363:
3L!8 Chapter 8 To improve the effic
- Page 364 and 365:
350 Chapter 8 in memory, however, u
- Page 366 and 367:
352 Chapter 8 8.11 Compare paging w
- Page 368 and 369:
354 Chapter 8 8.23 Sharing segments
- Page 371 and 372:
9.1 c ER In Chapter 8, we discussed
- Page 373 and 374:
9.1 359 Because each user program c
- Page 375 and 376:
9.2 9.2 361 Consider how an executa
- Page 377 and 378:
operating system reference restart
- Page 380:
366 Chapter 9 Deterncine that the i
- Page 385:
9.4 371 b. If there is no free fram
- Page 388:
374 Chapter 9 reference string 7 0
- Page 392 and 393:
378 Chapter 9 clock fields or stack
- Page 394 and 395:
380 Chapter 9 (0, 1) not recently u
- Page 396 and 397:
382 Chapter 9 9.5 We turn next to t
- Page 399 and 400:
9.5 385 differently (for example, t
- Page 404 and 405:
390 Chapter 9 9.7 9.6.3 Page-Fault
- Page 408 and 409:
394 Chapter 9 #include #include i
- Page 410 and 411:
396 Chapter 9 9.8 To allow more con
- Page 412 and 413:
398 Chapter 9 9.8.2 Slab Allocation
- Page 415:
9.9 401 56.4 milliseconds to read t
- Page 418 and 419:
404 Chapter 9 9.9.6 1/0 Interlock W
- Page 420 and 421:
406 Chapter 9 indicate whether suff
- Page 422 and 423:
408 Chapter 9 that enables us to ma
- Page 424 and 425:
410 Chapter 9 Convert the following
- Page 426 and 427:
412 Chapter 9 b. Will the thread ch
- Page 428 and 429:
414 Chapter 9 b. If a page fault oc
- Page 430 and 431:
416 Chapter 9 9.34 Write a program
- Page 433:
Part Five Since main memory is usua
- Page 436 and 437:
422 Chapter 10 A file is a named co
- Page 440 and 441:
426 Chapter 10 File locks provide f
- Page 443 and 444:
10.1 429 the word processor is invo
- Page 446:
432 Chapter 10 Figure 10.4 Simulati
- Page 450 and 451:
436 Chapter 10 names may indicate a
- Page 452 and 453:
438 Chapter 10 the UFDs are the fil
- Page 454 and 455:
440 Chapter 10 if the current direc
- Page 456:
442 Chapter 10 indirect pointers. T
- Page 459 and 460:
ill (a) (b) 10.4 File-System Mounti
- Page 461 and 462:
10.5 447 can share access to the fi
- Page 463 and 464:
10.5 449 network information is use
- Page 465 and 466:
10.6 10.6 451 sharing users. Here,
- Page 467:
10.6 453 Constructing such a list m
- Page 471 and 472:
subdirectories and files but compli
- Page 473:
directory structures. These include
- Page 478 and 479:
464 Chapter 11 11.2 As was describe
- Page 480 and 481:
466 Chapter 11 user space user spac
- Page 482 and 483:
468 Chapter 11 On UNIX, file system
- Page 484 and 485:
470 Chapter 11 11.3 Thus, the VFS s
- Page 486 and 487:
472 Chapter 11 directory file start
- Page 489:
11.4 475 but improves disk throughp
- Page 492 and 493:
478 Chapter 11 Implementing File Sy
- Page 494:
480 Chapter 11 00111100111111000110
- Page 497 and 498:
11.6 483 to. That means the block m
- Page 499 and 500:
memory-mapped 1/0 11.6 485 buffer c
- Page 501:
11.7 487 system can confirm or deny
- Page 504 and 505:
490 Chapter 11 11.8 media too many
- Page 506:
492 Chapter 11 prefix /usr/local/di
- Page 509 and 510:
11.8 495 expensive path-name-traver
- Page 511 and 512:
11.9 497 map in a third, as shown i
- Page 513 and 514:
emote file systems can be integrate
- Page 515 and 516:
11.8 Consider the following backup
- Page 517:
workloads in distributed file syste
- Page 521 and 522:
12.1 507 DISK TRANSFER RATES As wit
- Page 523 and 524:
12.3 12.3 509 Computers access disk
- Page 525 and 526:
Figure 12.3 Storage-area network. 1
- Page 527 and 528:
12.4 queue= 98, 183, 37, 122, 14, 1
- Page 529 and 530:
12.4 queue = 98, 183, 37, 122, 14,
- Page 531 and 532:
12.5 517 mismatch indicates that th
- Page 533:
12.5.3 Bad Blocks 12.5 519 Because
- Page 537:
STRUCTURING RAID 12.7 523 RAID stor