Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms

Authors:
Xiaoying Wang;Hai Zhao;Wenbo Zhang;Zhenyu Yin
Affiliations:
Northeastern University, P.R.China/ Changshu Institute of Technology, P.R.China;Northeastern University, P.R.China;Northeastern University, P.R.China;Northeastern University, P.R.China
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 10
Cited 0

Engineering and analysis of real-time operating systems

Engineering and analysis of real-time operating systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Engineering and Analysis of Fixed Priority Schedulers

IEEE Transactions on Software Engineering
Exact Best-Case Response Time Analysis of Fixed Priority Scheduled Tasks

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Calculating Exact Worst Case Response Times for Static Priority Scheduled Tasks with Offsets and Jitter

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Schedulability Analysis for Tasks with Static and Dynamic Offsets

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Translating Off-Line Schedules into Task Attributes for Fixed Priority Scheduling

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A Modified Version of Rate-Monotonic Scheduling Algorithm and its Efficiency Assessment

WORDS '02 Proceedings of the The Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002)
Best-Case Response Times and Jitter Analysis of Real-Time Tasks

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of embedded real-time systems only deploy necessary resources so that the extra preemption overheads among tasks debase the system performance terribly. Through scheduling process analysis of periodic task, this paper presents the waiting limit formula of each task in ready queue while guarantees its deadline. In addition, some properties such as final preempt time is deduced and the necessary condition of preemptive behavior of periodic tasks is quantitatively described. Based on them, a micro scheduling preempt model for periodic tasks in ready queue is put forward, which decreases preempt amount and optimizes system performance through change preempt relationship. The model cannot only decreases preempt amount effectively but enhances processor utilization for static priority scheduling algorithm such as rate monotonic scheduling, which is demonstrated by case study and simulation.