From 938c49e177875cafa7bc8220e6c0da4be90e5c3b Mon Sep 17 00:00:00 2001 From: Sebastian Huber Date: Tue, 31 Jan 2017 12:59:08 +0100 Subject: Fix refs.bib entry --- c-user/rate_monotonic_manager.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'c-user/rate_monotonic_manager.rst') 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 -- cgit v1.2.3