Hard Real-Time Computing Systems

Predictable Schedulding Algorithms and Applications

Giorgo C. Buttazzo - Collection Real-Time Systems Series

425 pages, parution le 11/02/2005 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

Real-time computing plays a crucial role in our society since an increasing number of complex systems rely, in part or completely, on processor control. Examples of applications that require real-time computing include nuclear power plants, railway switching systems, automotive electronics, air traffic control, telecommunications, robotics, and military systems. The last few years have seen real-time computing applied in new areas, such as multimedia systems, flight simulation systems, virtual reality, and interactive games. In spite of this large application domain, however, most of the current real-time systems are still designed and implemented using low level programming and empirical techniques, without the support of a scientific methodology. This type of approach results in a lack of reliability and, when used in critical applications, may even cause serious environmental damage or loss of life.

HARD REAL-TIME COMPUTING SYSTEMS is a basic treatise on real-time computing, with particular emphasis on predictable scheduling algorithms. The main objectives of the book are to introduce the basic concepts of real-time computing, illustrate the most significant results in the field, and provide the basic methodologies for designing predictable computing systems useful in supporting critical control applications. The book is written for instructional use and is organized to enable readers without a strong knowledge of the subject matter to quickly grasp the material. Technical concepts are clearly defined at the beginning of each chapter, and algorithm descriptions are reinforced through concrete examples, illustrations, and tables. A set of exercises is included at the end of each chapter, and solutions are given at the end of the book.

The 2^nd Edition includes the most recently proposed methods in real-time literature. Chapter 4 compares the two most popular algorithms used in real-time systems-Rate Monotonic (RM) and Earliest Deadline First (EOF)-and addresses common misconceptions about each. This expanded chapter also provides a new section about Timeline Scheduling, which improves the classical acceptance ratio by utilizing a new schedulability test for the RM algorithm. To address periodic task sets with deadlines less than periods under EOF, the processor demand criterion has also been expanded.

Several other chapters have been broadened as well. Chapter 7 improves upon schedulability analysis under EOF with resource constraints. Chapter 8 incorporates three new techniques for handling permanent overload conditions in periodic task systems, while Chapter 11 adds presentations on more recently developed kernels. The 2nd Edition also features new references and new exercises with solutions.

Sommaire

A General View
Basic Concepts
Aperiodic Task Scheduling
Periodic Task Scheduling
Fixed-Priority Servers
Dynamic Priority Servers
Resource Access Protocols
Handling Overload Conditions
Kernel Design Issue
Application Design Issues
Real-Time Operating Systems and Standard
Solutions to the Exercises

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Giorgo C. Buttazzo
Collection	Real-Time Systems Series
Parution	11/02/2005
Édition	2^eme édition
Nb. de pages	425
Format	16 x 24
Couverture	Relié
Poids	850g
Intérieur	Noir et Blanc
EAN13	9780387231372
ISBN13	978-0-387-23137-2