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
Reseach Article

Dynamic Load Balancing With Central Monitoring of 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 65 - Number 21
Year of Publication: 2013
Authors: P. Srinivasa Rao, V. P. C Rao, A. Govardhan
10.5120/11212-6482

P. Srinivasa Rao, V. P. C Rao, A. Govardhan . Dynamic Load Balancing With Central Monitoring of Distributed Job Processing System. International Journal of Computer Applications. 65, 21 ( March 2013), 43-47. DOI=10.5120/11212-6482

@article{ 10.5120/11212-6482,
author = { P. Srinivasa Rao, V. P. C Rao, A. Govardhan },
title = { Dynamic Load Balancing With Central Monitoring of Distributed Job Processing System },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 65 },
number = { 21 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 43-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume65/number21/11212-6482/ },
doi = { 10.5120/11212-6482 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:20:30.547515+05:30
%A P. Srinivasa Rao
%A V. P. C Rao
%A A. Govardhan
%T Dynamic Load Balancing With Central Monitoring of Distributed Job Processing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 65
%N 21
%P 43-47
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a Dynamic load balancing with a centralized monitoring capability. The purpose of using a centralized monitoring feature was based on the idea that the computation in a environment may be distributed, but the status of each task or job must be available at a central location for monitoring and better scheduling. This also allows better management of the jobs. The framework also addresses the inherent need for uniform load distribution by allowing the dispatcher to check against the status of the processors before a job is dispatched for processing. This eliminates the need for processors to be burdened with the task of re-routing the job when they discover that they cannot process the received job. The basic requirement of assigning a priority and processing as per priority is built into the framework. As a proof of concept, we simulate the framework with a Java and JMS compliant OpenMQ based monitor, dispatchers, processors and a centralized database. The framework will have the capability to scale horizontally as well as vertically.

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. Pravanjan Choudhury, P. P. Chakrabarti, Rajeev Kumar Sr. , "Online Scheduling of Dynamic Task Graphs with Communication and Contention for Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, 17 Mar. 2011. IEEE computer Society Digital Library. IEEE Computer Society
  9. Sunita Bansal, and Chittaranjan Hota, Priority - based Job Scheduling in Distributed Systems, in Third International Conference (ICISTM 2009), Ghaziabad, INDIA, Sartaj Sahani et al. (Eds. ), Information Systems and Technology Management, Communications in Computer and Information Science Series, Vol 31, pp. 110-118, Springer-Verlag Berlin Heidelberg, March 2009.
  10. 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.
  11. Nazleeni Samiha Haron , Anang Hudaya , Muhamad Amin , Mohd Hilmi Hasan , Izzatdin Abdul Aziz , Wirdhayu Mohd Wahid, "Time Comparative Simulator for Distributed Process Scheduling Algorithms"
  12. 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