实时系统（影印版） (2010 年度畅销榜NO.3320 )

20世纪末，以计算机和通信技术为代表的信息科学和技术对世界经济、科技、军事、教育和文化等产生了深刻影响。信息科学技术的迅速普及和应用，带动了世界范围信息产业的蓬勃发展，为许多国家带来了丰厚的回报。 \r\n 进入21世纪，尤其随着我国加入WTO，信息产业的国际竞争将更加激烈。我国信息产业虽然在20世纪末取得了迅猛发展，但与发达国家相比，甚至与印度、爱尔兰等国家相比，还有很大差距。国家信息化的发展速度和信息产业的国际竞争能力，最终都将取决于信息科学技术人才的质量和数量。引进国外信息科学和技术优秀教材，在有条件的学校推动开展英语授课或双语教学，是教育部为加快培养大批高质量的信息技术人才采取的一项重要举措。 \r\n 为此，教育部要求由高等教育出版社首先开展信息科学和技术教材的引进试点工作。同时提出了两点要求，一是要高水平，二是要低价格。在高等教育出版社和信息科学技术引进教材专家组的努力下，经过比较短的时间，第一批引进的20多种教材已经陆续出版。这套教材出版后受到了广泛的好评，其中有不少是世界信息科学技术领域著名专家、教授的经典之作和反映信息科学技术最新进展的优秀作品，代表了目前世界信息科学技术教育的一流水平，而且价格也是最优惠的，与国内同类自编教材相当。\r\n 这项教材引进工作是在教育部高等教育司和高教社的共同组织下，由国内信息科学技术领域的专家、教授广泛参与，在对大量国外教材进行多次遴选的基础上，参考了国内和国外著名大学相关专业的课程设置进行系统引进的。其中，John Wiley公司出版的贝尔实验室信息科学研究中心副总裁Silberchatz教授的经典著作《操作系统概念》，是我们经过反复谈判，做了很多努力才得以引进的。William Stallings先生曾编写了在美国深受欢迎的信息科学技术系列教材，其中有多种教材获得过美国教材和学术著作者协会颁发的计算机科学与工程教材奖，这批引进教材中就有他的两本著作。留美中国学者Jiawei Han先生的《数据挖掘》是该领域中具有里程碑意义的著作。由达特茅斯学院刀Thomas Cormen和麻省理工学院、哥伦比亚大学的几位学者共同编著的经典著作《算法导论》，在经历了11年的锤炼之后于2001年出版了第二版。目前任教于美国Massachusetts大学的James Kurose教授，曾在美国三所高校先后10次获得杰出教师或杰出教学奖，由他主编的《计算机网络》出版后，以其体系新颖、内容先进而倍受欢迎。在努力降低引进教材售价方面，高等教育出版社做了大量和细致的工作。这套引进的教材体现了权威性、系统性、先进性和经济性等特点。

PREFA CE\r\n\r\n1 TYPICAL REAL-TlME APPLICATJONS\r\n1.1 Digital Control\r\n1.2 High-Level Controls\r\n1.3 Signal Processing\r\n1.4 Other Real-Time Applications\r\n1.5 Summary\r\n\r\n2 HARD VERSUS SOFT REAL-TlME SYSTEMS\r\n2.1 Jobs and Processors\r\n2.2 Release Times, Deadlines, and Timing Constraints\r\n2.3 Hard and Soft Timing Constraints\r\n2.4 Hard Real-Time Systems\r\n2.5 Soft Real-Time Systems\r\n2.6 Summary\r\n\r\n3 A REFERENCE MODEL OF REAL-TIME SYSTEMS\r\n3.1 Processors and Resources\r\n3.2 Temporal Parameters of Real-Time Workload\r\n3.3 Periodic Task Model\r\n3.4 Precedence Constraints and Data Dependency\r\n3.5 Other Types of Dependencies\r\n3.6 Fanctional Parameters\r\n3.7 Resource Parameters of Jobs and Paramelers of Resources\r\n3.8 Sckeduling Hierarchy\r\n3.9 Summary\r\n\r\n4 COMMONLY USED APPROACHES TO REAL-TME SCHEDULIG\r\n4.1 Clock-Driven Approach\r\n4.2 Weighted Round-Robin Approach\r\n4.3 Priority-Driven Approach\r\n4.4 Dynamic versus Static Systems\r\n4.5 Effective Release Times and Deadlines\r\n4.6 Optimality of the EDF and LST Algorithms\r\n4.7 Nonoptimality of the EDF and the LST Algorithms\r\n4.8 Challenges in Validating Timing Constraints\r\nin Ptiority-Driven Systems\r\n4.9 Off-Line versus On-Line Scheduling\r\n4.10 Summry\r\n4.11 Exercises\r\n\r\n5 CLOCK-DRIVEN SCHEDULING\r\n5.1 Notations and Assumptions\r\n5.2 Static, Timer-Driven Scheduler\r\n5.3 General Structure of Cyclic Schedules\r\n5.4 Cyclic Executives\r\n5.5 Improving the Average Response Time of Aperiodic Jobs\r\n5.6 Scheduling Sporadic Jobs\r\n5.7 Practical Considerations and Generalizations\r\n5.8 Algorithm for Constructing Static Schedules\r\n5.9 Pros and Cons of Clock-Driven Scheduling\r\n5.10 Sammary\r\n\r\n6 PRIOROTY-DRIVEN SCHEDULING OF PERIODIC TASKS\r\n6.1 Static Assumption\r\n6.2 Fixed-Priority versus Dynamic-Ptiority Algorithms\r\n6.3 Maximum Schedulable Utilization\r\n6.4 Optimality of the RM and DM Algorithms\r\n6.5 A Schedulability Test for Fixed-Priority Tasks with Shon Response Times\r\n6.6 Schedulability Test for Fixed-hriority Tasks with Arbitrary Response Times\r\n6.7 Sufficient Schedulability Conditions for the RM and DM Algorthms\r\n6.8 Ptactical Factors\r\n6.9 Sammary\r\n\r\n7 SCHEDULING APERIODIC AND SPORADIC JOBS W PRIORITY-DRfVEN SYSTEMS\r\n7.1 Assumptions and Approaches\r\n7.2 Deferrable Servers\r\n7.3 Sporadic Servers\r\n7.4 Constant Utilization, Total Bandwidth, and Weighted Fair-Queueing Servers\r\n7.5 Slack Stealing in Deadline-Driven Systems\r\n7.6 Slack Stealing in Fixed-Priority Systems\r\n7.7 Scheduling of Sporadic Jobs\r\n7.8 Real-Time Performance for Jobs with Soft Timing Constraints\r\n7.9 A Two-Level Scheme for Integrated Scheduling\r\n7.10 Summary\r\n\r\n8 RESOURCES AND RESOURCE ACCESS CONTROL\r\n8.1 Assumptions on Resources and Their Usage\r\n8.2 Effects of Resource Contention aad Resource Access Control\r\n8.3 Nonpreemptive Critical Sections\r\n8.4 Basic Priority-Inheritance Protocol\r\n8.5 Basic Priority-Ceiling Protocol\r\n8.6 Stack-Based, Priority-Ceiling (Ceiling-Priority) Protocd\r\n8.7 Use of Priority-Ceiling Protocol in Dynamic-Priority Systems\r\n8.8 Preemption-Ceiling Protocol\r\n8.9 Controlling Accesses to Multiple-Unit Resources\r\n8.10 Controlling Concurrent Accesses to Data Objects\r\n8.11 Summary\r\n\r\n9 MU TIPROCESSOR SCHEDULING, RESOURCE ACCESS CONTROL,AND SYNCHRONIZATION\r\n9.1 Model of Multiprocessor and Distributed Systems\r\n9.2 Task Assignment\r\n9.3 Multiprocessor Priority-Ceiling Protocol\r\n9.4 Elements of Scheduling Algorithms for End-to-End Periodic Tasks\r\n9.5 Schedulability of Fixed-Priority End-to-End Periodic Tasks\r\n9.6 End-to-End Tasks in Heterogeneous Systems\r\n9.7 Predictability and Validation of Dynamic Multiprocessor Systems\r\n9.8 Summary\r\n\r\n10 SCHEDULING FLEXIBLE COMPPUTATIONS AND TASKS WITH TEMPORAL DISTANCE CONSTRAINTS\r\n10.1 Flexible Applications\r\n10.2 Tasks with Temporal Distance Constraints\r\n10.3 Summary\r\n\r\n11 REAL-TlME COMMUNICAION\r\n11.1 Model of Real-Time Communication\r\n11.2 Priority-Based Service Disciplines for Switched Networks\r\n11.3 Weighted Round-Robin Service Disciplines\r\n11.4 Medium Access-Control Protocols of Broadcast Networks\r\n11.5 Internet and Resource Reservation Protocols\r\n11.6 Real-Time Protocol\r\n11.7 Communication in Multicomputer Systems\r\n11.8 Summary\r\n\r\n12 OPERATING SYSTENIS\r\n12.1 Overiew\r\n12.2 Time Services and Scheduling Mechanisms\r\n12.3 Other Basic Operating System Functions\r\n12.4 Processor Reserves and Resource Kernel\r\n12.5 Open System Architecture\r\n12.6 Capabilities of Commercial Real-Time Operating Systems\r\n12.7 Predictability of Ceneral-Purpose Operating Systems\r\n12.8 Summary\r\n\r\nAPPENDIX POSIX THREAD AND REAL-TIME EXTENSIONS\r\n\r\nBIBLIOGRAPHY\r\n\r\nINDEX\r\n