diff options
| author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2017-01-31 12:59:08 +0100 |
|---|---|---|
| committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2017-01-31 14:30:09 +0100 |
| commit | 938c49e177875cafa7bc8220e6c0da4be90e5c3b (patch) | |
| tree | b615cfbe67522822c91f8429bd98929c499be719 /c-user/rate_monotonic_manager.rst | |
| parent | shell: Update task command (diff) | |
| download | rtems-docs-938c49e177875cafa7bc8220e6c0da4be90e5c3b.tar.bz2 | |
Fix refs.bib entry
Diffstat (limited to 'c-user/rate_monotonic_manager.rst')
| -rw-r--r-- | c-user/rate_monotonic_manager.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/c-user/rate_monotonic_manager.rst b/c-user/rate_monotonic_manager.rst index 181e0a8..05eb59f 100644 --- a/c-user/rate_monotonic_manager.rst +++ b/c-user/rate_monotonic_manager.rst @@ -173,7 +173,7 @@ Rate Monotonic Scheduling Algorithm The Rate Monotonic Scheduling Algorithm (RMS) is important to real-time systems designers because it allows one to sufficiently guarantee that a set of tasks is schedulable (see :cite:`Liu:1973:Scheduling`, :cite:`Lehoczky:1989:RM`, -:cite:`Lui:1990:Ada`, :cite:`Burns:1991:Review`). +:cite:`Sha:1990:Ada`, :cite:`Burns:1991:Review`). A set of tasks is said to be schedulable if all of the tasks can meet their deadlines. RMS provides a set of rules which can be used to perform |