Cycle Time Properties Of The FDDI Token Ring Protocol
IEEE Transactions on Software Engineering
Real-time computing systems: the next generation
Tutorial: hard real-time systems
Real-Time Scheduling Theory and Ada
Computer
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Foundations of Real-Time Computing: Scheduling and Resource Management
Foundations of Real-Time Computing: Scheduling and Resource Management
Real-Time Computing with IEEE Futurebus+
IEEE Micro
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
IEEE Transactions on Computers
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Scheduling Algorithms for Real-Time Agent Systems
RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
Toward Automatic Synthesis of Schedulable Real-Time Controllers
Integrated Computer-Aided Engineering
Janus: a cross-layer soft real-time architecture for virtualization
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
| Hi-index | 4.10 |
The authors describe the use of generalized rate monotonic scheduling (GRMS) theory for the design and analysis of a distributed real-time system. This theory ensures that as long as the system utilization of all tasks lies below a certain bound, and appropriate scheduling algorithms are used, all tasks will meet their deadlines. This puts the development and maintenance of real-time systems on an analytic, engineering basis making, these systems easier to develop and maintain. The authors review the recent extensions of the theory to distributed systems scheduling and examine the architectural requirements for use of the theory. They provide an application example to demonstrate the benefits of this theory.