Innovative Integration
Innovative Integration provides board-level hardware products that integrate the best analog I/O and reconfigurable FPGAs to provide cost-effective solutions for challenging data acquisition and signal processing applications.

e-clips news alerts by keyword

overview    

Introduction to Rate Monotonic Scheduling
The purpose of a real-time scheduling algorithm is to ensure that critical timing constraints, such as deadlines and response time, are met. When necessary, decisions are made that favor the most critical timing constraints, even at the cost of violating others. Real-time scheduling is also used to allocate processor time between tasks in soft real-time embedded systems.
preview: http://www.netrino.com   |

overview    

Rate-monotonic scheduling @ Wikipedia
In computer science, rate-monotonic scheduling [1] is a scheduling algorithm used in real-time operating systems with a static-priority scheduling class. These operating systems are generally preemptive and have deterministic guarantees with regard to response times. Rate monotonic analysis is used in conjunction with those systems to provide scheduling guarantees for a particular application.
preview: http://en.wikipedia.org   |

overview    

RMA Backgrounder
To build real-time systems that are reliable and deterministic, the timing behavior of the tasks in a program must be predictable. Rate Monotonic Analysis (RMA) is a model for predicting, a priori, whether or not a system will meet its timing, as well as throughput requirements, when the system is operational.
preview: http://tripac.com   |

overview    

Tri-Pacific Software: RMA Backgrounder
With RAPID RMA (formerly PERTS) users can study the effects and relationships of various parameters in the system that directly affect the schedulability of the entire task set. If the system is predictable, it can be formally analyzed (See Figure 1). RMA allows a user to determine ahead of time whether the system will meet its timing requirements.
preview: http://www.tripac.com   |

paper    

Rate Monotonic Analysis (RMA) Overview
Rate Monotonic Analysis (RMA) is a collection of quantitative methods and algorithms that allows engineers to specify, understand, analyze, and predict the timing behavior of real-time software systems, thus improving their dependability and evolvability. RMA grew out of the theory of fixed priority scheduling. A theoretical treatment of the problem of scheduling periodic tasks was first discussed by Serlin in 1972 [Serlin 72] and then...
preview: http://www.gtbkiet.org   |

paper    

Rate Monotonic Analysis - Overview
Since its conception in 1973, rate monotonic theory has made a significant contribution to real-time applications programming. Using rate monotonic theory, a given task set may be analyzed to determine which tasks in the task set will meet their deadlines.
preview: http://www.heidmann.com   |

paper    

Rate-Monotonic Analysis in the C++ Type System
We describe an implementation of Rate-Monotonic Analysis (RMA) within the C++ parametric type system that provides C++ real-time software developers a good way to reason with types at the source level about recurrent tasks and deadlines. Using our approach, a program can be considered incorrect, raising type errors at compile time, if a given set of tasks is not statically schedulable.
preview: http://www.cse.wustl.edu   |