图书介绍

实时系统 英文本【2025|PDF|Epub|mobi|kindle电子书版本百度云盘下载】

实时系统 英文本
  • Jane W. S. Liu著 著
  • 出版社: 北京:高等教育出版社
  • ISBN:7040114062
  • 出版时间:2002
  • 标注页数:610页
  • 文件大小:33MB
  • 文件页数:625页
  • 主题词:

PDF下载


点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示:(请使用BT下载软件FDM进行下载)软件下载地址页直链下载[便捷但速度慢]  [在线试读本书]   [在线获取解压码]

下载说明

实时系统 英文本PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台)。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用!后期资源热门了。安装了迅雷也可以迅雷进行下载!

(文件页数 要大于 标注页数,上中下等多册电子书除外)

注意:本站所有压缩包均有解压码: 点击下载压缩包解压工具

图书目录

1 TYPICAL REAL-TIME APPLICATIONS1

1.1 Digital Control2

1.2 High-Level Controls10

1.3 Signal Processing14

1.4 Other Real-Time Applications19

1.5 Summary25

2 HARD VERSUS SOFT REAL-TIME SYSTEMS26

2.1 Jobs and Processors26

2.2 Release Times,Deadlines,and Timing Constraints27

2.3 Hard and Soft Timing Constraints27

2.4 Hard Real-Time Systems29

2.5 Soft Real-Time Systems31

2.6 Summary32

3 A REFERENCE MODEL OF REAL-TIME SYSTEMS34

3.1 Processors and Resources35

3.2 Temporal Parameters of Real-Time Workload37

3.3 Periodic Task Model40

3.4 Precedence Constraints and Data Dependency42

3.5 Other Types of Dependencies45

3.6 Functional Parameters48

3.7 Resource Parameters of Jobs and Parameters of Resources51

3.8 Scheduling Hierarchy52

3.9 Summary56

4 COMMONLY USED APPROACHES TO REAL-TIME SCHEDULING60

4.1 Clock-Driven Approach60

4.2 Weighted Round-Robin Approach61

4.3 Priority-Driven Approach62

4.5 Effective Release Times and Deadlines65

4.4 Dynamic versus Static Systems65

4.6 Optimality of the EDF and LST Algorithms67

4.7 Nonoptimality of the EDF and the LST Algorithms70

4.8 Challenges in Validating Timing Constraints in Priority-Driven Systems72

4.9 Off-Line versus On-Line Scheduling77

4.10 Summary81

4.11 Exercises82

5 CLOCK-DRIVENSCHEDULING85

5.1 Notations and Assumptions85

5.2 Static,Timer-Driven Scheduler86

5.3 General Structure of Cyclic Schedules88

5.4 Cyclic Executives90

5.5 Improving the Average Response Time of Aperiodic Jobs92

5.6 Scheduling Sporadic Jobs96

5.7 Practical Considerations and Generalizations102

5.8 Algorithm for Constructing Static Schedules106

5.9 Pros and Cons of Clock-Driven Scheduling111

5.10 Summary113

6 PRIORITY-DRIVEN SCHEDULING OF PERIODIC TASKS115

6.1 Static Assumption116

6.2 Fixed-Priority versus Dynamic-Priority Algorithms117

6.3 Maximum Schedulable Utilization124

6.4 Optimality of the RM and DM Algorithms129

6.5 A Schedulability Test for Fixed-Priority Tasks with Short Response Times130

6.6 Schedulability Test for Fixed-Priority Tasks with Arbitrary Response Times140

6.7 Sufficient Schedulability Conditions for the RM and DM Algorithms146

6.8 Practical Factors159

6.9 Summary179

7.1 Assumptions and Approaches190

7 SCHEDULING APERIODIC AND SPORADIC JOBS IN PRIORITY-DRIVEN SYSTEMS190

7.2 Deferrable Servers195

7.3 Sporadic Servers204

7.4 Constant Utilization,Total Bandwidth,and Weighted Fair-Queueing Servers218

7.5 Slack Stealing in Deadline-Driven Systems233

7.6 Slack Stealing in Fixed-Priority Systems244

7.7 Scheduling of Sporadic Jobs250

7.8 Real-Time Performance for Jobs with Soft Timing Constraints259

7.9 A Two-Level Scheme for Integrated Scheduling263

7.10 Summary267

8 RESOURCES AND RESOURCE ACCESS CONTROL277

8.1 Assumptions on Resources and Their Usage277

8.2 Effects of Resource Contention and Resource Access Control280

8.3 Nonpreemptive Critical Sections284

8.4 Basic Priority-Inheritance Protocol286

8.5 Basic Priority-Ceiling Protocol290

8.6 Stack-Based,Priority-Ceiling(Ceiling-Priority) Protocol300

8.7 Use of Priority-Ceiling Protocol in Dynamic-Priority Systems304

8.8 Preemption-Ceiling Protocol308

8.9 Controlling Accesses to Multiple-Unit Resources313

8.10 Controlling Concurrent Accesses to Data Objects317

8.11 Summary322

9 MU TIPROCESSOR SCHEDULING,RESOURCE ACCESS CONTROL,AND SYNCHRONIZATION330

9.1 Model ofMultiprocessor and Distributed Systems331

9.2 Task Assignment339

9.3 Multiprocessor Priority-Ceiling Protocol352

9.4 Elements of Scheduling Algorithms for End-to-End Periodic Tasks360

9.5 Schedulability of Fixed-Priority End-to-End Periodic Tasks371

9.6 End-to-End Tasks in Heterogeneous Systems384

9.7 Predictability and Validation of Dynamic Multiprocessor Systems386

9.8 Summary387

10 SCHEDULING FLEXIBLE COMPUTATIONS AND TASKS WITH TEMPORAL DISTANCE CONSTRAINTS394

10.1 Flexible Applications395

10.2 Tasks with Temporal Distance Constraints411

10.3 Summary417

11 REAL-TIME COMMUNICATION420

11.1 Model of Real-Time Communication421

11.2 Priority-Based Service Disciplines for Switched Networks429

11.3 Weighted Round-Robin Service Disciplines445

11.4 Medium Access-Control Protocols of Broadcast Networks453

11.5 Internet and Resource Reservation Protocols469

11.6 Real-Time Protocol480

11.7 Communication in Multicomputer Systems485

11.8 Summary489

12 OPERATING SYSTEMS497

12.1 Overview498

12.2 Time Services and Scheduling Mechanisms507

12.3 Other Basic Operating System Functions523

12.4 Processor Reserves and Resource Kernel534

12.5 Open System Architecture538

12.6 Capabilities of Commercial Real-Time Operating Systems549

12.7 Predictability of General-Purpose Operating Systems556

12.8 Summary564

APPENDIX POSIX THREAD AND REAL-TIME EXTENSIONS571

BIBLIOGRAPHY577

INDEX589

热门推荐