These include cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. Dynamic real-time scheduling algorithms are more appropriate for these systems and used in such systems. There is much literature on EDF-based scheduling with the extension a lot to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processor and distributed systems. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims to collect a significant body of knowledge on EDF scheduling for real-time systems, but do not try to be all-inclusive (the literature is too broad). For example, a list of things to consider include: + task preemptive versus non-preemptive, + uni-processor versus multi-processor, + using at the time of delivery versus EDF-based EDF, + precedence constraints among tasks, limited resources + , + periodic versus aperiodic versus sporadic task scheduling during overload +, + requirements for fault tolerance, and + collateral provided and the level of assurance (quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be a concern to researchers, designers of real-time systems, and instructors and students, both as a program focused on deadline-based scheduling for real-time system, or, more likely, as part of a more general program on real-time computing.