Multiprocessor Scheduling for Real-Time Systems

Readers will benefit from a new design and analysis framework for multiprocessor real-time systems, which will translate into a significantly enhanced ability to provide formally verified, safety-critical real-time systems at a significantly lower cost.

Introduction: background, scope, and context.- Preliminaries: workload and platform models.- Preliminaries: scheduling concepts and goals.- A review of selected results on uniprocessors.- Implicit-deadline (L&L) tasks.- Partitioned scheduling of L&L tasks.- Global dynamic-priority scheduling of L&L tasks.- Global Fixed-Job-Priority scheduling of L&L tasks.- Global Fixed-Task-Priority scheduling of L&L tasks.- The three-parameter sporadic tasks model.- Partitioned scheduling.- Global scheduling: general comments.- Density-based global schedulability tests.- A strategy for global schedulability analysis.- The [BCL] and [BAR] tests.- The [BAK] test.- Response time analysis: The [RTA] test.- Global Fixed-Task-Priority scheduling.- Speedup bounds for global scheduling.- Global Dynamic Priority scheduling.- The sporadic DAG tasks model.- Real-time scheduling upon heterogeneous multiprocessors.- Looking ahead.