Self-tuning schedulers for legacy real-time applications

Cucinotta, Tommaso; Checconi, Fabio; Abeni, Luca; Palopoli, Luigi

doi:10.1145/1755913.1755921

Cited by 22 publications

(16 citation statements)

References 29 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Real-time introspection solutions have been proposed by Cucinotta et al [19], [20]. However, these solutions, like Nitro, trace every syscall while our solution only catches syscalls related to real-time.…”

Section: Related Workmentioning

confidence: 92%

KairosVM: Deterministic introspection for real-time virtual machine hierarchical scheduling

Burns

Barbalace

Legout

et al. 2014

Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)

View full text Add to dashboard Cite

Consolidation and isolation are key technologies that promoted the undisputed popularity of virtualization in most of the computer industry. This popularity has recently led to a growing interest in real-time virtualization, making this technology enter the real-time system market. However, it has several issues due to the strict timing guarantees contracted. Moreover supporting legacy software stacks adds another level of complexity when the software is a black box. We present KairosVM, a latency-bounded, real-time extension to Linux's KVM module. It aims to bridge the lack of communication of the real-time requirements between the guest scheduler and the host scheduler, exploiting virtual machine introspection. The hypervisor captures the real-time requirements of the guest by catching previously added undefined instructions, without the need to do any modification to the guests. Our evaluations show that KairosVM's overhead is negligible when compared to existing introspection solutions thus can be used in real-time.

show abstract

Section: Related Workmentioning

confidence: 92%

KairosVM: Deterministic introspection for real-time virtual machine hierarchical scheduling

Burns

Barbalace

Legout

et al. 2014

Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)

View full text Add to dashboard Cite

show abstract

“…Some papers introduce controllers to adjusts the "reservation period", that is, the times assigned to the tasks, with the purpose of keeping the system utilisation below a specified upper bound [Abeni et al 2002;Cucinotta et al 2010aCucinotta et al , 2010bLawrence et al 2001;Palopoli and Abeni 2009]. In these works the burst duration is adjusted according to the results of the execution of a controller, built to optimize different cost function.…”

Section: Related Workmentioning

confidence: 99%

Task scheduling

Maggio

Terraneo

Leva

2014

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

This article presents a new approach to the design of task scheduling algorithms, where system-theoretical methodologies are used throughout. The proposal implies a significant perspective shift with respect to mainstream design practices, but yields large payoffs in terms of simplicity, flexibility, solution uniformity for different problems, and possibility to formally assess the results also in the presence of unpredictable run-time situations. A complete implementation example is illustrated, together with various comparative tests, and a methodological treatise of the matter.

show abstract

“…However, for periodic tasks, the reservation period is set to an integer sub-multiple of the task period and adaptations are made by changing the budget Q i . This particular choice is mandated by efficiency reasons because it reduces the waste of computing power in the scheduling process [8]. The adaptation of the budget is typically made by a feedback control loop, where measurements collected inside the OS are used to assess the QoS and to fine-tune it as required.…”

Section: The Scheduling Algorithmmentioning

confidence: 99%

“…, 3N + 1). The expression of matricesÃ φ(j) can be easily derived combining (7) and (8). For φ(j) = 0, .…”

Section: The Control Problemmentioning

confidence: 99%

Soft real-time scheduling for embedded control systems

Fontanelli¹,

Greco²,

Palopoli³

2013

Automatica

Self Cite

View full text Add to dashboard Cite

We deal with the following problem: how to implement a feedback controller on a CPU, with variable computation time, on a CPU that is shared with other tasks so that 1) the task satisfies its Quality of Control (QoC) requirements, 2) the CPU can be efficiently managed to host other concurrent activities. We propose a solution based on the combination of a predictable model of computation and of a scheduling algorithm that enables a fine control on the evolution of the delay. This combination of techniques enables us to set up an optimisation problem where the scheduling parameters are synthesised in order to minimise the CPU utilisation and guarantee the QoC requirements for the control task.

show abstract

Self-tuning schedulers for legacy real-time applications

Cited by 22 publications

References 29 publications

KairosVM: Deterministic introspection for real-time virtual machine hierarchical scheduling

KairosVM: Deterministic introspection for real-time virtual machine hierarchical scheduling

Task scheduling

Soft real-time scheduling for embedded control systems

Contact Info

Product

Resources

About