J4 ›› 2012, Vol. 50 ›› Issue (02): 315-319.

Previous Articles     Next Articles

First Priority Schedule Strategy Based onAccumulated  Value Earliest Deadline

KAN Junman1, QIN Jun2, ZHAO Hongwei2, CAO Wenhao2   

  1. 1. Department of Information Engineering, Jilin Business and Technology College, Changchun 130062, China;2. College of Computer Science and Technology, Jilin University, Changchun 130012, Chin
  • Received:2011-05-03 Online:2012-03-26 Published:2012-03-21
  • Contact: ZHAO Hongwei E-mail:zhaohw@jlu.edu.cn

Abstract:

The authors proposed a earliest final deadline priority schedule strategy based on value accumulated. The analysis of preemptive
EDF algorithm in actual work shows that there is unnecessary preempted behavior in the system. The unnecessary preempted behavior affects the efficiency of the scheduler. Introducing a task accumulated parameter in EDF algorithm to adjust the EDF for redistributing priority of strategy reduces the cost of unnecessary preemptive behavior. Finally the experimental results verify the improved EDF preemptive algorithm reduces the cost of preemptive in the system.

Key words: computer application, schedule, cumulative value

CLC Number: 

  • TP311