CFP last date
20 January 2025
Reseach Article

Priority based Distributed Job Processing System

by P. Srinivasa Rao, V. P. C Rao, A. Govardhan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 60 - Number 17
Year of Publication: 2012
Authors: P. Srinivasa Rao, V. P. C Rao, A. Govardhan
10.5120/9783-4319

P. Srinivasa Rao, V. P. C Rao, A. Govardhan . Priority based Distributed Job Processing System. International Journal of Computer Applications. 60, 17 ( December 2012), 13-17. DOI=10.5120/9783-4319

@article{ 10.5120/9783-4319,
author = { P. Srinivasa Rao, V. P. C Rao, A. Govardhan },
title = { Priority based Distributed Job Processing System },
journal = { International Journal of Computer Applications },
issue_date = { December 2012 },
volume = { 60 },
number = { 17 },
month = { December },
year = { 2012 },
issn = { 0975-8887 },
pages = { 13-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume60/number17/9783-4319/ },
doi = { 10.5120/9783-4319 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:07:12.078801+05:30
%A P. Srinivasa Rao
%A V. P. C Rao
%A A. Govardhan
%T Priority based Distributed Job Processing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 60
%N 17
%P 13-17
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposes a framework for implementing a Priority Based Job processing system that has the capability to specify the priority of a job at the time of submission, execute the job at as per the priority at the job processor end. The framework will scale horizontally as well as vertically without any change in the components. This feature is achieved through simple configuration. The advantages of such a framework over other implementations is that we are using a global queue where in the processors can be dynamically added or removed without affecting the overall processing of jobs. This makes it flexible enough for any processor to handle any type of job without any restriction. While, it is still possible to impose restrictions on specific processors handling special type of jobs that is implemented as a configuration option and does not in any way impose restrictions on the processors. Therefore, new types of processors can seamlessly added to the entire network of processors without affecting the existing processors.

References
  1. Ambika Prasad Mohanty (Senior Consultant, Infotech Enterprises Ltd. ), P Srinivasa Rao (Professor in CSC, Principal, YPR College of Engineering & Technology), Dr A Govardhan (Professor in CSC, Principal, JNTUH College of Engineering), Dr P C Rao (Professor in CSC, Principal, Holy Mary Institute of Technology & Science), Framework for a Scalable Distributed Job Processing System.
  2. Ambika Prasad Mohanty (Senior Consultant, Infotech Enterprises Ltd. ), P Srinivasa Rao (Professor in CSC, Principal, YPR College of Engineering & Technology), Dr A Govardhan (Professor in CSC, Principal, JNTUH College of Engineering), Dr P C Rao (Professor in CSC, Principal, Holy Mary Institute of Technology & Science), A Distributed Monitoring System for Jobs Processing.
  3. J. H. Abawajy, S. P. Dandamudi, "Parallel Job Scheduling on Multi-cluster Computing Systems," Cluster Computing, IEEE International Conference on, pp. 11, Fifth IEEE International Conference on Cluster Computing (CLUSTER'03), 2003.
  4. Dahan, S. ; Philippe, L. ; Nicod, J. -M. , The Distributed Spanning Tree Structure, Parallel and Distributed Systems, IEEE Transactions on Volume 20, Issue 12, Dec. 2009 Page(s):1738 – 1751
  5. David P. Bunde1, and Vitus J. Leung, Scheduling restart able jobs with short test runs, Ojaswirajanya Thebe1, 14th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPDPS 2009, Rome, Italy, May 29, 2009
  6. Norman Bobroff, Richard Coppinger, Liana Fong, Seetharami Seelam, and Jing Xu, Scalability analysis of job scheduling using virtual nodes, 14th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPDPS 2009, Rome, Italy, May 29, 2009
  7. Y-T. Wang and R. J. T. Morris. Load Sharing in Distributed Systems. IEEE Trans. Computers, Vol. C-34, No. 3, 1985, pp. 204-215
  8. Java Message Service (JMS): http://java. sun. com/products/jms/
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Job Processing Priority Load Balancing Monitoring Recovery