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
Timing Analysis of the Priority based FRP System
Department of Computer Science, University of Houston, Houston, Texas, USA.
Department of Computer Science, University of Houston, Houston, Texas, USA.
Department of Computer Science, University of Houston, Houston, Texas, USA.
Department of Computer Science, University of Houston, Houston, Texas, USA.
2008 (English)In: Proceedings Work-In-Progress Session of the 14th Real-Time and Embedded Technology and Applications Symposium: 22-24 April, 2008: St. Louis, USA / [ed] Ying Lu, Lincoln, NE: University of Nebraska–Lincoln, Computer Science and Engineering , 2008, 89-92 p.Conference paper, Published paper (Refereed)
Abstract [en]

Kaiabachev, Taha, Zhu [1] have presented a declarative programming paradigm called Functional Reactive Programming, which is based on behaviors and events. An improved system called P-FRP uses fixed priority scheduling for tasks. The system allows for the currently executing lower priority tasks to be rolled back to restoring the original state and allowing a higher priority task to run. These aborted tasks will restart again when no tasks of higher priority are in the queue. Since P-FRP has many applications in the real time domain it is critical to understand the time bound in which the tasks which have been aborted are guaranteed to run, and if the task set is schedulable. In this paper we provide an analysis of the unique execution paradigm of the P-FRP system and study the timing bounds using different constraint variables.

1. R. Kaiabachev, W. Taha, A. Zhu, E-FRP with priorities, In the Proceedings of the 7th ACM & IEEE international conference on Embedded software, Pages: 221 - 230, 2007.

Place, publisher, year, edition, pages
Lincoln, NE: University of Nebraska–Lincoln, Computer Science and Engineering , 2008. 89-92 p.
Series
Technical Report, TR-UNL-CSE-2008-0003
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20961OAI: oai:DiVA.org:hh-20961DiVA: diva2:588255
Conference
14th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) WIP Session, St. Louis, MO, USA, April 22-24, 2008
Note

This work is supported in part by the U.S. National Science Foundation under Award Nos. 0720856 and 0720857.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2015-05-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Full textFull text in proceedings

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Total: 97 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