实时系统(影印版)

.3.6 fanctional parameters
3.7 resource parameters of jobs and paramelers of resources
3.8 sckeduling hierarchy
3.9 summary
4 commonly used approaches to real-tme schedulig
4.1 clock-driven approach
4.2 weighted round-robin approach
4.3 priority-driven approach
4.4 dynamic versus static systems
4.5 effective release times and deadlines
4.6 optimality of the edf and lst algorithms
4.7 nonoptimality of the edf and the lst algorithms
4.8 challenges in validating timing constraints
in ptiority-driven systems
4.9 off-line versus on-line scheduling
4.10 summry
4.11 exercises
5 clock-driven scheduling
5.1 notations and assumptions
5.2 static, timer-driven scheduler
5.3 general structure of cyclic schedules
5.4 cyclic executives
5.5 improving the average response time of aperiodic jobs
5.6 scheduling sporadic jobs
5.7 practical considerations and generalizations
5.8 algorithm for constructing static schedules
5.9 pros and cons of clock-driven scheduling
5.10 sammary
6 prioroty-driven scheduling of periodic tasks
6.1 static assumption
6.2 fixed-priority versus dynamic-ptiority algorithms
6.3 maximum schedulable utilization
6.4 optimality of the rm and dm algorithms
6.5 a schedulability test for fixed-priority tasks
with shon response times
6.6 schedulability test for fixed-hriority tasks with arbitrary
response times
6.7 sufficient schedulability conditions for the rm
and dm algorthms
6.8 ptactical factors
6.9 sammary
7 scheduling aperiodic and sporadic jobs w
priority-drfven systems
7.1 assumptions and approaches
7.2 deferrable servers
7.3 sporadic servers
7.4 constant utilization, total bandwidth, and weighted
fair-queueing servers
7.5 slack stealing in deadline-driven systems
7.6 slack stealing in fixed-priority systems
7.7 scheduling of sporadic jobs
7.8 real-time performance for jobs with soft timing constraints
7.9 a two-level scheme for integrated scheduling
7.10 summary
8 resources and resource access control
8.1 assumptions on resources and their usage
8.2 effects of resource contention aad resource access control
8.3 nonpreemptive critical sections
8.4 basic priority-inheritance protocol
8.5 basic priority-ceiling protocol
8.6 stack-based, priority-ceiling (ceiling-priority) protocd
8.7 use of priority-ceiling protocol in dynamic-priority systems
8.8 preemption-ceiling protocol
8.9 controlling accesses to multiple-unit resources
8.10 controlling concurrent accesses to data objects
8.11 summary
9 mu tiprocessor scheduling, resource access control,
and synchronization
9.1 model of multiprocessor and distributed systems
9.2 task assignment
9.3 multiprocessor priority-ceiling protocol
9.4 elements of scheduling algorithms for end-to-end periodic tasks
9.5 schedulability of fixed-priority end-to-end periodic tasks
9.6 end-to-end tasks in heterogeneous systems
9.7 predictability and validation of dynamic multiprocessor systems
9.8 summary
10 scheduling flexible compputations and tasks
with temporal distance constraints
10.1 flexible applications
10.2 tasks with temporal distance constraints
10.3 summary
11 real-tlme communicaion
11.1 model of real-time communication
11.2 priority-based service disciplines for switched networks
11.3 weighted round-robin service disciplines
11.4 medium access-control protocols of broadcast networks
11.5 internet and resource reservation protocols
11.6 real-time protocol
11.7 communication in multicomputer systems
11.8 summary
12 operating systenis
12.1 overiew
12.2 time services and scheduling mechanisms
12.3 other basic operating system functions
12.4 processor reserves and resource kernel
12.5 open system architecture
12.6 capabilities of commercial real-time operating systems
12.7 predictability of ceneral-purpose operating systems
12.8 summary
appendix posix thread and real-time extensions
bibliography
index