Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/deadline-scheduling-for-real-time-systems-edf-and-related-algorithms-kl-intl-ser-engineering-and-computer-science-460/stankovic/descriptif_1601176
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=1601176

Deadline scheduling for real time systems: EDF and related algorithms (Kl. intl ser. engineering and computer science, 460), Softcover reprint of the original 1st ed. 1998 EDF and Related Algorithms The Springer International Series in Engineering and Computer Science Series, Vol. 460

Langue : Anglais

Auteurs :

Couverture de l’ouvrage Deadline scheduling for real time systems: EDF and related algorithms (Kl. intl ser. engineering and computer science, 460)
Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. Deadline Scheduling for Real-Time Systems: EDF and related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. For example, a list of issues to consider includes: + preemptive versus non-preemptive tasks, + uni-processors versus multi-processors, + using EDF at dispatch time versus EDF-based planning, + precedence constraints among tasks, + resource constraints, + periodic versus aperiodic versus sporadic tasks, + scheduling during overload, + fault tolerance requirements, and + providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field.
List of Figures. List of Tables. Preface. 1. Introduction. 2. Terminology and Assumptions. 3. Fundamentals of EDF Scheduling. 4. Response Times under EDF Scheduling. 5. Planning-Based Scheduling. 6. EDF Scheduling for Shared Resources. 7. Precedence Constraints and Shared Resources. 8. Aperiodic Task Scheduling. 9. Distributed Scheduling -- Part I. 10. Distributed Scheduling -- Part II. 11. Summary and Open Questions. Index.

Date de parution :

Ouvrage de 273 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Prix indicatif 179,30 €

Ajouter au panier

Date de parution :

Ouvrage de 280 p.

Sous réserve de disponibilité chez l'éditeur.

Prix indicatif 241,59 €

Ajouter au panier
En continuant à naviguer, vous autorisez Lavoisier à déposer des cookies à des fins de mesure d'audience. Pour en savoir plus et paramétrer les cookies, rendez-vous sur la page Confidentialité & Sécurité.
FERMER