Verwandte Artikel zu Deadline Scheduling for Real-Time Systems: EDF and...
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms: 460 (The Springer International Series in Engineering and Computer Science) - Hardcover
Inhaltsangabe
Book by Stankovic John A Spuri Marco Ramamritham Krithi Bu
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum1998
- ISBN 10 0792382692
- ISBN 13 9780792382690
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten296
Gebraucht kaufen
Zustand: BefriedigendConnecting readers with great books...
Diesen Artikel anzeigen
EUR 54,40
EUR 3,36 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 122,74
EUR 6,23 für den Versand innerhalb von/der USA
Versandziele, Kosten & Dauer
Suchergebnisse für Deadline Scheduling for Real-Time Systems: EDF and...
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms (The Springer International Series in Engineering and Computer Science, 460)
Anbieter: HPB-Red, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_403378406
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1998. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1998. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers D-585-296
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms (The Springer International Series in Engineering and Computer Science, 460)
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-0792382692
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms (The Springer International Series in Engineering and Computer Science, 460)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2416190185148
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Deadline Scheduling for Real-Time Systems
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 294 pp. Englisch. Bestandsnummer des Verkäufers 9780792382690
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms (The Springer International Series in Engineering and Computer Science, 460)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9780792382690_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Deadline Scheduling for Real-Time Systems
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. . Bestandsnummer des Verkäufers 5970793
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Deadline Scheduling for Real-Time Systems : EDF and Related Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9780792382690
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 296 Index. Bestandsnummer des Verkäufers 26321132
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Deadline Scheduling for Real-Time Systems
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Print on Demand pp. 296 Figure, 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Bestandsnummer des Verkäufers 7559603
Anzahl: 4 verfügbar