Journal of Northeastern University(Natural Science)

Journal of Northeastern University ›› 2008, Vol. 29 ›› Issue (11): 1560-1563.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Implementation of dynamic-priority scheduling algorithm and EDF algorithm in WebitOS

Zhao, Hai (1); Zhou, Feng (1); Luo, Ding-Ding (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-11-15 Published:2013-06-22
  • Contact: Zhao, H.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

759

Abstract: Compared with the static-priority scheduling algorithms in real-time system, the dynamic-priority scheduling algorithms, which can set different deadlines for different jobs of each and every task to reflect the time constraint on tasks better. A dynamic-priority scheduling algorithm designed and implemented in the WebitOS real-time operating system on the basis of the high availability scheduling of earliest deadline first (EDF) algorithm with an early discarding rule specified for next job. Test results showed that the rule enhances the scheduling performance of the EDF algorithm as a whole under over-loaded condition.

CLC Number: