Skip to search formSkip to main contentSkip to account menu

Rate-monotonic scheduling

Known as: RMS, Rate Monotonic Scheduling 
In computer science, rate-monotonic scheduling (RMS) is a scheduling algorithm used in real-time operating systems (RTOS) with a static-priority… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
This paper presents a family of Rate-Harmonized Schedulers that can be used in reservation-based operating systems to naturally… 
2009
2009
Consider a distributed computer system comprising many computer nodes, each interconnected with a Controller Area Network (CAN… 
2008
2008
In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic… 
Highly Cited
2004
Highly Cited
2004
The utilization bound for real-time rate monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with… 
2002
2002
Fault-tolerant real-time scheduling is a hot topic in dependable real-time system research. We combine the FT-RM with imprecise… 
2002
2002
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task… 
2001
2001
We investigate a learning algorithm for the classification of nonnegative data by mixture models. Multiplicative update rules are… 
1998
1998
Abstract The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS… 
1997
1997
  • P. Binns
  • 1997
  • Corpus ID: 36718497
The paper presents an algorithm and its run-time performance for scheduling periodic incremental and design-to-time processes… 
1994
1994
In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider the…