LINTS^RT: A Learning-driven Testbed for Intelligent Scheduling in Embedded Systems

by   Zelun Kong, et al.

Due to the increasing complexity seen in both workloads and hardware resources in state-of-the-art embedded systems, developing efficient real-time schedulers and the corresponding schedulability tests becomes rather challenging. Although close to optimal schedulability performance can be achieved for supporting simple system models in practice, adding any small complexity element into the problem context such as non-preemption or resource heterogeneity would cause significant pessimism, which may not be eliminated by any existing scheduling technique. In this paper, we present LINTS^RT, a learning-based testbed for intelligent real-time scheduling, which has the potential to handle various complexities seen in practice. The design of LINTS^RT is fundamentally motivated by AlphaGo Zero for playing the board game Go, and specifically addresses several critical challenges due to the real-time scheduling context. We first present a clean design of LINTS^RT for supporting the basic case: scheduling sporadic workloads on a homogeneous multiprocessor, and then demonstrate how to easily extend the framework to handle further complexities such as non-preemption and resource heterogeneity. Both application and OS-level implementation and evaluation demonstrate that LINTS^RT is able to achieve significantly higher runtime schedulability under different settings compared to perhaps the most commonly applied schedulers, global EDF, and RM. To our knowledge, this work is the first attempt to design and implement an extensible learning-based testbed for autonomously making real-time scheduling decisions.


T-Visor: A Hypervisor for Mixed Criticality Embedded Real-time System with Hardware Virtualization Support

Recently, embedded systems have not only requirements for hard real-time...

Real-Time scheduling: from hard to soft real-time systems

Real-time systems are traditionally classified into hard real-time and s...

A Hardware-based HEFT Scheduler Implementation for Dynamic Workloads on Heterogeneous SoCs

Non-uniform performance and power consumption across the processing elem...

A New Scheduling Algorithms For Real Time Tasks

The main objective of this paper is to develop the two different ways in...

k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests

To deal with a large variety of workloads in different application domai...

RED: A Systematic Real-Time Scheduling Approach for Robotic Environmental Dynamics

Intelligent robots are designed to effectively navigate dynamic and unpr...

Wrangling Rogues: Managing Experimental Post-Moore Architectures

The Rogues Gallery is a new experimental testbed that is focused on tack...

Please sign up or login with your details

Forgot password? Click here to reset