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.

[1]  Yahui Zhu,et al.  On Job Scheduling on a Hypercube , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[3]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[4]  Yahui Zhu,et al.  An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube , 1990, Inf. Process. Lett..

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[7]  Shahram Latifi.  On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..

[8]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[9]  Selim G. Akl,et al.  A Parallel Algorithm for Computing Fourier Transforms on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

[10]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  Pradip K. Srimani,et al.  Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..

[12]  Dilip Sarkar,et al.  Optimal Broadcasting on the Star Graph , 1992, IEEE Trans. Parallel Distributed Syst..

[13]  Donald Ervin Knuth,et al.  The art of computer programming, , Volume III, 2nd Edition , 1998 .