Chapter 4:   Process and Flow Planning

Types Of Planning
Long-Term Planning
Medium-Term Planning
Short-Term Planning
Planning Strategies - Displacement And Non-Displacement Multitasking
Planning Algorithms
FIFO Planning
Circular Planning
Priority Planning
Planning Based On Performance Characteristics
Multilevel Feedback Queues
Lottery Planning
Implementation Of Planning In Linux
Real-Time Scheduling Of Kernel Processes
Traditional Scheduling Algorithm
Planning Procedure Call Conditions
Planning Procedure
The Beginning Of A New Era
Dynamic Priority Calculation
Recounting A Quantum When Creating A New Process
Modern Approaches To Planning Implementation
The Programming Interface Of Planning
Conclusions
Chapter 5:
 
Flow Interaction
Basic Principles Of Flow Interaction
The Main Problems Of Flow Interaction
Critical Sections And Locks
Locking
Problems With Implementation Of Blocking
Basic Mechanisms Of Flow Synchronization
Semaphores
Features Of Use Of Semaphores
Realization Of The Problem Of Producers-Consumers With The Help Of
Semaphores
Mutexes
Interprocess
Types Of Interprocess Interaction

Conclusions
Chapter 6:
 
Managing Memory
Fundamentals of Virtual Memory Technology
The Concept Of Virtual Memory
Problems of virtual memory implementation: Memory fragmentation
Logical And Physical Memory Addressing
Approach Of Base And Boundary Registers
Memory Segmentation
Segmentation Implementation In IA-32 Architecture
Page Memory Organization
Basic Principles Of Page Organization Of Memory
Comparative Analysis Of Page Organization Of Memory And
Segmentation
Multi-Level Page Tables
Implementation Of Page Tables In IA-32 Architecture
Associative Memory

Download 6,34 Mb.