Hard real-time computing systems : predictable scheduling algorithms and applications
著者
書誌事項
Hard real-time computing systems : predictable scheduling algorithms and applications
（Real-time systems series, 23）
Springer, c2005
2nd ed
大学図書館所蔵 件 / 全12件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [405]-417) and index
内容説明・目次
内容説明
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.
目次
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.- Glossary.
「Nielsen BookData」 より