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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The rate-monotonic scheduling algorithm is a static scheduling algorithm for periodic tasks, but the classic rate-monotonic… (More)
  • figure 1
Is this relevant?
2008
2008
In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical… (More)
  • figure 2
  • figure 3
  • figure 1
  • table 1
  • 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… (More)
Is this relevant?
2003
2003
In this paper, we extend Liu and Layland's utilization bound for fixed priority scheduling on uniprocessors to homogeneous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Due to the critical nature of the tasks in hard real-time systems, it is essential that faults be tolerated. In this paper, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • 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 Liu and Layland [LL73] for… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
1994
1994
In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider the… (More)
  • figure 1
  • figure 3
Is this relevant?
1993
1993
We present a systematic method that improves previous results to determine if a Real-Time Multiple Tasks-Single Processor or any… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
deadlines all of the time if the rate monotonic algorithm is used and the total utilization is not greater than .693. This paper… (More)
Is this relevant?