UsefulLinks
Systems Science
Queueing Theory and Scheduling
1. Introduction to Queueing Systems
2. Mathematical Foundations
3. Basic Markovian Queueing Models
4. Advanced Queueing Models
5. Queueing Networks
6. Fundamentals of Scheduling
7. Single Machine Scheduling
8. Parallel Machine Scheduling
9. Flow Shop and Job Shop Scheduling
10. Real-Time Scheduling
11. Network Scheduling
12. Analysis Techniques and Tools
13. Performance Evaluation and Optimization
14. Applications and Case Studies
10.
Real-Time Scheduling
10.1.
Real-Time System Characteristics
10.1.1.
Hard Real-Time Systems
10.1.2.
Soft Real-Time Systems
10.1.3.
Firm Real-Time Systems
10.2.
Periodic Task Scheduling
10.2.1.
Task Model
10.2.1.1.
Period
10.2.1.2.
Deadline
10.2.1.3.
Execution Time
10.2.2.
Rate Monotonic Scheduling (RMS)
10.2.2.1.
Priority Assignment
10.2.2.2.
Schedulability Analysis
10.2.2.3.
Utilization Bound
10.2.3.
Deadline Monotonic Scheduling (DMS)
10.2.3.1.
Priority Assignment
10.2.3.2.
Schedulability Test
10.2.4.
Earliest Deadline First (EDF)
10.2.4.1.
Algorithm Description
10.2.4.2.
Optimality Properties
10.2.4.3.
Schedulability Analysis
10.3.
Aperiodic Task Scheduling
10.3.1.
Background Scheduling
10.3.2.
Polling Server
10.3.3.
Deferrable Server
10.3.4.
Sporadic Server
10.4.
Resource Sharing
10.4.1.
Priority Inversion
10.4.2.
Priority Inheritance Protocol
10.4.3.
Priority Ceiling Protocol
10.5.
Multiprocessor Real-Time Scheduling
10.5.1.
Partitioned Scheduling
10.5.2.
Global Scheduling
10.5.3.
Hybrid Approaches
Previous
9. Flow Shop and Job Shop Scheduling
Go to top
Next
11. Network Scheduling