We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparative Study of Parallel Scheduling Algorithm for Parallel Job

by Priya Singh, Zafruddin Quadri, Anuj Kumar
journal cover thumbnail

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

@article{ 10.5120/ijca2016908061,
author = { Priya Singh, Zafruddin Quadri, Anuj Kumar },
title = { Comparative Study of Parallel Scheduling Algorithm for Parallel Job },
journal = { International Journal of Computer Applications },
issue_date = { January 2016 },
volume = { 134 },
number = { 10 },
month = { January },
year = { 2016 },
issn = { 0975-8887 },
pages = { 10-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume134/number10/23949-2016908061/ },
doi = { 10.5120/ijca2016908061 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:33:49.519816+05:30
%A Priya Singh
%A Zafruddin Quadri
%A Anuj Kumar
%T Comparative Study of Parallel Scheduling Algorithm for Parallel Job
%J International Journal of Computer Applications
%@ 0975-8887
%V 134
%N 10
%P 10-14
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. S. N. Priyanka and P. S. Verma, “A Novel CPU Scheduling algorithm-Preemptive and Non Preemptive”, International Journal of Modern Engineering Research .Vol. 2, 2012.
  2. Pallab Banerjee ,Probal Banerjee Shweta Sonali Dhal, performance evaluation of a new proposed average Mid Max Round Robin (AMMRR) scheduling algorithm with Round Robin scheduling algorithm ,International Journal of Advanced Research in Computer Science and Software Engineering .Volume 2,Issue 8 August 2012.
  3. R. Mohany, H.S. behera ,DebashreeNayak, A new Proposed Dynamic Quantum with Re-Adjusted Round Robin scheduling algorithm and its performance analysis .International Journal of computer application .Vol 5,AUGUST 2010.
  4. SarojHiranwal,Dr. K.C. Roy ,Adaptive Round Robin scheduling using Shortest Burst Approach Based on Smart Time slice ,International Journal of Data Engineering (IJDE), Vol-2,Issue 3.
  5. Pabitra Pal Choudhury, Operating systems principals and Design, PHI Publication.
  6. Silberschatz, A. Peterson, J.L., and Galvin, P.B., Operating System concepts, (Addison Wesley 1991),(3rd Edition ),pp. 108-118.
  7. S. Swanson, K .Michelson, A, Schwerin and M.Oskin .WaveScalar. In the 36th Annual International Symposium on Microarchitecture (MICRO-36), 2003.
  8. U.Schwiegelshohn and R.Yahyapour . Analysis of first come first serve parallel job scheduling. In SODA ’98:Proceedings of the ninth annual ACM-SIAM symposium on Discrete Algorithm.USA 1998.
  9. U.Schwiegelshohn and R.Yahyapour .fairness in parallel job scheduling .Journal of Scheduling, 3(5):297-320, 2000.
  10. RadheShyam in Improved Mean Round Robin with Shortest Job First Scheduling. India Vol-4, Issue 7, 2014.
  11. Manish Kumar Mishra in An Improved Round Robin CPU Scheduling Algorithm Vol-3, No.6 2012.
  12. Imran Queshi in CPU Scheduling Algorithm Vol-05, Issue:04 ,Pages 1968-1973(2014)ISSN :0975-0290.
  13. Hong Jiang ,Tianwaei NI “PB-FCFS—A Task Scheduling Algorithm Based on FCFS and Backfilling Strategy For Grid Computing “.978-1-4244-5228-6/09
  14. S. Gomathi , “ An adaptive grouping base jobs scheduling in grid computing ICSCCN 2011”.
  15. Rakesh kumar Yadav, Abhishek Kumar Mishra, Naven Prakash, Himanshu Sharma an improved Round Robin Scheduling algorithm for CPU scheduling. Vol 2 No. 4, 2010, 1064-1066.
  16. Ajeet Singh, Priyanka Goyal, “ An optimized Round Robin Scheduling Algorithm for CPU scheduling “ ( IJCSE ) International Journal on Computer Science and Engineering, Vol-2,No.07,2010.
  17. “A.STenenbaum. 2008” Modern Operating Systems.Third Edition.Printice Hall, ISBN: 13:9780136006633.PP: 11004.
  18. Lalit Kishore and Dinesh Goyal, “Time Quantum Based Improved Scheduling Algorithms”. International Journal of Advance Research in Computer Science and Software Engineering. ISSN: 2277-128X. Volume 3, Issue 4, April 2013.
  19. AashnaBisht, “Enhanced Round Robin Algorithm for process scheduling using varying quantum precision”. IRAJ International Confrence-Proceedings of ICRIEST –AICEEMCS.29thDEC 2013.pune INDIA. ISBN:978-93-82702-50-4
  20. A. Kousalya et al, / (IJCSIT)International Journal of Computer Science and Information Technologies. Vol. 6 (3), 2015, 2687-2690
  21. R. Kettimuthu, V. Subramani, S. Srinivasan, T.B. Gopalsamy and P. Sadayappan.Selective preemption Stategies for parallel job scheduling. To appear in Proceedings of International Conference on Parallel
  22. Processing,2002.
  23. Alam, M., Khan, A., & Varshney, A. K., (In Press). A Review of Dynamic Scheduling Algorithms for Homogeneous and Heterogeneous System. In proceedings of the Springer, International conference of Computer Society of India (CSI) of Transactions on ICT.
  24. Singh, K., Alam, M., & Sharma, S. K. (2015). A Survey of Static Scheduling Algorithm for Distributed Computing System. Interconnection Network. International Journal of Computer Applications 129 (2), pp.25 – 30.
  25. Alam, M., & Varshney, A. K. (2015). A Comparative Study of Interconnection Network. International Journal of Computer Applications 127 (4), pp.37 – 43.
  26. Mahfooz Alam and Ankur K. Varshney “A New Approach of Dynamic Load Balancing Algorithm for Homogeneous Multiprocessor System”, International Journal of Applied Evolutionary Computation (IJAEC) 2015. (Accepted).
Index Terms

Computer Science
Information Sciences

Keywords

FCFS parallel processing Static Job Speedup Interdependency of graph

Powered by PhDFocusTM