Publications:Timing Analysis of the Priority based FRP System

Jump to: navigation, search

Do not edit this section


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 PFRP uses fixed priority scheduling for tasks. The system allows for the currently executing lower priority tasks to be rolled back to restoring theoriginal state and allowing a higher priority task to run. These aborted tasks will restart again when notasks of higher priority are in the queue. Since PFRP 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.*


Keep all hand-made modifications below

Title Timing Analysis of the Priority based FRP System
Author Chaitanya Belwal and Albert M.K. Cheng and Walid Taha and Angela Zhu
Year 2008
PublicationType Conference Paper
Conference IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) WIP Session, St. Louis, MO, USA, April 22-24
Diva url