MODELING AND SIMULATION OF DYNAMIC JOB SCHEDULING IN MULTIPROCESSOR SYSTEMS

Realizing the full potential of a multiprocessor system requires a goo d job scheduling algorithm. We propose a new job scheduling algorithm, called K-FCFS, which is an extension of the FCFS algorithm. We develo ped an approximate analytic model for this algorithm by decomposing th e system into two interdependent submodels: (i) queue submodel. and (i i) processor submodel. The overall model is solved using an iterative technique. Validation with simulation results shows the errors to be w ithin acceptable limits. The impact of key parameters is studied. The proposed algorithm is found to perform better than the FCFS algorithm.