Synthesizing a Multiprocessor System for Scheduling with Interruptions and Execution Intervals

Аннотация

A problem of finding processor performances in a multiprocessor system is studied such that an admissible schedule with interruptions exists for the given set of jobs with execution intervals. Cases are considered when (1) the amounts of jobs are fixed and (2) linearly depend on the amount of extra resources allocated for them; (3) processor performances are bounded above and below. In all three cases, the original problem is reduced to the system of linear inequalities. The algorithm for finding Pareto optimal solutions is described.