In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
will defend his dissertation proposal
Schedulability and Response Time Analysis of P-FRP Tasks
Functional Reactive Programming (FRP) is a declarative approach for modeling and building reactive systems. FRP has been shown to be an expressive formalism for building graphics, robotic, and vision applications. Priority-based FRP (P-FRP) is a formalism that allows preemption of executing programs and guarantees real-time response. Since functional programs cannot maintain state and mutable data, changes made by programs that are preempted have to be rolled back. Hence in P-FRP, a higher priority task can preempt the execution of a lower priority task, but the preempted lower priority task will have to restart after the higher priority task has completed execution. Current real-time research is focused on preemptive of non-preemptive models of execution and several state-of-the-art methods have been developed to analyze the real-time guarantees of these models. Unfortunately, due to its transactional nature where preempted tasks are aborted and have to restart, the execution semantics of P-FRP does not fit into the standard definitions of preemptive or non-preemptive execution. In this work, we review existing researches on P-FRP task scheduling, present our research that have been done on the P-FRP task scheduling, and propose our research plan as the the future work.
Date: Tuesday, April 26, 2016
Time: 1:00 PM
Place: PGH 501
Advisor: Prof. Albert M.K. Cheng
Faculty, students, and the general public are invited.