Abstract
In this work we consider a measurement-based model for parallel real-time tasks represented by the work and span parameters of directed acyclic graphs, with different bounds for nominal and overload scenarios. We address the corresponding real-time scheduling problem and propose an optimal scheduling strategy with a derived tight bound on the maximum response time of a task.
Original language | English (US) |
---|---|
Pages (from-to) | 247-253 |
Number of pages | 7 |
Journal | Real-Time Systems |
Volume | 56 |
Issue number | 3 |
DOIs | |
State | Published - Jul 1 2020 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Computer Science Applications
- Computer Networks and Communications
- Control and Optimization
- Electrical and Electronic Engineering
Keywords
- DAG scheduling
- Multiprocessors
- Optimality
- Uncertainty