E-FRP With Priorities
| dc.contributor.author | Inoue, Jun | |
| dc.contributor.author | Kaiabachev, Roumen | |
| dc.contributor.author | Taha, Walid | |
| dc.contributor.author | Zhu, Angela | |
| dc.date.accessioned | 2017-08-02T22:03:07Z | |
| dc.date.available | 2017-08-02T22:03:07Z | |
| dc.date.issued | 2009-07-15 | |
| dc.date.note | July 15, 2009 | |
| 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 | 27 pp | |
| dc.identifier.citation | Inoue, Jun, Kaiabachev, Roumen, Taha, Walid, et al.. "E-FRP With Priorities." (2009) https://hdl.handle.net/1911/96378. | |
| dc.identifier.digital | TR09-4 | |
| dc.identifier.uri | https://hdl.handle.net/1911/96378 | |
| dc.language.iso | eng | |
| dc.rights | You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s). | |
| dc.title | E-FRP With Priorities | |
| dc.type | Technical report | |
| dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1