ON NON-PREEMPTIVE PERIODIC SCHEDULING.

The periodic real-time scheduling problem for a time-shared m-processor computing system is studied. The objective is to schedule a set of periodically occurring time-critical tasks such that all prescribed deadlines are met. Each task J//i to be scheduled requests C//i units of computation time for every T//i units of time, and each request of J must be executed, without interruption, till its completion before the next request of the same task occurs. The task systems with the properties that T//i equals kT//i// minus //1, 2 less than equivalent to i less than equivalent to n, k greater than equivalent to 2, are investigated. Optimal algorithms, together with necessary and sufficient conditions that will guarantee the existence of a feasible schedule, are developed and analyzed.