# Rate-monotonic scheduling

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- International Conference on Computerâ€¦
- 2010

The rate-monotonic scheduling algorithm is a static scheduling algorithm for periodic tasks, but the classic rate-monotonicâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamicâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 11th IEEE Real Time and Embedded Technology andâ€¦
- 2005

We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identicalâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Computers
- 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

- Real-Time Systems
- 2003

In this paper, we extend Liu and Layland's utilization bound for fixed priority scheduling on uniprocessors to homogeneousâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Real-Time Systems
- 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)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- RTSS
- 1998

Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] forâ€¦Â (More)

Is this relevant?

1994

1994

- Real-Time Systems
- 1994

In this paper, we address the problem of supporting timeliness and dependability at the level of task scheduling. We consider theâ€¦Â (More)

Is this relevant?

1993

1993

- Inf. Process. Lett.
- 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

- RTSS
- 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?