View source for Publications:E-FRP with Priorities

<div style='display: none'>
== Do not edit this section ==
</div>
{{PublicationSetupTemplate|Author=Roumen Kaiabachev, Walid Taha, Angela Zhu
|PID=397832
|Name=Kaiabachev, Roumen (Rice University, Houston, TX, USA);Taha, Walid [waltah] (Rice University, Houston, TX, USA);Zhu, Angela (Rice University, Houston, TX, USA)
|Title=E-FRP with Priorities
|PublicationType=Conference Paper
|ContentType=Övrigt vetenskapligt
|Language=eng
|Journal=
|JournalISSN=
|Status=
|Volume=
|Issue=
|HostPublication=EMSOFT '07 : Proceedings of the Seventh ACM and IEEE International Conference on Embedded Software
|Conference=ESWEEK - Embedded Systems Week; EMSOFT’07, September 30–October 3, 2007, Salzburg, Austria
|StartPage=221
|EndPage=230
|Year=2007
|Edition=
|Pages=
|City=New York, NY
|Publisher=ACM Press
|Series=
|SeriesISSN=
|ISBN=978-1-59593-825-1
|Urls=
|ISRN=
|DOI=http://dx.doi.org/10.1145/1289927.1289963
|ISI=
|PMID=
|ScopusId=2-s2.0-38849209815
|NBN=urn:nbn:se:hh:diva-14479
|LocalId=
|ArchiveNumber=
|Keywords=Event-driven programming;Resource-aware programming
|Categories=Datavetenskap (datalogi) (10201)
|ResearchSubjects=
|Projects=
|Notes=
|Abstract=<p>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.</p>
|Opponents=
|Supervisors=
|Examiners=
|Patent=
|ThesisLevel=
|Credits=
|Programme=
|Subject=
|Uppsok=
|DefencePlace=
|DefenceLanguage=
|DefenceDate=
|CreatedDate=2011-02-15
|PublicationDate=2011-04-06
|LastUpdated=2013-01-15
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:397832}}
<div style='display: none'>

== Keep all hand-made modifications below ==
</div>{{PublicationDisplayTemplate}}