Rate-monotonic scheduling

Rate-monotonic scheduling

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class. The static priorities are assigned according to the cycle duration of the job, so a shorter cycle duration results in a higher job priority.

Excerpt from the Wikipedia article “Rate-monotonic scheduling”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Rate-monotonic scheduling to your collection.

Play for free

Related cards