Lowest priority first based feasibility analysis of real-time systems

Asplund, 2011 Audsley, 2011, On priority assignment in fixed priority Scheduling, Information Processing Letters, 79, 39, 10.1016/S0020-0190(00)00165-4 N.C. Audsley, A. Burns, M.F. Richardson, A.J. Wellings, Hard real-time scheduling: the deadline monotonic approach, in: Proceedings of 8th IEEE Workshop on Real-Time Operating Systems and Software, 1991, pp. 133–137. Audsley, 1993, Applying new scheduling theory to static priority preemptive scheduling, Software Engineering Journal, 10.1049/sej.1993.0034 E. Bini, G.C. Buttazzo, The space of rate monotonic schedulability, in: Proceedings of the 23th IEEE Real-Time Systems Symposium, Austin, Texas, 2002, pp. 169–177. Bini, 2004, Schedulability analysis of periodic fixed priority systems, IEEE Transactions on Computers, 53, 1462, 10.1109/TC.2004.103 E. Bini, G.C. Buttazzo, G. Buttazzo, A hyperplanes bound for the rate monotonic algorithm, in: Proceedings of the 13th Euromicro Conference on Real-Time Systems, 2001, pp. 59–67. Buchard, 1995, New strategies for assigning realtime tasks to multiprocessor systems, IEEE Transactions on Computers, 4, 1429, 10.1109/12.477248 Burns, 2009, 602 Chenga, 2010, Machine scheduling with job class setup and delivery considerations, Computers and Operations Research, 37, 1123, 10.1016/j.cor.2009.10.001 Chrobak, 2003, Preemptive scheduling in overloaded systems, Journal of Computer and System Sciences, 67, 183, 10.1016/S0022-0000(03)00070-9 Davis, 2008, Efficient exact schedulability tests for fixed priority real-time systems, IEEE Transactions on Computers, 57, 1261, 10.1109/TC.2008.66 N. Fisher, S. Baruah, A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines, in: Proceedings of the 17th Euromicro Conference on Real-Time Systems, Palma de Mallorca, 2005. L. George, N. Riverre, M. Spuri, Preemptive and non-preemptive real-time uniprocessor scheduling, Research Report 2966, INRIA, France, 1996. C.C. Han, H.Y. Tyan, A better polynomial-time schedulability test for real-time static-priority scheduling algorithm, in: Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997, pp. 36–45. Joseph, 1986, Finding response times in a real-time system, The Computer Journal, 29, 390, 10.1093/comjnl/29.5.390 Krishna, 1997 Laplante, 2004, 10.1002/0471648299 Laplante, 2004 J.P. Lehoczky, L. Sha, Y. Ding, The rate monotonic scheduling algorithm: exact characterization and average case behavior, in: Proceedings of the IEEE Real-Time System Symposium, 1989, pp. 166–171. Leung, 1982, On the complexity of fixed-priority scheduling of periodic real-time tasks, Performance Evaluation, 2, 237, 10.1016/0166-5316(82)90024-4 Liu, 2000 Liu, 1973, Scheduling algorithms for multiprogramming in a hard real-time environment, Journal of the ACM, 20, 40, 10.1145/321738.321743 Lu, 2008, Efficient exact test for rate-monotonic schedulability using large period-dependent initial values, IEEE Transactions on Computers, 57, 10.1109/TC.2007.70820 Manabe, 1998, A feasibility decision algorithm for rate monotonic and deadline monotonic scheduling, Real-Time Systems, 14, 171, 10.1023/A:1007964900035 Min-Allah, 2010, Utilization bound for periodic task set with composite deadline, Journal of Computers and Electrical Engineering, 36, 1101, 10.1016/j.compeleceng.2010.04.003 Min-Allah, 2012, Power efficient rate monotonic scheduling for multi-core systems, Journal of Parallel and Distributed Computing, 72, 48, 10.1016/j.jpdc.2011.07.005 Min-Allah, 2012, Optimal task execution times for periodic tasks using nonlinear constrained optimization, The Journal of Supercomputing, 59, 1120, 10.1007/s11227-010-0506-z Min-Allah, 2007, Revisiting fixed priority techniques, 134 M. Sjödin, H. Hansson, Improved response-time analysis calculations, in: Proceedings of the 19th IEEE Real-Time Systems Symposium, 1998, pp. 399–409. K. Tei-Wei, K.M. Aloysius, Load adjustment in adaptive real-time systems, in: Proceedings of the IEEE Real-Time Systems Symposium, 1991, pp. 160–171. K.W. Tindell, Using offset information to analyze static priority pre-emptively scheduled task sets, Technical Report YCS 182, Department of Computer Science, University of York, 1992. Tindell, 1994, An extendible approach for analyzing fixed priority hard real-time tasks, Real-Time Systems Journal, 6, 133, 10.1007/BF01088593 A. Zerzelidis, A framework for flexible scheduling in real-time middleware, Ph.D. Thesis, The University of York, Department of Computer Science, 2007.