實時系統(tǒng)

內容概要

本書全面地涵蓋實時操作系統(tǒng)和通信網(wǎng)絡的近期進展內容，使用多種例子說明算法或者規(guī)則。主要內容包括：硬件和軟件實時系統(tǒng)和劃分原則，實時系統(tǒng)的參考模型，特征化系統(tǒng)描述，設計時間調度和驗證實時系統(tǒng)的算法和規(guī)則，時間調度方法綜述，一般和循環(huán)執(zhí)行中的時間驅動方法，單處理器時間調度和資源訪問控制算法，多處理器和分布式系統(tǒng)上的任務間的控制和數(shù)據(jù)依附性，以及定時需求中的同時終止性質，以時間和資源需求贏取質量，通信網(wǎng)絡中的實時問題，操作系統(tǒng)服務與機制的實現(xiàn)，還綜述了一些商用實時系統(tǒng)和通用操作系統(tǒng)。本書適用于計算機科學與工程系中的實時系統(tǒng)方面的本科高年級課程與研究生課程。    內容：⒈ 典型實時系統(tǒng)應用 ⒉ 硬件與軟件實時系統(tǒng) ⒊ 實時系統(tǒng)參考模型 ⒋ 硬件實時系統(tǒng)調度常用方法 ⒌ 時鐘驅動調度 ⒍ 周期性任務的優(yōu)先級驅動調度 ⒎ 優(yōu)先級驅動系統(tǒng)中的非周期性與不規(guī)則性工作的調度 ⒏ 資源與資源訪問控制 ⒐ 多處理器調度與資源訪問控制 ⒑ 時間跨度限制條件下的柔性計算和任務調度 ⒒ 實時通信 ⒓ 操作系統(tǒng)

作者簡介

作者Jane W. S. Liu現(xiàn)執(zhí)教于美國伊利諾依大學，是ACM會員，IEEE成員，目前的研究興趣集中在為實時應用提供開放環(huán)境的最佳途徑。

書籍目錄

PREFA CE1 TYPICAL REAL-TlME APPLICATJONS 1.1 Digital Control 1.2 High-Level Controls 1.3 Signal Processing 1.4 Other Real-Time Applications 1.5 Summary2 HARD VERSUS SOFT REAL-TlME SYSTEMS 2.1 Jobs and Processors 2.2 Release Times, Deadlines, and Timing Constraints 2.3 Hard and Soft Timing Constraints 2.4 Hard Real-Time Systems 2.5 Soft Real-Time Systems 2.6 Summary3 A REFERENCE MODEL OF REAL-TIME SYSTEMS 3.1 Processors and Resources 3.2 Temporal Parameters of Real-Time Workload 3.3 Periodic Task Model 3.4 Precedence Constraints and Data Dependency 3.5 Other Types of Dependencies 3.6 Fanctional Parameters 3.7 Resource Parameters of Jobs and Paramelers of Resources 3.8 Sckeduling Hierarchy 3.9 Summary4 COMMONLY USED APPROACHES TO REAL-TME SCHEDULIG 4.1 Clock-Driven Approach 4.2 Weighted Round-Robin Approach 4.3 Priority-Driven Approach 4.4 Dynamic versus Static Systems 4.5 Effective Release Times and Deadlines 4.6 Optimality of the EDF and LST Algorithms 4.7 Nonoptimality of the EDF and the LST Algorithms 4.8 Challenges in Validating Timing Constraints in Ptiority-Driven Systems 4.9 Off-Line versus On-Line Scheduling 4.10 Summry 4.11 Exercises5 CLOCK-DRIVEN SCHEDULING 5.1 Notations and Assumptions 5.2 Static, Timer-Driven Scheduler 5.3 General Structure of Cyclic Schedules 5.4 Cyclic Executives 5.5 Improving the Average Response Time of Aperiodic Jobs 5.6 Scheduling Sporadic Jobs 5.7 Practical Considerations and Generalizations 5.8 Algorithm for Constructing Static Schedules 5.9 Pros and Cons of Clock-Driven Scheduling 5.10 Sammary6 PRIOROTY-DRIVEN SCHEDULING OF PERIODIC TASKS 6.1 Static Assumption 6.2 Fixed-Priority versus Dynamic-Ptiority Algorithms 6.3 Maximum Schedulable Utilization 6.4 Optimality of the RM and DM Algorithms 6.5 A Schedulability Test for Fixed-Priority Tasks with Shon Response Times 6.6 Schedulability Test for Fixed-hriority Tasks with Arbitrary Response Times 6.7 Sufficient Schedulability Conditions for the RM and DM Algorthms 6.8 Ptactical Factors 6.9 Sammary 7 SCHEDULING APERIODIC AND SPORADIC JOBS W PRIORITY-DRfVEN SYSTEMS 7.1 Assumptions and Approaches 7.2 Deferrable Servers 7.3 Sporadic Servers 7.4 Constant Utilization, Total Bandwidth, and Weighted Fair-Queueing Servers 7.5 Slack Stealing in Deadline-Driven Systems 7.6 Slack Stealing in Fixed-Priority Systems 7.7 Scheduling of Sporadic Jobs 7.8 Real-Time Performance for Jobs with Soft Timing Constraints 7.9 A Two-Level Scheme for Integrated Scheduling 7.10 Summary 8 RESOURCES AND RESOURCE ACCESS CONTROL9 MU TIPROCESSOR SCHEDULING, RESOURCE ACCESS CONTROL,AND SYNCHRONIZATION10 SCHEDULING FLEXIBLE COMPPUTATIONS AND TASKS WITH TEMPORAL DISTANCE CONSTRAINTS11 REAL-TlME COMMUNICAION12 OPERATING SYSTENISAPPENDIX POSIX THREAD AND REAL-TIME EXTENSIONSBIBLIOGRAPHYINDEX

圖書封面

評論、評分、閱讀與下載

---

    實時系統(tǒng) PDF格式下載

---