Schedulability analysis of task scheduling in multiprocessor real-time systems using EDF algorithm

Behera, L., Mohapatra, D.P.

Computer Communication and Informatics（2012）

引用 3|浏览14

暂无评分

摘要

Task scheduling in real-time systems is a concept by which we can schedule the tasks according to their priorities. In hard real-time systems, the task scheduling is more important due to the chance of system failure. We discuss EDF task scheduling which is an optimal technique for the uniprocessor systems. The existing result of the QPA algorithm was applied on the uniprocessor system to check the schedulability of the tasks in uniprocessor system. We have extended the QPA algorithm to check the schedulability of the task sets in multiprocessor systems. Our algorithm is based on QPA algorithm and the utilization balanced algorithm. The proposed algorithm checks the absolute deadlines much faster than the existing QPA algorithm for uniprocessor real-time systems.

查看译文

关键词

embedded systems,multiprocessing systems,scheduling,task analysis,edf algorithm,qpa algorithm,multiprocessor real-time systems,real-time systems,schedulability analysis,task scheduling,uniprocessor systems,utilization balanced algorithm,edf scheduling,absolute deadline,multi-processor system,relative deadline,real time systems,algorithm design and analysis,algorithm design,job shop scheduling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要