Please login using the form on menu list.|
It is required to login for Full-Text PDF.
A Proposal of Real-Time Scheduling Algorithm Based on RM and Schedulability Analysis
D - Abstracts of IEICE TRANSACTIONS on Information and Systems (Japanese Edition) Vol.J95-D No.6 pp.1347-1355
Publication Date: 2012/06/01
Online ISSN: 1881-0225
Print ISSN: 1880-4535
Type of Manuscript: PAPER
Full Text(in Japanese): PDF(1.1MB)
Recently, multiprocessor platform is generally used in embedded real time systems. The needs of optimal real time scheduling algorithm are growing up. Several studies for optimal real time scheduling algorithm are found. However, established algorithm is not fixed. In this study, we propose LP-RMAL which has improved the performance of RMZL based on traditional scheduling algorithm RM. LP-RMZL can reduce the context switching overhead and realize high parallelism, as well. Through simulation, LP-RMZL has shown the reduction of context switching overhead and high schedulability in overloaded cases. The high schedulability of proposed algorithm also is shown by response time analysis.