International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 134 - Number 10 |
Year of Publication: 2016 |
Authors: Priya Singh, Zafruddin Quadri, Anuj Kumar |
10.5120/ijca2016908061 |
Priya Singh, Zafruddin Quadri, Anuj Kumar . Comparative Study of Parallel Scheduling Algorithm for Parallel Job. International Journal of Computer Applications. 134, 10 ( January 2016), 10-14. DOI=10.5120/ijca2016908061
Job scheduling is a technique which is applied on parallel computing systems, whose main focus is to measure the parameters of a system. For job scheduling menu algorithms are used in technical line such as priority based FCFS reservation, backfilling, improved round robin scheduling all are used to measure the parameters of a parallel computing. Since they all have some limitations and advantages to use all processors equally .This paper describes the various job scheduling algorithm such as priority based FCFS, PFCFS1, PFCFS2, PFCFS3 of static job scheduling algorithm.