Adaptive Total Bandwidth Server: Using Predictive Execution Time

Tanaka, Kiyofumi

doi:10.1007/978-3-642-38853-8_23

Cited by 9 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is clear that TB* generates much more overheads than the others. TB (2) and TB(3) mitigate the overheads but they are still larger than the VRAs. As a whole, the virtual release advancing exhibits shorter response times with smaller overheads when U p is high.…”

Section: Discussionmentioning

confidence: 97%

See 1 more Smart Citation

Virtual release advancing for earlier deadlines

Tanaka

2015

SIGBED Rev.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 97%

“…The author has been trying to achieve this goal with techniques, the adaptive total bandwidth server (Adaptive TBS) [1] and the adaptive EDF [2]. These techniques are based on the total bandwidth server (TBS) [3], but utilize estimated execution times instead of worst-case execution times (WCET) to calculate deadlines adaptively.…”

Section: Introductionmentioning

confidence: 99%

Virtual release advancing for earlier deadlines

Tanaka

2015

SIGBED Rev.

Self Cite

View full text Add to dashboard Cite

show abstract

“…It has been proposed that adaptive TBS can reduce response times of aperiodic tasks by giving deadlines to jobs in a stepwise fashion [9], [10]. This section describes how to apply adaptive TBS to periodic tasks.…”

Section: Applying Adaptive Total Bandwidth Servermentioning

confidence: 99%

“…The scheduling method proposed in this paper aims to shorten jitters and response times of particular periodic tasks that are important for the systems, independent of their periods, while maintaining schedulability with up to 100% utilization. This method consists of two techniques to make deadlines as early as possible: applying adaptive total bandwidth server [9], [10] to periodic tasks, which adaptively extends deadlines according to varying execution times, and virtual release advancing, which obtains short deadlines by virtually assuming retroactive release times. This paper consists of five sections.…”

Section: Introductionmentioning

confidence: 99%

Real-Time Scheduling for Reducing Jitters of Periodic Tasks

Tanaka

2015

Journal of Information Processing

Self Cite

View full text Add to dashboard Cite

For control applications implemented with periodic tasks, fluctuations in start or response timing cause jitters which may disturb periodicity and result in performance degradation or instability. This study proposes real-time scheduling techniques that reduce jitters and average response times of periodic tasks. In the proposed scheduling, two techniques are employed: one which adaptively extends deadlines according to varying execution times, and the other which further obtains short deadlines by virtually advancing release times. These two techniques aim at scheduling target tasks as early as possible by giving them short enough deadlines. The evaluation shows that the former shortens average response times of the target tasks by up to 20.5% and the latter mitigates jitters by up to 35.4%, compared to the existing scheduling algorithm, Total Bandwidth Server.The sufficient condition for the schedulability is that the processor utilization should be less than 69% [8].

show abstract

“…Therefore, the response time of the aperiodic task becomes worse. The advanced TBS (ATBS) was proposed in [7,8] to reduce the aperiodic task response time, where the deadline of the currently arrived aperiodic task is predicted based on the execution time of the previously performed aperiodic tasks. It was shown in [7] that the execution time of an aperiodic task is predicted by using the weighted average filter method.…”

Section: Introductionmentioning

confidence: 99%

Online Slack-Stealing Scheduling with Modified laEDF in Real-Time Systems

et al. 2019

View full text Add to dashboard Cite

In hard real-time task systems where periodic and aperiodic tasks coexist, the object of task scheduling is to reduce the response time of the aperiodic tasks while meeting the deadline of periodic tasks. Total bandwidth server (TBS) and advanced TBS (ATBS) are used in dynamic priority systems. However, these methods are not optimal solutions because they use the worst-case execution time (WCET) or the estimation value of the actual execution time of the aperiodic tasks. This paper presents an online slack-stealing algorithm called SSML that can make significant response time reducing by modification of look-ahead earliest deadline first (laEDF) algorithm as the slack computation method. While the conventional slack-stealing method has a disadvantage that the slack amount of each frame must be calculated in advance, SSML calculates the slack when aperiodic tasks arrive. Our simulation results show that SSML outperforms the existing TBS based algorithms when the periodic task utilization is higher than 60%. Compared to ATBS with virtual release advancing (VRA), the proposed algorithm can reduce the response time up to about 75%. The performance advantage becomes much larger as the utilization increases. Moreover, it shows a small performance variation of response time for various task environments.

show abstract

Adaptive Total Bandwidth Server: Using Predictive Execution Time

Cited by 9 publications

References 10 publications

Virtual release advancing for earlier deadlines

Virtual release advancing for earlier deadlines

Real-Time Scheduling for Reducing Jitters of Periodic Tasks

Online Slack-Stealing Scheduling with Modified laEDF in Real-Time Systems

Contact Info

Product

Resources

About