Journal of Northeastern University ›› 2005, Vol. 26 ›› Issue (5): 425-428.DOI: -

• OriginalPaper • Previous Articles     Next Articles

On the SR-RM scheduling algorithm

Wang, Xiao-Ying (1); Zhao, Hai (1); Zhang, Wen-Bo (1); Yin, Zhen-Yu (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-05-15 Published:2013-06-24
  • Contact: Wang, X.-Y.
  • About author:-
  • Supported by:
    -

Abstract: Analyzing the advantages of RM (Rate Monotonic) scheduling algorithm and its disadvantages in actual execution, the SR-RM (Self-Regulating Rate Monotonic) scheduling algorithm is proposed to adjust the task execution period through tracking the actual execution time of assigned tasks and processor utilization. In addition, SR-RM engaged in decrease unscheduled task set to improve reliability through scout and predict environment transformation. Simulation tests revealed that SR-RM scheduling algorithm is available to the real-time implementation environment of reducing the miss rate of tasks with higher processor utilization.

CLC Number: