Information Technology Reference
In-Depth Information
Burns, A., & Guillem, B. (1999). New results on
fixed priority aperiodic servers. In 20th IEEE
Real-Time Systems Symposium, RTSS (pp. 68
-
78).
Buttazzo, G., & Stankovic, J. (1993). RED: A robust earliest deadline scheduling. 3rd International
Workshop on Responsive Computing.
Gharsellaoui, H., Khalgui, M., & Ben Ahmed, S. (2012). New optimal preemptively scheduling
for real-time reconfigurable sporadic tasks based on earliest deadline first algorithm. Journal of
International Advanced Pervasive and Ubiquitous Computing, IJAPUC, 4(2), 65
81.
Ghazalie, T., & Baker, T. (1994). Aperiodic servers in a deadline scheduling environment.
Tallahassee, FL: Department of Computer Science, Florida State University. (32306).
Guillem, B. (2001). Weakly hard real-time systems. IEEE Transactions on Computers, 50(4),
308
-
321.
Hamdaoui, M., & Ramanathan, P. (1995). A dynamic priority assignment technique for streams
with (m, k)-
rm deadlines. IEEE Transactions on Computers, 44(1), 1443
-
1451.
Hamidzadeh, B., & Atif, Y. (1996). Dynamic scheduling of real-time aperiodic tasks on
multiprocessor architectures.
-
In Proceedings of
the 29th Annual Hawaii
International
Conference on System Sciences (pp. 469
-
478).
Layland, J., & Liu, C. (1973). Scheduling algorithms for multi-programming in a hard-real-time
environment. Journal of the ACM, 20(1), 46
-
61.
Lehoczky, J. P., Sha L., & Strosnider, J. K. (1987). Enhanced aperiodic responsiveness in hard-
real-time environments. In Proceedings of IEEE Real-Time Systems Symposium (pp. 261
-
270).
Lipari, G., & Buttazzo, G. (1999). Schedulability analysis of periodic and aperiodic tasks with
resource constraints. International Journal of Systems Architecture, 46(4), 327
-
338.
Marouf, M., George, L., & Sorel, Y. (2012). Schedulability analysis for a combination of non-
preemptive strict periodic tasks and preemptive sporadic tasks. In ETFA
'
12
—
17th IEEE
International Conference on Emerging Technologies and Factory Automation (pp. 1
8).
Marouf, M., & Sorel, B. Y. (2010). Schedulability conditions for non-preemptive hard real-time
tasks with strict period. In 18th International Conference on Real-Time and Network Systems,
RTNS10.
Marouf, M., & Sorel, B. Y. (2011). Scheduling non-preemptive hard real-time tasks with strict
periods. In 16th IEEE International Conference on Emerging Technologies and Factory
Automation ETFA2011 (pp. 1
-
8).
Naveen, A., & Venkatesan, M. (2013). Energy aware scheduling of aperiodic real-time tasks on
multiprocessor systems. Journal of Computing Science and Engineering JCSE, 7(1), 30
-
43.
Sprunt, B., Sha, L., & Lehoczky, J. (1989). Aperiodic task scheduling for hard-real-time systems.
Real-Time Systems, 1(1), 27
-
60.
Strosnider, K., Lehoczky, J. P., & Sha, L. (1995). The deferrable server algorithm for enhanced
aperiodic responsiveness in hard real-time environments. IEEE Transactions on Computers, 44
(1), 73
-
91.
Thuel, S. R., & Lehoczky, J. (1994). Algorithms for scheduling hard aperiodic tasks in fixed-
priority systems using slack stealing. In Real-Time Systems Symposium (pp. 22
-
33).
-