In this paper we present work to combine FPS with off-line schedule
construction. It assumes a schedule has been constructed off-line for
a set of tasks to meet their complex constraints. Our method takes the
schedule and assigns the FPS attributes priority, offset, and period,
to the tasks, such that their runtime FPS execution matches the
off-line schedule. It does so by dividing the schedule into sequences
and deriving priority inequalities, which are then resolved by integer
linear programming. As FPS cannot reconstruct all schedules with
periodic tasks, we have to split tasks into several instances to
achieve consistent task attributes. Our algorithm constructs the
minimum number of such artifact tasks.
