Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications is a basic treatise on real-time computing, with particular emphasis on predictable scheduling algorithms. It introduces the fundamental concepts of real-time computing, illustrates the most significant results in the field, and provides the essential methodologies for designing predictable computing systems which can be used to support critical control applications. This volume serves as a textbook for advanced level courses on the topic. Each chapter provides basic concepts, which are followed by algorithms that are illustrated with concrete examples, figures and tables. Exercises are included with each chapter and solutions are given at the end of the book. The book also provides an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications.

Cr�ticas

From the reviews: "This book ... . represents the fruit of a 15-year research career. ... The target audience for the book ... will benefit from the large number of illustrations, and the exercises that accompany each chapter. The exercises will be very helpful when digesting ... . Overall, the book is an excellent introductory textbook for predictable scheduling in hard real-time computing systems, combining the right balance of theory and practice." (Computing Reviews, April 2004)

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.