Show simple item record

dc.contributor.advisor Taha, Walid
dc.creatorKaiabachev, Roumen Nikoleav
dc.date.accessioned 2018-12-03T18:31:42Z
dc.date.available 2018-12-03T18:31:42Z
dc.date.issued 2008
dc.identifier.urihttps://hdl.handle.net/1911/103595
dc.description.abstract E-FRP is declarative language for programming resource-bounded, event-driven systems. Its original high-level semantics requires that each event handler execute atomically. This facilitates reasoning about E-FRP programs, and therefore is a desirable feature of the language. However, the original compilation strategy requires that each handler complete execution before another event can occur. This implementation treats all events equally; it forces the upper bound on the time needed to respond to any event to be the same. While acceptable for many applications, often some events are more urgent than others. We show we can improve the compilation strategy without altering the high-level semantics. Thus, the programmer has more control over responsiveness without taking away the ability to reason about programs at a high level. The programmer controls responsiveness by declaring priorities for events, and the compilation strategy produces code that uses preemption to enforce these priorities. The compilation strategy enjoys the same properties as the original, with the change being that the programmer reasons modulo permutations on the order of event arrivals.
dc.format.extent 83 pp
dc.language.iso eng
dc.subjectComputer science
Applied sciences
dc.title A transactional compiler for E-FRP with priorities
dc.identifier.digital 304510124
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.callno THESIS COMP.SCI. 2008 KAIABACHEV
dc.identifier.citation Kaiabachev, Roumen Nikoleav. "A transactional compiler for E-FRP with priorities." (2008) Master’s Thesis, Rice University. https://hdl.handle.net/1911/103595.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record