Adaptive Total Bandwidth Server: Using Predictive Execution Time

Abstract : Along with the growing diversity and complexity of real-time embedded systems, it is becoming common that different types of tasks, periodic tasks and aperiodic tasks, reside in a system. In such systems, it is important that schedulability of periodic tasks is maintained and at the same time response times to aperiodic requests are short enough. Total Bandwidth Server (TBS) is one of convincing task scheduling algorithms for mixed task sets of periodic and aperiodic tasks. This paper proposes a method of using predictive execution times instead of worst-case execution times for deadline calculations in TBS to obtain shorter deadlines and reducing response times of aperiodic execution, while maintaining the schedulability of periodic tasks. From the evaluation by simulation, the proposed method combined with a resource reclaiming technique exhibits better average response times for aperiodic tasks, in case of a heavy load, by up to 39%.
Document type :
Conference papers
Complete list of metadatas
Contributor : Hal Ifip <>
Submitted on : Monday, February 13, 2017 - 4:38:53 PM
Last modification on : Friday, December 1, 2017 - 1:09:41 AM
Long-term archiving on : Sunday, May 14, 2017 - 3:07:49 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Kiyofumi Tanaka. Adaptive Total Bandwidth Server: Using Predictive Execution Time. 4th International Embedded Systems Symposium (IESS), Jun 2013, Paderborn, Germany. pp.250-261, ⟨10.1007/978-3-642-38853-8_23⟩. ⟨hal-01466681⟩



Record views


Files downloads