mirror of
https://git.rtems.org/rtems-docs/
synced 2025-05-17 04:51:40 +08:00
Fix refs.bib entry
This commit is contained in:
parent
e6cb6b7906
commit
938c49e177
@ -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
|
||||
|
@ -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}},
|
||||
|
Loading…
x
Reference in New Issue
Block a user