diff options
| -rw-r--r-- | c-user/rate_monotonic_manager.rst | 2 | ||||
| -rw-r--r-- | common/refs.bib | 3 |
2 files changed, 3 insertions, 2 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 diff --git a/common/refs.bib b/common/refs.bib index 648560b..0f30cc1 100644 --- a/common/refs.bib +++ b/common/refs.bib @@ -1,4 +1,5 @@ % Use <AUTHOR>:<YEAR>:<TOPIC> for the reference labels. +% Use the surname of the main author for AUTHOR. % Sort lexicographically by (YEAR, AUTHOR, TOPIC). @article{Liu:1973:Scheduling, author = {Liu, C. L. and Layland, James W.}, @@ -29,7 +30,7 @@ year = {1990}, pages = {201-209}, } -@article{Lui:1990:Ada, +@article{Sha:1990:Ada, author = {Sha, Lui and Goodenough, J. B.}, journal = {Computer}, title = {{Real-time scheduling theory and Ada}}, |