Embedded and Ubiquitous Computing, IEEE/IFIP International Conference on (2011)
Melbourne, Victoria Australia
Oct. 24, 2011 to Oct. 26, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EUC.2011.11
Priority-based1Functional 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 programs, 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 utilization based sufficient conditions cannot be applied. In this paper, we derive a new utilization based sufficient schedulability condition for P-FRP, and validate it using experimental task sets.
Schedulability analysis, functional programming, sufficient test, utilization bound, worst-case response time
A. M. Cheng and C. Belwal, "A Utilization Based Sufficient Condition for P-FRP," Embedded and Ubiquitous Computing, IEEE/IFIP International Conference on(EUC), Melbourne, Victoria Australia, 2011, pp. 237-242.