Useful Links
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
Real-Time Scheduling
Real-Time System Characteristics
Hard Real-Time Systems
Soft Real-Time Systems
Firm Real-Time Systems
Periodic Task Scheduling
Task Model
Period
Deadline
Execution Time
Rate Monotonic Scheduling (RMS)
Priority Assignment
Schedulability Analysis
Utilization Bound
Deadline Monotonic Scheduling (DMS)
Priority Assignment
Schedulability Test
Earliest Deadline First (EDF)
Algorithm Description
Optimality Properties
Schedulability Analysis
Aperiodic Task Scheduling
Background Scheduling
Polling Server
Deferrable Server
Sporadic Server
Resource Sharing
Priority Inversion
Priority Inheritance Protocol
Priority Ceiling Protocol
Multiprocessor Real-Time Scheduling
Partitioned Scheduling
Global Scheduling
Hybrid Approaches
Previous
9. Flow Shop and Job Shop Scheduling
Go to top
Next
11. Network Scheduling