Title :
Preemptive job scheduling in star graph networks
Author :
Latifi, Shahram ; Srimani, Pradip K.
Author_Institution :
Dept. of Electr. Eng., Nevada Univ., Las Vegas, NV, USA
Abstract :
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 𝒪(n log n) time when n is the number of jobs
Keywords :
computational complexity; multiprocessor interconnection networks; processor scheduling; feasibility algorithm; job scheduling; preemptive job scheduling; preemptively scheduling; star graph networks; Computer science; Fault tolerance; Hypercubes; Intelligent networks; Multiprocessor interconnection networks; Network topology; Parallel algorithms; Partitioning algorithms; Processor scheduling; Scheduling algorithm;
Conference_Titel :
Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on
Print_ISBN :
0-7803-3529-5
DOI :
10.1109/ICAPP.1996.562908
