A Delay Optimization of Non-Periodic Information for the Scheduling Algorithm
2011
The optimal scheduling algorithm based on non-periodic information is model and analyzed. Compared with typical scheduling algorithms, it improves non-periodic tasks theoretical delay. Finally, the simulation shows that the scheduling algorithm is effective in reducing delay problems of the non-periodic communication task.
Keywords:
- Deadline-monotonic scheduling
- Two-level scheduling
- Lottery scheduling
- Fair-share scheduling
- Mathematical optimization
- Real-time computing
- Round-robin scheduling
- Rate-monotonic scheduling
- Dynamic priority scheduling
- Fixed-priority pre-emptive scheduling
- Materials science
- Earliest deadline first scheduling
- Flow shop scheduling
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
8
References
0
Citations
NaN
KQI