Multiprocessor Scheduling In A Hard Real Time Environment
Download Multiprocessor Scheduling In A Hard Real Time Environment PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Multiprocessor Scheduling In A Hard Real Time Environment book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Multiprocessor Scheduling for Real-Time Systems
This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems. The authors derive new, abstract models of real-time tasks that capture accurately the salient features of real application systems that are to be implemented on multiprocessor platforms, and identify rules for mapping application systems onto the most appropriate models. New run-time multiprocessor scheduling algorithms are presented, which are demonstrably better than those currently used, both in terms of run-time efficiency and tractability of off-line analysis. 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.
Resource Management in Real-time Systems and Networks
This book introduces the concepts and state-of-the-art research developments of resource management in real-time systems and networks. Real-time systems and networks are of increasing importance in many applications, including automated factories, telecommunication systems, defense systems, and space systems. This book introduces the concepts and state-of-the-art research developments of resource management in real-time systems and networks. Unlike other texts in the field, it covers the entire spectrum of issues in resource management, including task scheduling in uniprocessor real-time systems; task scheduling, fault-tolerant task scheduling, and resource reclaiming in multiprocessor real-time systems; conventional task scheduling and object-based task scheduling in distributed real-time systems; message scheduling; QoS routing; dependable communication; multicast communication; and medium access protocols in real-time networks. It provides algorithmic treatments for all of the issues addressed, highlighting the intuition behind each algorithm and giving examples. The book also includes two chapters of case studies.
Deadline Scheduling for Real-Time Systems
Author: John A. Stankovic
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
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.