Uniprocessor scheduling under time-interval constraints

This paper proposes a new task model for expressing timing constraints that do not naturally admit expression in terms of deadlines and periods. In our task model, jobs are divided into segments A, B and C which must execute following this order. Segment A is responsible for performing its computations and compute a time-interval wherein segment B should execute to fulfill some application constraints. Segment C is released after segment B has finished. We consider the execution of B as valid if performed inside that time-interval, otherwise, its contribution may be considered valueless to its task. The model uses benefit functions to express when a given action should be performed for the maximum benefit. We adapt some scheduling approaches from the literature and present a feasibility test for our scheduling problem.