MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

Real-time systems / C.M. Krishna and Kang G. Shin.

By: Krishna, C. M.
Contributor(s): Shin, Kang G.
Material type: materialTypeLabelBookSeries: McGraw-Hill series in computer science.McGraw-Hill series in electrical and computer engineeringComputer engineering: Publisher: New York : McGraw-Hill, c1997Description: xvi, 448 p. : ill. ; 24 cm. + hbk.ISBN: 0070570434 .Subject(s): Real-time data processing | Real-time controlDDC classification: 004.33
Contents:
Introduction -- Characterizing real-time systems and tasks -- Task assignment and scheduling -- Programing languages and tools Real-time databases -- Real-time communication -- Fault-Tolerence Techniques -- Reliability evaluation techniques -- Clock synchronization.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Lending 004.33 (Browse shelf(Opens below)) 1 Available 00160641
General Lending MTU Bishopstown Library Store Item 004.33 (Browse shelf(Opens below)) 1 Available 00155276
General Lending MTU Bishopstown Library Lending 004.33 (Browse shelf(Opens below)) 1 Available 00015542
Total holds: 0

Enhanced descriptions from Syndetics:

This work covers all the major issues that go into designing a real-time system, including task allocation, synchronization, fault-tolerance and reliability. Also included are exercises, performance measures, scheduling, real-time architectures and algorithms.

Includes bibliographical references and index.

Introduction -- Characterizing real-time systems and tasks -- Task assignment and scheduling -- Programing languages and tools Real-time databases -- Real-time communication -- Fault-Tolerence Techniques -- Reliability evaluation techniques -- Clock synchronization.

Table of contents provided by Syndetics

  • Preface (p. xv)
  • 1 Introduction (p. 1)
  • 1.1 A Car-and-Driver Example (p. 3)
  • 1.2 Issues in Real-Time Computing (p. 4)
  • 1.3 Structure of a Real-Time System (p. 7)
  • 1.4 Task Classes (p. 9)
  • 1.5 Issues Covered in this Book (p. 9)
  • 1.5.1 Architecture Issues (p. 9)
  • 1.5.2 Operating System Issues (p. 10)
  • 1.5.3 Other Issues (p. 10)
  • 2 Characterizing Real-Time Systems and Tasks (p. 12)
  • 2.1 Introduction (p. 12)
  • 2.2 Performance Measures for Real-Time Systems (p. 13)
  • 2.2.1 Properties of Performance Measures (p. 15)
  • 2.2.2 Traditional Performance Measures (p. 17)
  • 2.2.3 Performability (p. 19)
  • 2.2.4 Cost Functions and Hard Deadlines (p. 23)
  • 2.2.5 Discussion (p. 25)
  • 2.3 Estimating Program Run Times (p. 25)
  • 2.3.1 Analysis of Source Code (p. 26)
  • 2.3.2 Accounting for Pipelining (p. 29)
  • 2.3.3 Caches (p. 35)
  • 2.3.4 Virtual Memory (p. 37)
  • 2.4 Suggestions For Further Reading (p. 37)
  • Exercises (p. 37)
  • References (p. 38)
  • 3 Task Assignment and Scheduling (p. 40)
  • 3.1 Introduction (p. 40)
  • 3.1.1 How to Read This Chapter (p. 44)
  • 3.1.2 Notation (p. 47)
  • 3.2 Classical Uniprocessor Scheduling Algorithms (p. 47)
  • 3.2.1 Rate-Monotonic Scheduling Algorithm (p. 48)
  • 3.2.2 Preemptive Earliest Deadline First (EDF) Algorithm (p. 73)
  • 3.2.3 Allowing for Precedence and Exclusion Conditions* (p. 80)
  • 3.2.4 Using Primary and Alternative Tasks (p. 92)
  • 3.3 Uniprocessor Scheduling of IRIS Tasks (p. 96)
  • 3.3.1 Identical Linear Reward Functions (p. 98)
  • 3.3.2 Nonidentical Linear Reward Functions (p. 101)
  • 3.3.3 0/1 Reward Functions (p. 102)
  • 3.3.4 Identical Concave Reward Functions (No Mandatory Portions) (p. 103)
  • 3.3.5 Nonidentical Concave Reward Functions* (p. 106)
  • 3.4 Task Assignment (p. 111)
  • 3.4.1 Utilization-Balancing Algorithm (p. 111)
  • 3.4.2 A Next-Fit Algorithm for RM Scheduling (p. 112)
  • 3.4.3 A Bin-Packing Assignment Algorithm for EDF (p. 113)
  • 3.4.4 A Myopic Offline Scheduling (MOS) Algorithm (p. 115)
  • 3.4.5 Focused Addressing and Bidding (FAB) Algorithm (p. 117)
  • 3.4.6 The Buddy Strategy (p. 121)
  • 3.4.7 Assignment with Precedence Conditions (p. 124)
  • 3.5 Mode Changes (p. 128)
  • 3.6 Fault-Tolerant Scheduling (p. 130)
  • 3.7 Suggestions for Further Reading (p. 135)
  • Exercises (p. 135)
  • References (p. 136)
  • 4 Programming Languages and Tools (p. 138)
  • 4.1 Introduction (p. 138)
  • 4.2 Desired Language Characteristics (p. 139)
  • 4.3 Data Typing (p. 143)
  • 4.4 Control Structures (p. 147)
  • 4.5 Facilitating Hierarchical Decomposition (p. 149)
  • 4.5.1 Blocks (p. 149)
  • 4.5.2 Procedures and Functions (p. 150)
  • 4.6 Packages (p. 150)
  • 4.7 Run-Time Error (Exception) Handling (p. 155)
  • 4.8 Overloading and Generics (p. 159)
  • 4.9 Multitasking (p. 160)
  • 4.10 Low-Level Programming (p. 168)
  • 4.11 Task Scheduling (p. 169)
  • 4.11.1 Task Dispatching Policy (p. 170)
  • 4.11.2 Entry Queueing Policy (p. 171)
  • 4.11.3 Protected Data Types (p. 171)
  • 4.12 Timing Specifications (p. 172)
  • 4.13 Some Experimental Languages (p. 173)
  • 4.13.1 Flex (p. 173)
  • 4.13.2 Euclid (p. 175)
  • 4.14 Programming Environments (p. 176)
  • 4.15 Run-Time Support (p. 181)
  • 4.15.1 Compiler (p. 182)
  • 4.15.2 Linker (p. 182)
  • 4.15.3 Debugger (p. 182)
  • 4.15.4 Kernel (p. 182)
  • 4.16 Suggestions for Further Reading (p. 183)
  • Exercises (p. 183)
  • References (p. 184)
  • 5 Real-Time Databases (p. 185)
  • 5.1 Introduction (p. 185)
  • 5.2 Basic Definitions (p. 186)
  • 5.3 Real-Time vs. General-Purpose Databases (p. 187)
  • 5.3.1 Absolute vs. Relative Consistency (p. 187)
  • 5.3.2 Need for Response-Time Predictability (p. 189)
  • 5.3.3 Relaxing the ACID Properties (p. 190)
  • 5.4 Main Memory Databases (p. 191)
  • 5.5 Transaction Priorities (p. 194)
  • 5.6 Transaction Aborts (p. 198)
  • 5.7 Concurrency Control Issues (p. 198)
  • 5.7.1 Pessimistic Concurrency Control (p. 198)
  • 5.7.2 Optimistic Concurrency Control (p. 201)
  • 5.8 Disk Scheduling Algorithms (p. 204)
  • 5.9 A Two-Phase Approach to Improve Predictability (p. 208)
  • 5.10 Maintaining Serialization Consistency (p. 211)
  • 5.10.1 Serialization Consistency without Alteration of Serialization Order (p. 211)
  • 5.10.2 Serialization Consistency with Alteration of Serialization Order (p. 212)
  • 5.11 Databases for Hard Real-Time Systems (p. 216)
  • 5.12 Suggestions for Further Reading (p. 220)
  • Exercises (p. 220)
  • References (p. 221)
  • 6 Real-Time Communication (p. 223)
  • 6.1 Introduction (p. 223)
  • 6.1.1 Communications Media (p. 225)
  • 6.2 Network Topologies (p. 228)
  • 6.2.1 Sending Messages (p. 232)
  • 6.2.2 Network Architecture Issues (p. 235)
  • 6.3 Protocols (p. 238)
  • 6.3.1 Contention-Based Protocols (p. 238)
  • 6.3.2 Token-based Protocols (p. 251)
  • 6.3.3 Stop-and-Go Multihop Protocol (p. 265)
  • 6.3.4 The Polled Bus Protocol (p. 267)
  • 6.3.5 Hierarchical Round-Robin Protocol (p. 269)
  • 6.3.6 Deadline-Based Protocols (p. 271)
  • 6.3.7 Fault-Tolerant Routing (p. 275)
  • 6.4 Suggestions for Further Reading (p. 276)
  • Exercises (p. 276)
  • References (p. 278)
  • 7 Fault-Tolerance Techniques (p. 280)
  • 7.1 Introduction (p. 280)
  • 7.1.1 Definitions (p. 282)
  • 7.2 What Causes Failures? (p. 283)
  • 7.3 Fault Types (p. 285)
  • 7.3.1 Temporal Behavior Classification (p. 285)
  • 7.3.2 Output Behavior Classification (p. 286)
  • 7.3.3 Independence and Correlation (p. 287)
  • 7.4 Fault Detection (p. 288)
  • 7.5 Fault and Error Containment (p. 288)
  • 7.6 Redundancy (p. 289)
  • 7.6.1 Hardware Redundancy (p. 290)
  • 7.6.2 Software Redundancy (p. 300)
  • 7.6.3 Time Redundancy--Implementing Backward Error Recovery (p. 306)
  • 7.6.4 Information Redundancy (p. 310)
  • 7.7 Data Diversity (p. 315)
  • 7.8 Reversal Checks (p. 316)
  • 7.9 Malicious or Byzantine Failures* (p. 316)
  • 7.10 Integrated Failure Handling (p. 322)
  • 7.11 Suggestions for Further Reading (p. 323)
  • Exercises (p. 324)
  • References (p. 325)
  • 8 Reliability Evaluation Techniques (p. 327)
  • 8.1 Introduction (p. 327)
  • 8.2 Obtaining Parameter Values (p. 328)
  • 8.2.1 Obtaining Device-Failure Rates (p. 328)
  • 8.2.2 Measuring Error-Propagation Time (p. 328)
  • 8.2.3 Choosing the Best Distribution* (p. 330)
  • 8.3 Reliability Models for Hardware Redundancy (p. 331)
  • 8.3.1 Permanent Faults Only (p. 333)
  • 8.3.2 Fault Latency* (p. 339)
  • 8.3.3 Introduction of Transient Faults (p. 346)
  • 8.3.4 The Use of State Aggregation* (p. 348)
  • 8.4 Software-Error Models (p. 349)
  • 8.4.1 The Limited Usefulness of Software-Error Models (p. 353)
  • 8.5 Taking Time into Account (p. 355)
  • 8.6 Suggestions for Further Reading (p. 358)
  • Exercises (p. 358)
  • References (p. 359)
  • 9 Clock Synchronization (p. 361)
  • 9.1 Introduction (p. 361)
  • 9.2 Clocks (p. 361)
  • 9.2.1 Synchronization (p. 364)
  • 9.3 A Nonfault-Tolerant Synchronization Algorithm (p. 365)
  • 9.4 Impact of Faults (p. 369)
  • 9.4.1 Loss of Synchrony (p. 370)
  • 9.5 Fault-Tolerant Synchronization in Hardware (p. 371)
  • 9.5.1 Completely Connected, Zero-Propagation-Time System (p. 373)
  • 9.5.2 Sparse-Interconnection, Zero-Propagation-Time System (p. 378)
  • 9.5.3 Accounting for Signal-Propagation Delays (p. 384)
  • 9.5.4 Multiple-Fault Classes (p. 386)
  • 9.5.5 Advantages and Disadvantages of Hardware Synchronization (p. 387)
  • 9.6 Synchronization in Software (p. 387)
  • 9.6.1 Interactive Convergence Averaging Algorithm, CA1 (p. 388)
  • 9.6.2 Interactive Convergence Averaging Algorithm, CA2 (p. 394)
  • 9.6.3 Convergence Nonaveraging Algorithm, CNA (p. 397)
  • 9.7 Suggestions for Further Reading (p. 401)
  • Exercises (p. 402)
  • References (p. 403)
  • Appendix Review of Modeling Techniques (p. 404)
  • A.1 Review of Basic Probability Theory (p. 404)
  • A.2 Z-Transforms and Laplace Transforms (p. 407)
  • A.3 Some Important Probability Distribution Functions (p. 410)
  • A.3.1 The Uniform Distribution Functions (p. 410)
  • A.3.2 The Exponential Distribution Functions (p. 410)
  • A.3.3 The Poisson Process (p. 412)
  • A.3.4 The Erlangian Distribution (p. 415)
  • A.3.5 The Weibull Distribution Functions (p. 416)
  • A.4 Basics of Markov Modeling (p. 417)
  • A.4.1 Discrete-Time Markov Chains (p. 420)
  • A.4.2 Continuous-Time Markov Chains (p. 425)
  • A.4.3 Some Additional Remarks about Markov Chains (p. 430)
  • A.4.4 The Method of Stages (p. 438)
  • A.5 A Brief Glimpse of Queueing Theory (p. 439)
  • A.6 Suggestions For Further Reading (p. 442)
  • References (p. 443)
  • Index (p. 445)

Powered by Koha