Priority based Distributed Job Processing System

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 wit...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2012-01, Vol.60 (17), p.13-17
Main Authors: Rao, P Srinivasa, C Rao, V P, Govardhan, A
Format: Article
Language:English
Subjects:
Constrictions
Handles
Handling
Materials handling
Microprocessors
Networks
Priorities
Queues
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0975-8887
0975-8887
DOI:10.5120/9783-4319