Utilisation bounds of P-FRP tasks Online publication date: Thu, 31-Jul-2014
by Chaitanya Belwal; Yuanfeng Wen; Albert M.K. Cheng
International Journal of Embedded Systems (IJES), Vol. 6, No. 1, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com