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
E-FRP with Priorities
Rice University, Houston, TX, USA.
Rice University, Houston, TX, USA.ORCID iD: 0000-0003-3160-9188
Rice University, Houston, TX, USA.
2007 (English)In: EMSOFT '07: Proceedings of the Seventh ACM and IEEE International Conference on Embedded Software / [ed] Christoph M Kirsch & Reinhard Wilhelm, New York, NY: ACM Press, 2007, p. 221-230Conference paper, Published paper (Other academic)
Abstract [en]

E-FRP is declarative language for programming resourcebounded,event-driven systems. The original high-level semanticsof E-FRP requires that each event handler executeatomically. This requirement facilitates reasoning about EFRPprograms, and therefore it is a desirable feature of thelanguage. But the original compilation strategy requiresthat each handler complete execution before another eventcan occur. This implementation choice treats all eventsequally, in that it forces the upper bound on the time neededto respond to any event to be the same. While this is acceptablefor many applications, it is often the case that someevents are more urgent than others.In this paper, we show that we can improve the compilationstrategy without altering the high-level semantics.With this new compilation strategy, we give the programmermore control over responsiveness without taking awaythe ability to reason about programs at a high level. Theprogrammer controls responsiveness by declaring prioritiesfor events, and the compilation strategy produces code thatuses preemption to enforce these priorities. We show thatthe compilation strategy enjoys the same properties as theoriginal strategy, with the only change being that the programmerreasons modulo permutations on the order of eventarrivals.

Place, publisher, year, edition, pages
New York, NY: ACM Press, 2007. p. 221-230
Keywords [en]
Event-driven programming, Resource-aware programming
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hh:diva-14479DOI: 10.1145/1289927.1289963Scopus ID: 2-s2.0-38849209815ISBN: 978-1-59593-825-1 OAI: oai:DiVA.org:hh-14479DiVA, id: diva2:397832
Conference
ESWEEK - Embedded Systems Week; EMSOFT’07, September 30–October 3, 2007, Salzburg, Austria
Available from: 2011-04-06 Created: 2011-02-15 Last updated: 2021-05-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Taha, Walid

Search in DiVA

By author/editor
Taha, Walid
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 141 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