-
1
-
-
0029267687
-
Fixed priority pre-emptive scheduling: A historical perspective
-
N.C. Audsley, A. Burns, R.I. Davis, K.W. Tindell, and A.J. Wellings, "Fixed Priority Pre-Emptive Scheduling: A Historical Perspective," Real-Time Systems, vol. 8, pp. 173-198, 1995.
-
(1995)
Real-Time Systems
, vol.8
, pp. 173-198
-
-
Audsley, N.C.1
Burns, A.2
Davis, R.I.3
Tindell, K.W.4
Wellings, A.J.5
-
2
-
-
0000703331
-
Applying new scheduling theory to static priority preemptive scheduling
-
N.C. Audsley, A. Burns, M. Richardson, K.W. Tindell, and A.J. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Eng. J., vol. 8, no. 5, pp. 285-292, 1993.
-
(1993)
Software Eng. J.
, vol.8
, Issue.5
, pp. 285-292
-
-
Audsley, N.C.1
Burns, A.2
Richardson, M.3
Tindell, K.W.4
Wellings, A.J.5
-
3
-
-
84869593060
-
Assigning real-time tasks to homogeneous multiprocessor systems
-
Dec.
-
A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, "Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems," IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995.
-
(1995)
IEEE Trans. Computers
, vol.44
, Issue.12
, pp. 1429-1442
-
-
Burchard, A.1
Liebeherr, J.2
Oh, Y.3
Son, S.H.4
-
4
-
-
84884366383
-
Effective analysis for engineering real-time fixed priority schedulers
-
May
-
A. Burns, K. Tindell, and A. Wellings, "Effective Analysis for Engineering Real-Time Fixed Priority Schedulers," IEEE Trans. Software Eng., vol. 21, no. 5, pp. 475-480, May 1995.
-
(1995)
IEEE Trans. Software Eng.
, vol.21
, Issue.5
, pp. 475-480
-
-
Burns, A.1
Tindell, K.2
Wellings, A.3
-
7
-
-
0033890026
-
Liu and layland's schedulability test revisited
-
Mar.
-
R. Devillers and J. Goossens, "Liu and Layland's Schedulability Test Revisited," Information Processing Letters, vol. 73, nos. 5-6, pp. 157-161, Mar. 2000.
-
(2000)
Information Processing Letters
, vol.73
, Issue.5-6
, pp. 157-161
-
-
Devillers, R.1
Goossens, J.2
-
8
-
-
0032299764
-
A better polynomial-time scheduleability test for real-time multiframe tasks
-
Dec.
-
C.-C. Han, "A Better Polynomial-Time Scheduleability Test for Real-Time Multiframe Tasks," Proc. IEEE Real-Time Systems Symp., Dec. 1998.
-
(1998)
Proc. IEEE Real-Time Systems Symp.
-
-
Han, C.-C.1
-
9
-
-
0031367385
-
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
-
Dec.
-
C.-C. Han, H.y. Tyan, "A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms," Proc. IEEE Real-Time Systems Symp., pp. 36-45, Dec. 1997.
-
(1997)
Proc. IEEE Real-Time Systems Symp.
, pp. 36-45
-
-
Han, C.-C.1
Tyan, H.Y.2
-
10
-
-
0022796618
-
Finding response times in a real-time system
-
Oct.
-
M. Joseph and P. Pandya, "Finding Response Times in a Real-Time System," The Computer J., vol. 29, no. 5, pp. 390-395, Oct. 1986.
-
(1986)
The Computer J.
, vol.29
, Issue.5
, pp. 390-395
-
-
Joseph, M.1
Pandya, P.2
-
11
-
-
0004147882
-
-
Boston: Kluwer Academic
-
M. Klein, T. Ralya, B. Pollak, R. Obenza, and M.G. Harbour, A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Boston: Kluwer Academic, 1993.
-
(1993)
A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems
-
-
Klein, M.1
Ralya, T.2
Pollak, B.3
Obenza, R.4
Harbour, M.G.5
-
13
-
-
0031674668
-
An efficient RMS admission control and its application to multiprocessor scheduling
-
S. Lauzac, R. Melhem, and D. Mosse, "An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling," Proc. Int'l Parallel Processing Symp., pp. 511-518, 1998.
-
(1998)
Proc. Int'l Parallel Processing Symp.
, pp. 511-518
-
-
Lauzac, S.1
Melhem, R.2
Mosse, D.3
-
14
-
-
84880911285
-
Fixed priority scheduling of periodic task sets with arbitrary deadlines
-
Dec.
-
J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines," Proc. IEEE Real-Time Systems Symp., Dec. 1990.
-
(1990)
Proc. IEEE Real-Time Systems Symp.
-
-
Lehoczky, J.P.1
-
15
-
-
0020271514
-
On the complexity of fixed-priority scheduling of periodic, real-time tasks
-
J.Y.-T. Leung and J. Whitehead, "On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks," Performance Evaluation, vol. 2, pp. 237-250, 1982.
-
(1982)
Performance Evaluation
, vol.2
, pp. 237-250
-
-
Leung, J.Y.-T.1
Whitehead, J.2
-
16
-
-
84974687699
-
Scheduling algorithms for multi-programming in a hard-real-time environment
-
Jan.
-
C.L. Liu and J.W. Layland, "Scheduling Algorithms for Multi-programming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, Jan. 1973.
-
(1973)
J. ACM
, vol.20
, Issue.1
-
-
Liu, C.L.1
Layland, J.W.2
-
19
-
-
0029484287
-
A generalized utilization bound test for fixed-priority real-time scheduling
-
D.-W. Park, S. Natarajan, A. Kanevsky, and M.J. Kim, "A Generalized Utilization Bound Test for Fixed-Priority Real-Time Scheduling," Proc. Second Int'l Workshop Real-Time Computing Systems and Applications, pp. 73-77, 1995.
-
(1995)
Proc. Second Int'l Workshop Real-Time Computing Systems and Applications
, pp. 73-77
-
-
Park, D.-W.1
Natarajan, S.2
Kanevsky, A.3
Kim, M.J.4
-
20
-
-
38249003286
-
A new performance measure for scheduling independent real-time tasks
-
D.-T. Peng and K.G. Shin, "A New Performance Measure for Scheduling Independent Real-Time Tasks," J. Parallel and Distributed Computing, vol. 19, pp. 11-26, 1993.
-
(1993)
J. Parallel and Distributed Computing
, vol.19
, pp. 11-26
-
-
Peng, D.-T.1
Shin, K.G.2
-
21
-
-
84989758830
-
Scheduling of time critical processes
-
O. Serlin, "Scheduling of Time Critical Processes," Spring Joint Computer Conf., vol. 41, pp. 925-932, 1972.
-
(1972)
Spring Joint Computer Conf.
, vol.41
, pp. 925-932
-
-
Serlin, O.1
-
22
-
-
84989860576
-
A formal proof of the rate monotonic scheduler
-
D. Shuzhen, X. Qiwen, and Z. Naijun, "A Formal Proof of the Rate Monotonic Scheduler," Real-Time Computing Systems and Applications, pp. 500-503, 1998.
-
(1998)
Real-Time Computing Systems and Applications
, pp. 500-503
-
-
Shuzhen, D.1
Qiwen, X.2
Naijun, Z.3
|