A Proposal of Real-time Scheduling Algorithm based on RMZL and Schedulability Analysis☆

Abstract Recently, multiprocessor platform is generally used in embedded real time systems. The optimal real time scheduling algorithms for multiprocessor are demanded. Several algorithms based on RM are proposed. In this study, we propose RMZLPD based on RMZL applied zero-laxity rule to RM. RMZLPD can realize high parallelism. Through simulation, RMZLPD has shown the high schedule success ratio. The schedulability of proposed algorithm also is shown by response time analysis.

[1]  Richard West,et al.  Mutable Protection Domains: Towards a Component-Based System for Dependable and Predictable Computing , 2007, RTSS 2007.

[2]  James H. Anderson,et al.  Tardiness Bounds under Global EDF Scheduling on a Multiprocessor , 2005, RTSS.

[3]  Wang Yi,et al.  Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

[4]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[5]  Michele Cirinei,et al.  Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).