Modern Operating Systems by Herbert Bos ...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf-M ODERN O PERATING S YSTEMS
Showing 14-16 out of 1137
Modern Operating Systems by Herbert Bos and Andrew...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf-M ODERN O PERATING S YSTEMS
Modern Operating Systems by Herbert...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf-M ODERN O PERATING S YSTEMS
Page 14
CONTENTS
xiii
5
INPUT/OUTPUT
337
5.1
PRINCIPLES OF I/O HARDWARE 337
5.1.1 I/O Devices 338
5.1.2 Device Controllers
339
5.1.3 Memory-Mapped I/O
340
5.1.4 Direct Memory Access
344
5.1.5 Interrupts Revisited 347
5.2
PRINCIPLES OF I/O SOFTWARE 351
5.2.1 Goals of the I/O Software
351
5.2.2 Programmed I/O
352
5.2.3 Interrupt-Driven I/O 354
5.2.4 I/O Using DMA
355
5.3
I/O SOFTWARE LAYERS 356
5.3.1 Interrupt Handlers
356
5.3.2 Device Drivers 357
5.3.3 Device-Independent I/O Software
361
5.3.4 User-Space I/O Software
367
5.4
DISKS
369
5.4.1 Disk Hardware 369
5.4.2 Disk Formatting 375
5.4.3 Disk Arm Scheduling Algorithms
379
5.4.4 Error Handling
382
5.4.5 Stable Storage
385
5.5
CLOCKS
388
5.5.1 Clock Hardware 388
5.5.2 Clock Software 389
5.5.3 Soft Timers 392
5.6
USER INTERFACES: KEYBOARD, MOUSE, MONITOR
394
5.6.1 Input Software 394
5.6.2 Output Software 399
5.7
THIN CLIENTS 416
5.8
POWER MANAGEMENT 417
5.8.1 Hardware Issues
418


Page 15
xiv
CONTENTS
5.8.2 Operating System Issues
419
5.8.3 Application Program Issues
425
5.9
RESEARCH ON INPUT/OUTPUT
426
5.10 SUMMARY
428
6
DEADLOCKS
435
6.1
RESOURCES
436
6.1.1 Preemptable and Nonpreemptable Resources
436
6.1.2 Resource Acquisition
437
6.2
INTRODUCTION TO DEADLOCKS 438
6.2.1 Conditions for Resource Deadlocks
439
6.2.2 Deadlock Modeling
440
6.3
THE OSTRICH ALGORITHM
443
6.4
DEADLOCK DETECTION AND RECOVERY
443
6.4.1 Deadlock Detection with One Resource of Each Type
444
6.4.2 Deadlock Detection with Multiple Resources of Each Type
446
6.4.3 Recovery from Deadlock
448
6.5
DEADLOCK AV OIDANCE 450
6.5.1 Resource Trajectories 450
6.5.2 Safe and Unsafe States
452
6.5.3 The Banker’s Algorithm for a Single Resource
453
6.5.4 The Banker’s Algorithm for Multiple Resources
454
6.6
DEADLOCK PREVENTION 456
6.6.1 Attacking the Mutual-Exclusion Condition
456
6.6.2 Attacking the Hold-and-Wait Condition
456
6.6.3 Attacking the No-Preemption Condition
457
6.6.4 Attacking the Circular Wait Condition
457
6.7
OTHER ISSUES
458
6.7.1 Two-Phase Locking
458
6.7.2 Communication Deadlocks
459


Page 16
CONTENTS
xv
6.7.3 Livelock 461
6.7.4 Starvation 463
6.8
RESEARCH ON DEADLOCKS
464
6.9
SUMMARY
464
7
VIRTUALIZATION AND THE CLOUD
471
7.1
HISTORY
473
7.2
REQUIREMENTS FOR VIRTUALIZATION 474
7.3
TYPE 1 AND TYPE 2 HYPERVISORS
477
7.4
TECHNIQUES FOR EFFICIENT VIRTUALIZATION
478
7.4.1 Virtualizing the Unvirtualizable
479
7.4.2 The Cost of Virtualization
482
7.5
ARE HYPERVISORS MICROKERNELS DONE RIGHT?
483
7.6
MEMORY VIRTUALIZATION 486
7.7
I/O VIRTUALIZATION 490
7.8
VIRTUAL APPLIANCES
493
7.9
VIRTUAL MACHINES ON MULTICORE CPUS
494
7.10 LICENSING ISSUES 494
7.11 CLOUDS
495
7.11.1 Clouds as a Service
496
7.11.2 Virtual Machine Migration
496
7.11.3 Checkpointing
497
7.12 CASE STUDY: VMWARE 498
7.12.1 The Early History of VMware
498
7.12.2 VMware Workstation 499


Ace your assessments! Get Better Grades
Browse thousands of Study Materials & Solutions from your Favorite Schools
Concordia University
Concordia_University
School:
Operating_Systems
Course:
Great resource for chem class. Had all the past labs and assignments
Leland P.
Santa Clara University
Introducing Study Plan
Using AI Tools to Help you understand and remember your course concepts better and faster than any other resource.
Find the best videos to learn every concept in that course from Youtube and Tiktok without searching.
Save All Relavent Videos & Materials and access anytime and anywhere
Prepare Smart and Guarantee better grades

Students also viewed documents