A Constraint-based Decentralized Task Routing Approach to Large-Scale Scheduling in Cloud Environment

This article mainly focused on cloud scheduling with constraint based decentralized task routing. The job of scheduling tasks across various nodes in a hierarchical network scenario is an exigent problem. The concept of decentralized distribution scheme proposed in base paper is time-consuming since it has to compute the availability function for each and every node. In this paper we proposed a CBDA (Constraint Based Decentralized Algorithm) which offers the expediency of being quick and “Make-span minimization policy” is implemented to reduce the completion time of the currently executing nodes. In our presumption, the submission nodes are semi centralized and it can store the availability information of the nodes or routers within its area. This paper considers the allotment of the tasks to the execution nodes which are unoccupied by other tasks. The dynamic allotment of the tasks to the nodes in the tree based approach is the major criteria for selecting the desired node. This paper proposes a trade-off between fully centralized model and the decentralized model by implementing a new constraint based decentralization scheme which saves time consumption and enhances efficiency of task scheduling.