The Earliest Smooth Release Time for a New Task Based on EDF Algorithm
Although EDF (Earliest Deadline First) algorithm has received extensive study during the past more than 40 years, only a few researchers have published their efforts on the bandwidth transfer between tasks. If current running tasks are compressed to free part of their occupied bandwidth to accommoda...
Main Author: | Guangming Qian |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9286425/ |
Similar Items
-
Research on Real-Time Embedded Software Scheduling Model Based on EDF
by: Yingjie Wang, et al.
Published: (2020-01-01) -
On EDF scheduler with the exponential deadlines
by: Robert Janowski, et al.
Published: (2016-09-01) -
Simulation studies of EDF scheduler with different deadline distributions
by: Robert Janowski, et al.
Published: (2017-09-01) -
Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors
by: Hyeongboo Baek, et al.
Published: (2019-05-01) -
Cross-platform task scheduling algorithm of warship formation network under bandwidth constraints
by: WU Shubin, et al.
Published: (2020-12-01)