Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The periodic task model. The periodic task abstraction models real-time processes that make repeated requests for computation. As… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Due to the critical nature of the tasks in hard real-time systems, it is essential that faults be tolerated. In this paper, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we extend Liu and Layland's utilization bound for fixed priority scheduling on uniprocessors to homogeneous… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks… Expand
Is this relevant?
2003
2003
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Feedback control systems wherein the control loops are closed through a real-time network are called networked control systems… Expand
  • figure 1
  • table 1
  • table 2
  • figure 4
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A… Expand
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Hard-real-time systems require predictable performance despite the occurrence of failures. In this paper, fault tolerance is… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Statistical rate monotonic scheduling (SRMS) is a generalization of the classical RMS results of C. Liu and J. Layland (1973) for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1989
Highly Cited
1989
An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set… Expand
Is this relevant?