Improvement of Embedded Linux Operating System Scheduling Algorithm
Xu De
Abstract
Xu De
Abstract
In embedded systems,the real-time scheduling algorithm performance has a direct to the real-time plays a decisive role.Therefore,this paper firstly introduces the related concepts and dispatch system real-time scheduling algorithm classification,and then discusses current common scheduling algorithm based on quality,after priority scheduling algorithm was improved,based on improved after a variety of mixed RADS algorithm meets the practical application scheduling model of real-time diversity needs.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In embedded systems,the real-time scheduling algorithm performance has a direct to the real-time plays a decisive role.Therefore,this paper firstly introduces the related concepts and dispatch system real-time scheduling algorithm classification,and then discusses current common scheduling algorithm based on quality,after priority scheduling algorithm was improved,based on improved after a variety of mixed RADS algorithm meets the practical application scheduling model of real-time diversity needs.
Key concepts: Computer science, Fair-share scheduling, Rate-monotonic scheduling, Dynamic priority scheduling, Earliest deadline first scheduling, Round-robin scheduling, Two-level scheduling, Fixed-priority pre-emptive scheduling