Research Of An Algorithm For Multitask Scheduling In Real-time Systems

By detailedly studying multitask types of real-time system, Real-time tasks arecategorized 2-dimentionally by arrival pattern and deadline type among the variousreal-time scheduling agriothms,Deadline Monotonic Scheduling is researched and hasbecome a backbone technique because of its static optimal quality and its advantagessuch as easy to implement in real applications compared to dynamic schedulingagriothms. a real-time scheduling model based on this technique ( in this thesis refer toSM model).Among the SM model, the technique of dividing task set into Scheduletasksand Managebletasks. Uses the different dispatch strategy separately to them. This articlestudies is with emphasis: The duty collection division is ScheduableTaks and theManageableTasks two sets thought, the maximized ScheduableTaks algorithm, sturdyand healthy time duty dispatch optimization algorithm, ManageableTaks processingmethod. Finally this article proposed regarding the SM model further improves direction.