A Real-Time Tasks Scheduling Method Based on Dynamic Priority

Recently, real-time system was widely applied to diverse environments. In order to meet the demands of those applications, many scheduling strategies were presented to achieve either maximal benefit or minimum miss deadline ratio. However, very little attention has been devoted to simultaneously achieve the two objectives. This paper proposes a dynamic priority assignment (DPA) strategy by analyzing the remainder value density and urgency of task, in which, two parameters p and q are used to adjust the weights of remainder value density and urgency on task's priority. Based on DPA strategy, the condition that can avoid system thrashing is discussed, and a dynamic real-time task scheduling (DRTS) algorithm is also proposed. Finally, experimental results show that the proposed method can improve the integrated performance of real-time system compared with analogous algorithms.

[1]  Xiaofeng Wang,et al.  Period and Deadline Selection for Schedulability in Real-Time Systems , 2008, 2008 Euromicro Conference on Real-Time Systems.

[2]  Dong-Sung Kim,et al.  Real-time scheduling method for networked discrete control systems , 2009 .

[3]  Patricia Balbastre Betoret,et al.  Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems , 2008, IEEE Transactions on Computers.

[4]  Miron Livny,et al.  Value-based scheduling in real-time database systems , 1993, The VLDB Journal.

[5]  Bruno Sadeg,et al.  On new scheduling policy for the improvement of firm RTDBSs performances , 2007, Data Knowl. Eng..

[6]  Gang Quan,et al.  On-Line Scheduling of Real-Time Services for Cloud Computing , 2010, 2010 6th World Congress on Services.

[7]  Yixin Chen,et al.  Real-Time Scheduling for WirelessHART Networks , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[8]  Marco Spuri,et al.  Value vs. deadline scheduling in overload conditions , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[9]  Hyeonjoong Cho,et al.  Utility accrual real-time scheduling for (m,k)-firm deadline-constrained streams on multiprocessors , 2011 .

[10]  Alan Burns,et al.  A value-based scheduling approach for real-time autonomous vehicle control , 2000, Robotica.

[11]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Alan Burns,et al.  Dynamic value-density for scheduling real-time systems , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[13]  Wei Dong,et al.  FIT: A Flexible, Lightweight, and Real-Time Scheduling System for Wireless Sensor Platforms , 2010, IEEE Transactions on Parallel and Distributed Systems.

[14]  Shinpei Kato,et al.  Global EDF-based scheduling with laxity-driven priority promotion , 2011, J. Syst. Archit..

[15]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

[16]  Tongquan Wei,et al.  Reliability-Driven Energy-Efficient Task Scheduling for Multiprocessor Real-Time Systems , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Alan Burns,et al.  The meaning and role of value in scheduling flexible real-time systems , 2000, J. Syst. Archit..

[18]  Miron Livny,et al.  Earliest deadline scheduling for real-time database systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[19]  Andrey V. Savkin,et al.  Optimal distributed real-time scheduling of flexible manufacturing networks modeled as hybrid dynamical systems , 2009 .

[20]  Sang Hyuk Son,et al.  Managing deadline miss ratio and sensor data freshness in real-time databases , 2004, IEEE Transactions on Knowledge and Data Engineering.

[21]  Deepali Virmani,et al.  Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks , 2013, ArXiv.

[22]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.