| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332897 | Journal of Computer and System Sciences | 2013 | 12 Pages |
Abstract
⺠We rigorously prove that task abortions in P-FRP are bounded within the Least Common Multiple (LCM) of task periods. ⺠We formally derive a value of the feasibility interval in P-FRP. ⺠We address both synchronous and asynchronous releases of P-FRP tasks. ⺠Feasibility intervals of synchronous releases in P-FRP are proved to be the same as those in the preemptive model. ⺠A game-board method is proposed to compute the actual response time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chaitanya Belwal, Albert M.K. Cheng, Bo Liu,