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 without any change in the components. This feature is achieved through simple configuration. The advantages of such a framework over other implementations is that the authors 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.