一份用動畫演示作業系統的各個過程的資料

Animationfor OS

ProcessDescription and Control

• Thedynamic state of a process

• CPUswitching between processes as a result of system calls orinterrupts

• Swappingof processes using a disk as a backing store

• OSperformance

• Exampleprocess life cycle

MutualExclusion and Synchronization

• Producer/Consumerproblem

• TheCritical Section problem

• Semaphores

• Producer/consumersemaphore solution
  
  

• Producer/consumermonitor solution

• Producer/consumermessage passing solution
  

• SimulationofRicartandAgrawalaMutual Exclusion Algorithm
  Simplesolution to the bounded buffer problem
  
  

• Implementationof Bounded Buffer problem using a counter variable
  
  

• Showingproblems with atomicity and mutual exclusion using the BoundedBuffer with counter solution

• Mutualexclusion with a semaphore
  
  

• Processsynchronization with semaphores

Concurrency:Deadlock and Starvation

Deadlocks:resource allocation graph

MemoryManagement

• Overlaysfor primitive memory management

• Dynamicrelocation using a relocation register

• Multiple-partitioncontiguous memory allocation

• Compaction

• Paginghardware

• Pagingmodel of logical and physical memory

• PagingExample for a 32-byte memory with 4-byte pages

• Segmentationhardware

• Pagedsegmentation

VirtualMemory

• Paginghardware with TLB

• Twolevel paging

• Invertedpage tables

• Virtualmemory

• Demandpaging

• Stepsin handling a page fault

• Pagereplacement

• Secondchance algorithm for page replacement

• Theworking set model for page replacement

• ConsiderationsFor Page Replacement in Virtual Memory Mode

• Pagereplacement algorithms

• FIFO

• Optimal

• LRU

Uni-processorScheduling

• ProcessScheduling Algorithms:

• FirstCome, First Served

• ShortestJob First

• Priority

• RoundRobin

I/OManagement and Disk Scheduling

• Theuse of a system call to perform I/O.

• Interrupt-drivenI/O cycle

• Thelife cycle of an I/O request

• Diskscheduling algorithms:

• FCFS

• SSTF

• SCAN