hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Release Offset Bounds for Response Time Analysis of P-FRP using Exhaustive Enumeration
Dept. of Computer Science, University of Houston, Houston, USA.
Dept. of Computer Science, University of Houston, Houston, USA.
Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
2011 (English)In: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Piscataway, N.J.: IEEE Press, 2011, 950-957 p.Conference paper, Published paper (Refereed)
Abstract [en]

Functional*Reactive Programming (FRP) is a declarative approach to modeling and building reactive systems. Priority-based FRP (P-FRP) is a formalism of FRP that guarantees real-time response. Unlike the classical preemptive model1 of real-time systems, preempted tasks in PFRP are aborted and have to restart when higher priority tasks have completed. Due to this abort-restart of nature of preemption, there is no single critical instant of release that leads to Worst-Case Response Time (WCRT) of lower priority P-FRP tasks. At this time, the only method for determining the WCRT is through an exhaustive enumeration of all release offsets of higher priority tasks between the release and deadline of the lower priority task. This makes the computational cost of WCRT dependent on the deadline of a task, and when such deadlines are large the computational costs of this technique make it infeasible even for small task sets. In this paper, we show that the release offsets of higher priority tasks have a lower and upper bound and present techniques to derive these bounds. By enumerating only those release offsets while lie within our derived bounds the number of release scenarios that have to be enumerated is significantly reduced. This leads to lower computational costs and makes determination of the WCRT in P-FRP a practically feasible proposition. © 2011 IEEE.

Place, publisher, year, edition, pages
Piscataway, N.J.: IEEE Press, 2011. 950-957 p.
Keyword [en]
Functional programming, real-time system, schedulability analysis, response time, exhaustive enumeration
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20921DOI: 10.1109/TrustCom.2011.131Scopus ID: 2-s2.0-84856140909ISBN: 978-1-4577-2135-9 OAI: oai:DiVA.org:hh-20921DiVA: diva2:588236
Conference
ICESS'11 International Conference on Embedded Software and Systems 10th IEEE Int. Conf. on Trust, Security and Privacy in Computing and Communications, TrustCom 2011, 8th IEEE Int. Conf. on Embedded Software and Systems, ICESS 2011, 6th Int. Conf. on Frontier of Computer Science and Technology, FCST 2011, Changsha, China, 16-18 November
Note

Article number: 6120924

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2013-02-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
By organisation
Centre for Research on Embedded Systems (CERES)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 116 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf