Analysis of Real-time Scheduling Algorithm with Global Fixed Priority
The schedulability can be determined based on deadline analysis and response time analysis for the global Fixed Priority(FP) real-time scheduling algorithm.The traditional method takes into account the real-time tasks with a carry-in job.The processor cannot meet the computing requirement of real-ti...
Sparad:
| Huvudupphov: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Editorial Office of Computer Engineering
2017-12-01
|
| Serie: | Jisuanji gongcheng |
| Ämnen: | |
| Länkar: | https://www.ecice06.com/fileup/1000-3428/PDF/201712012.pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|