Log In Sign Up

Fixed Priority Global Scheduling from a Deep Learning Perspective

by   Hyunsung Lee, et al.

Deep Learning has been recently recognized as one of the feasible solutions to effectively address combinatorial optimization problems, which are often considered important yet challenging in various research domains. In this work, we first present how to adopt Deep Learning for real-time task scheduling through our preliminary work upon fixed priority global scheduling (FPGS) problems. We then briefly discuss possible generalizations of Deep Learning adoption for several realistic and complicated FPGS scenarios, e.g., scheduling tasks with dependency, mixed-criticality task scheduling. We believe that there are many opportunities for leveraging advanced Deep Learning technologies to improve the quality of scheduling in various system configurations and problem scenarios.


page 1

page 2

page 3

page 4


EDF-Like Scheduling for Self-Suspending Real-Time Tasks

In real-time systems, schedulability tests are utilized to provide timin...

Analysis of Global Fixed-Priority Scheduling for Generalized Sporadic DAG Tasks

We consider global fixed-priority (G-FP) scheduling of parallel tasks, i...

Learning to Dynamically Coordinate Multi-Robot Teams in Graph Attention Networks

Increasing interest in integrating advanced robotics within manufacturin...

Integrating Proactive Mode Changes in Mixed Criticality Systems

In this work, we propose to integrate prediction algorithms to the sched...

Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems

The sporadic task model is often used to analyze recurrent execution of ...

Applying Graph-based Deep Learning To Realistic Network Scenarios

Recent advances in Machine Learning (ML) have shown a great potential to...

Gang FTP scheduling of periodic and parallel rigid real-time tasks

In this paper we consider the scheduling of periodic and parallel rigid ...