Name
Abstract | ||
|---|---|---|
Priority-based functional reactive programming (P-FRP) is a new functional programming formalism for developing safety-critical embedded systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature of functional programmes, preempted tasks in P-FRP are aborted and have to restart after the higher priority tasks have completed execution. Since the execution semantics of P-FRP are different from the classical preemptive model of execution, existing utilisation-based sufficient conditions cannot be applied. In this paper, we derive a new utilisation-based sufficient schedulability condition for P-FRP, and validate it using experimental task sets. We then compare the sufficient schedulability condition of P-FRP with that of the preemptive model to demonstrate the severe restrictions on task set sizes in P-FRP. Effect on the utilisation bound under conditional preemption has also been analysed. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1504/IJES.2014.060918 | INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS |
Keywords | Field | DocType |
schedulability analysis, functional programming, sufficient test, utilisation bound, worst-case response time, WCRT | Functional reactive programming,Worst case response time,Preemption,Functional programming,Computer science,Parallel computing,Real-time computing,Formalism (philosophy),Semantics,Distributed computing | Journal |
Volume | Issue | ISSN |
6 | 1 | 1741-1068 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chaitanya Belwal | 1 | 54 | 8.07 |
| Yuanfeng Wen | 2 | 68 | 7.99 |
| Albert M. K. Cheng | 3 | 307 | 39.69 |