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)

Related topics

Related topics

23 relations
Busy waitingCentral processing unitComputer hardwareComputer science

Broader (1)

Real-time computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The utilization bound of non-preemptive rate-monotonic scheduling in Controller Area Networks is 25%
Consider a distributed computer system comprising many computer nodes, each interconnected with a Controller Area Network (CAN… 
2008
2008
Global Rate-Monotonic Scheduling with Priority Promotion
In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic… 
2005
2005
On schedulability bounds of static priority schedulers
While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For… 
Highly Cited
2004
Highly Cited
2004
Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling
The utilization bound for real-time rate monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with… 
2002
2002
Imprecise computation fault-tolerant rate-monotonic scheduling
Fault-tolerant real-time scheduling is a hot topic in dependable real-time system research. We combine the FT-RM with imprecise… 
2002
2002
The aperiodic multiprocessor utilization bound for liquid tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task… 
1998
1998
The Statistical Rate Monotonic Scheduling Workbench
Abstract The SRMS Workbench is a software system developed to demonstrate the notion of Statistical QoS employed in SRMS… 
1997
1997
Incremental rate monotonic scheduling for improved control system performance
  • P. Binns
  • Proceedings Third IEEE Real-Time Technology and…
  • 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
Enhancing fault-tolerance in rate-monotonic scheduling
In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider the… 
1994
1994
Using rate monotonic scheduling technology for real-time communications in a wormhole network
  • M. Mutka
  • Second Workshop on Parallel and Distributed Real…
  • 1994
  • Corpus ID: 61444600
The demand for systems with predictable communication delays is growing as the number of applications for real-time systems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)