-
2
-
-
0000703331
-
Applying new scheduling theory to static priority pre-emptive scheduling
-
N. Audsley, A. Burns, M. Richardson, K. Tindell, and J. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8:284-292, 1993.
-
(1993)
Software Engineering Journal
, vol.8
, pp. 284-292
-
-
Audsley, N.1
Burns, A.2
Richardson, M.3
Tindell, K.4
Wellings, J.5
-
3
-
-
0000491136
-
Real-time scheduling: The deadline-monotonic approach
-
N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Real-time scheduling: the deadline-monotonic approach. In IEEEWorkshop on Real-Time Operating Systems and Software, pages 133-137, 1991.
-
(1991)
IEEEWorkshop on Real-Time Operating Systems and Software
, pp. 133-137
-
-
Audsley, N.C.1
Burns, A.2
Richardson, M.F.3
Wellings, A.J.4
-
5
-
-
34548715858
-
A comparison of global and partitioned EDF schedulability tests for multiprocessors
-
T. P. Baker. A comparison of global and partitioned EDF schedulability tests for multiprocessors. In International Conf. on Real-Time and Network Systems, pages 119-127, 2006.
-
(2006)
International Conf. on Real-Time and Network Systems
, pp. 119-127
-
-
Baker, T.P.1
-
6
-
-
39149095147
-
Schedulability Analysis of Multiprocessor Sporadic Task Systems
-
chapter Chapman
-
T. P. Baker and S. Baruah. Handbook of Real-Time and Embedded Systems, chapter Schedulability Analysis of Multiprocessor Sporadic Task Systems, pages 3.1-3.15. Chapman, 2008.
-
(2008)
Handbook of Real-Time and Embedded Systems
-
-
Baker, T.P.1
Baruah, S.2
-
8
-
-
33744818212
-
The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
-
S. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. on Computers, 55(7):918-923, 2006.
-
(2006)
IEEE Trans. on Computers
, vol.55
, Issue.7
, pp. 918-923
-
-
Baruah, S.1
Fisher, N.2
-
9
-
-
34249956267
-
Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor
-
S. Baruah, R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems, 2:301-324, 1990.
-
(1990)
Real-Time Systems
, vol.2
, pp. 301-324
-
-
Baruah, S.1
Howell, R.2
Rosier, L.3
-
10
-
-
0042850516
-
Rate monotonic analysis: The hyperbolic bound
-
E. Bini, G. C. Buttazzo, and G. M. Buttazzo. Rate monotonic analysis: The hyperbolic bound. IEEE Transactions on Computers, 52(7):933-942, 2003.
-
(2003)
IEEE Transactions on Computers
, vol.52
, Issue.7
, pp. 933-942
-
-
Bini, E.1
Buttazzo, G.C.2
Buttazzo, G.M.3
-
11
-
-
70349675648
-
Exact quantification of the sub-optimality of uniprocessor fixed-priority pre-emptive scheduling
-
R. Davis and A. Burns. Exact quantification of the sub-optimality of uniprocessor fixed-priority pre-emptive scheduling. Real-Time Systems, (3):211-258, 2009.
-
(2009)
Real-Time Systems
, Issue.3
, pp. 211-258
-
-
Davis, R.1
Burns, A.2
-
12
-
-
0033890026
-
Liu and Layland's schedulability test revisited
-
R. Devillers and J. Goossens. Liu and Layland's schedulability test revisited. Information Processing Letters, 73(5-6):157-161, 2000.
-
(2000)
Information Processing Letters
, vol.73
, Issue.5-6
, pp. 157-161
-
-
Devillers, R.1
Goossens, J.2
-
13
-
-
33947621202
-
The partitioned scheduling of sporadic tasks according to static-priorities
-
Dresden, Germany
-
N. Fisher, S. Baruah, and T. Baker. The partitioned scheduling of sporadic tasks according to static-priorities. In Proceedings of the 18th Euromicro Conference on Real-Time Systems, pages 118-127, Dresden, Germany, 2006.
-
(2006)
Proceedings of the 18th Euromicro Conference on Real-Time Systems
, pp. 118-127
-
-
Fisher, N.1
Baruah, S.2
Baker, T.3
-
14
-
-
33749040662
-
A fully polynomial-time approximation scheme for feasibility analysis in staticpriority systems with arbitrary relative deadlines
-
N. Fisher and S. K. Baruah. A fully polynomial-time approximation scheme for feasibility analysis in staticpriority systems with arbitrary relative deadlines. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, pages 117-126, 2005.
-
(2005)
Proceedings of the 17th Euromicro Conference on Real-Time Systems
, pp. 117-126
-
-
Fisher, N.1
Baruah, S.K.2
-
17
-
-
84974687699
-
Scheduling algorithms for multi-programming in a hard real time environment
-
January
-
L. C. Liu and W. Layland. Scheduling algorithms for multi-programming in a hard real time environment. Journal of ACM, 20(1):46-61, January 1973.
-
(1973)
Journal of ACM
, vol.20
, Issue.1
, pp. 46-61
-
-
Liu, L.C.1
Layland, W.2
-
18
-
-
3142722173
-
Limits to binary logic switch scaling-a Gedanken model
-
V. Zhirnov, R. Cavin, J. Hutchby, and G. Bourianoff. Limits to binary logic switch scaling-a Gedanken model. In IEEE, volume 9, pages 1934-1939, 2003.
-
(2003)
IEEE
, vol.9
, pp. 1934-1939
-
-
Zhirnov, V.1
Cavin, R.2
Hutchby, J.3
Bourianoff, G.4
|