Dynamic DAG scheduling on multiprocessor systems: Reliability, energy, and makespan
J Huang, R Li, X Jiao, Y Jiang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Multiprocessor systems are increasingly deployed in real-time applications, where reliability,
energy consumption, and makespan are often the main scheduling objectives. In this work …
energy consumption, and makespan are often the main scheduling objectives. In this work …
Response time bounds for DAG tasks with arbitrary intra-task priority assignment
Most parallel real-time applications can be modeled as directed acyclic graph (DAG) tasks.
Intra-task priority assignment can reduce the nondeterminism of runtime behavior of DAG …
Intra-task priority assignment can reduce the nondeterminism of runtime behavior of DAG …
Parslo: A gradient descent-based approach for near-optimal partial SLO allotment in microservices
A Mirhosseini, S Elnikety, TF Wenisch - … of the ACM Symposium on Cloud …, 2021 - dl.acm.org
Modern cloud services are implemented as graphs of loosely-coupled microservices to
improve programmability, reliability, and scalability. Service Level Objectives (SLOs) define …
improve programmability, reliability, and scalability. Service Level Objectives (SLOs) define …
[PDF][PDF] Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling
M Nasri, G Nelissen… - 31st Conference on Real …, 2019 - cister.isep.ipp.pt
Most recurrent real-time applications can be modeled as a set of sequential code segments
(or blocks) that must be (repeatedly) executed in a specific order. In this paper, we provide a …
(or blocks) that must be (repeatedly) executed in a specific order. In this paper, we provide a …
A global DAG task scheduler using deep reinforcement learning and graph convolution network
Parallelization of tasks and efficient utilization of processors are considered important and
challenging in operating large-scale real-time systems. Recently, deep reinforcement …
challenging in operating large-scale real-time systems. Recently, deep reinforcement …
Virtually-federated scheduling of parallel real-time tasks
Federated scheduling is a promising approach to schedule parallel real-time tasks, where
each task exclusively executes on a set of dedicated processors. However, federated …
each task exclusively executes on a set of dedicated processors. However, federated …
The shape of a DAG: bounding the response time using long paths
In 1969, Graham developed a well-known response time bound for a DAG task using the
total workload and the longest path of the DAG, which has been widely applied to solve …
total workload and the longest path of the DAG, which has been widely applied to solve …
Bounding the response time of DAG tasks using long paths
In 1969, Graham developed a well-known response time bound for a DAG task using the
total workload and the longest path of the DAG, which has been widely applied to solve …
total workload and the longest path of the DAG, which has been widely applied to solve …
Exact response-time bounds of periodic DAG tasks under server-based global scheduling
S Ahmed, JH Anderson - 2022 IEEE Real-Time Systems …, 2022 - ieeexplore.ieee.org
Artificial-intelligence (AI) techniques are revolutionizing modern safety-critical real-time
systems by enabling autonomous features never seen before. However, AI-based workloads …
systems by enabling autonomous features never seen before. However, AI-based workloads …
A fluid scheduling algorithm for DAG tasks with constrained or arbitrary deadlines
F Guan, L Peng, J Qiao - IEEE Transactions on Computers, 2021 - ieeexplore.ieee.org
A number of scheduling algorithms have been proposed for real-time parallel tasks modeled
as Directed Acyclic Graphs (DAGs). Many of them focus on scheduling DAG tasks with …
as Directed Acyclic Graphs (DAGs). Many of them focus on scheduling DAG tasks with …