Abstract
The rate monotonic scheduling (RMS) theory in an analytical approach that solves the most fundamental problems in constructing real-time software: providing predictable real-time response in the face of a high processing load while still supporting modern development methodologies and ease of maintenance after product delivery. Additionally, when all time constraints cannot be met, the system must be able to shed load in a predictable manner. RMS theory assigns priorities to tasks based on their periodicity. Tasks with shorter periods receive the higher priorities. Using this analytical approach provides the predictability required of real-time systems while still supporting modern design techniques. Theorems for the RMS methodology are used to predict system behavior. There are three principal theorems used in RMS to determine the schedulability of a specified task set. A brief overview of the three RMS theorems is presented. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
