Preemptive job scheduling in star graph networks

In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in /spl Oscr/(n log n) time when n is the number of jobs.