Resource Management in Real-Time Systems and Networks

by Murthy, Manimaran

ISBN: 9780262292207 | Copyright 2000

Click here to preview

Instructor Requests

Digital Exam/Desk Copy Print Desk Copy Ancillaries
Tabs
Expand/Collapse All
Contents (pg. vii)
Preface (pg. xi)
1 Introduction (pg. 1)
1.1 Real-Time Systems (pg. 1)
1.2 Multidimensional View of Real-Time Systems (pg. 3)
1.3 Computing Systems and Communication Networks (pg. 8)
1.4 Issues in Real-Time Systems (pg. 10)
1.5 Summary (pg. 18)
References (pg. 18)
2 Task Scheduling in Multiprocessor Real-Time Systems (pg. 21)
2.1 Introduction (pg. 21)
2.2 A Summary of Task-Scheduling Results for Multiprocessor Systems (pg. 22)
2.3 Priority-Driven Preemptive Scheduling Approach (pg. 27)
2.4 Static Table-Driven Scheduling Approach (pg. 36)
2.5 Dynamic Planning-Based Scheduling Approach (pg. 39)
2.6 Dynamic Best-Effort Scheduling Approach (pg. 53)
2.7 Integrated Scheduling of Hard and Quality of Serviceā€“Degradable Tasks (pg. 55)
2.8 Real-Time Scheduling with Feedback Control (pg. 59)
2.9 Summary (pg. 61)
Exercises (pg. 62)
References (pg. 64)
3 Resource Reclaiming in Multiprocessor Real-Time Systems (pg. 67)
3.1 Scheduler Model (pg. 67)
3.2 Motivations for Resource Reclaiming (pg. 69)
3.3 Properties of Resource Reclaiming Algorithms (pg. 70)
3.4 Task Model (pg. 71)
3.5 Resource Reclaiming Algorithms (pg. 72)
3.6 Resource Reclaiming from Resource-Constrained Tasks (pg. 76)
3.7 Resource Reclaiming from Resource- and Precedence-Constrained Tasks (pg. 79)
3.8 Experimental Evaluation of Resource Reclaiming Algorithms (pg. 85)
3.9 Summary (pg. 92)
Exercises (pg. 93)
References (pg. 95)
4 Fault-Tolerant Task Scheduling in Multiprocessor Real-Time Systems (pg. 97)
4.1 Introduction (pg. 97)
4.2 Fault Classifications (pg. 99)
4.3 Fault Tolerance in Real-Time Systems (pg. 100)
4.4 Fault-Tolerant Scheduling Algorithms for Multiprocessor Real-Time Systems (pg. 105)
4.5 Real-Time Task Scheduling with Recovery Block Fault Tolerance (pg. 107)
4.6 Scheduling of Real-Time Imprecise Computations (pg. 115)
4.7 Other Work on Fault-Tolerant Scheduling of Real-Time Tasks (pg. 121)
4.8 Summary (pg. 126)
Exercises (pg. 128)
References (pg. 130)
5 Resource Management in Distributed Real-Time Systems (pg. 133)
5.1 Introduction (pg. 133)
5.2 Scheduling in Distributed Real-Time Systems (pg. 134)
5.3 Global Scheduling (pg. 138)
5.4 Work on Global Scheduling (pg. 140)
5.5 An Integrated Approach to Distributed Real-Time Scheduling (pg. 144)
5.6 Summary (pg. 162)
Exercises (pg. 163)
References (pg. 163)
6 Scheduling of Object-Based Tasks in Distributed Real-Time Systems (pg. 165)
6.1 Introduction (pg. 165)
6.2 Programming Model (pg. 166)
6.3 Scheduling Model (pg. 171)
6.4 Concurrency Model (pg. 172)
6.5 Example Application: Mine Pump (pg. 175)
6.6 A Scheduling Algorithm for Object-Based Periodic Tasks in Distributed Real-Time Systems (pg. 178)
6.7 Scheduling the Mine Pump Application (pg. 187)
6.8 The Dynamic Path-Based Paradigm (pg. 192)
6.9 Summary (pg. 197)
Exercises (pg. 198)
References (pg. 200)
7 Real-Time Communication in Wide Area Networks (pg. 201)
7.1 Introduction (pg. 201)
7.2 Service and Traffic Models and Performance Requirements (pg. 202)
7.3 Resource Management (pg. 205)
7.4 Switching Subsystem (pg. 218)
7.5 Packet Service Disciplines (pg. 226)
7.6 Summary (pg. 234)
Exercises (pg. 235)
References (pg. 237)
8 Route Selection in Real-Time Wide Area Networks (pg. 239)
8.1 Basic Routing Algorithms (pg. 239)
8.2 Routing during Real-Time Channel Establishment (pg. 242)
8.3 Route Selection Approaches (pg. 244)
8.4 Simulation Studies (pg. 255)
8.5 Distributed Delay-Constrained Routing Algorithms (pg. 265)
8.6 Dependable Real-Time Channels (pg. 275)
8.7 Detection and Recovery Approaches (pg. 278)
8.8 Work on Establishing Dependable Real-Time Channels (pg. 280)
8.9 Summary (pg. 286)
Exercises (pg. 287)
References (pg. 290)
9 Multicasting in Real-Time Networks (pg. 293)
9.1 Introduction (pg. 293)
9.2 An Architectural Framework for Multicast Communication (pg. 297)
9.3 Group Addressing (pg. 300)
9.4 Multicast Routing (pg. 304)
9.5 Resource Reservation (pg. 321)
9.6 Multicast Traffic Control (pg. 323)
9.7 Multicasting in the Internet (pg. 331)
9.8 Summary (pg. 342)
Exercises (pg. 343)
References (pg. 344)
10 Real-Time Communication in Multiple Access Networks (pg. 347)
10.1 Introduction (pg. 347)
10.2 Real-Time MAC Protocols: Issues and Strategies (pg. 350)
10.3 Real-Time LAN Protocols (pg. 355)
10.4 DCR-Based Protocols for Multipacket Messages (pg. 371)
10.5 Real-Time Communication with Periodic and Aperiodic Messages (pg. 378)
10.6 Fiber-Distributed Data Interface (pg. 387)
10.7 Real-Time Switched LAN (pg. 390)
10.8 Summary (pg. 399)
Exercises (pg. 400)
References (pg. 402)
11 Case Study: Distributed Air Defense System (pg. 405)
11.1 Problem Specification (pg. 405)
11.2 Solution (pg. 408)
11.3 System Model (pg. 408)
11.4 System Design Aspects (pg. 412)
11.5 Summary (pg. 419)
References (pg. 420)
12 Case Study: Air Traffic Control System (pg. 421)
12.1 Problem Specification (pg. 421)
12.2 Solution (pg. 424)
12.3 System Model (pg. 425)
12.4 System Representation Using Dynamic Paths (pg. 431)
12.5 System Design Aspects (pg. 437)
12.6 Resource Management (pg. 442)
12.7 Summary (pg. 442)
References (pg. 443)
Acronyms (pg. 445)
Index (pg. 447)

Chebiyyam S. Murthy

Chebiyyam Sivaram Murthy


Govindarasu Manimaran

Dr. Manimaran Govindarasu is currently a Professor in the Dept. of Electrical and Computer Engineering at Iowa State University (ISU).Ā 


Instructors Only
You must have an instructor account and submit a request to access instructor materials for this book.
eTextbook
Go paperless today! Available online anytime, nothing to download or install.

Features

  • Highlighting
  • Bookmarking
  • Note-taking