论文信息 - SIGBED Review Vol. 12, Num. 3, June 2015

SIGBED Review Vol. 12, Num. 3, June 2015

Giving tasks more urgent deadlines leads to shorter response times in EDF-based scheduling. This paper describes a technique that gives earlier deadlines by virtually advancing release times in the Total Bandwidth Server (TBS) context. This technique improves aperiodic tasks' responsiveness while it guarantees the schedulability of the system. Simulations show the technique outperforms TBS and its enhanced one.

Kiyofumi Tanaka | Kiyofumi Tanaka

[1] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2] Giorgio C. Buttazzo,et al. Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments , 1999, IEEE Trans. Computers.

[3] Marco Spuri,et al. Efficient aperiodic service under earliest deadline scheduling , 1994, 1994 Proceedings Real-Time Systems Symposium.

[4] Adaptive EDF: using predictive execution time , 2013, SIGBED.

[5] Marco Spuri,et al. Robust aperiodic scheduling under dynamic priority systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[6] Kiyofumi Tanaka,et al. Adaptive Total Bandwidth Server: Using Predictive Execution Time , 2013, IESS.

[7] Michael L. Dertouzos,et al. Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.