The following links are for animations, and are from three sources:
Animations developed by Brian English of Henderson State University and Stephen Rainwater of The University of Texas at Tyler
Animations developed by at Queensland University
The dynamic state of a process.
CPU switching between processes as a result of system calls or interrupts
Swapping of processes using a disk as a backing store
Example process life cycle
Producer/Consumer problem
The Critical Section problem
Semaphores
Simple solution to the bounded buffer problem
Implementation of Bounded Buffer problem using a counter variable
Showing problems with atomicity and mutual exclusion using the Bounded Buffer with counter solution
Mutual exclusion with a semaphore
Process synchronization with semaphores
Deadlocks: resource allocation graph
Overlays for primitive memory management
Dynamic relocation using a relocation register
Multiple-partition contiguous memory allocation
Compaction
Paging hardware
Paging model of logical and physical memory
Paging Example for a 32-byte memory with 4-byte pages
Segmentation hardware
Paged segmentation
Paging hardware with TLB
Two level paging
Inverted page tables
Virtual memory
Demand paging
Steps in handling a page fault
Page replacement
Second chance algorithm for page replacement
The working set model for page replacement
Considerations For Page Replacement in Virtual Memory Mode
Page replacement algorithms:
Process Scheduling Algorithms:
•First Come, First Served
•Shortest Job First
•Priority
•Round Robin
The use of a system call to perform I/O.
Interrupt-driven I/O cycle
The life cycle of an I/O request
Disk scheduling algorithms: