Negotiation based advance reservation priority grid scheduler with a penal clause for execution failures

The utility computing in a grid demands much more adaptability and dynamism when certain levels of commitments are to be complied with. Users with distinct priorities are categorized on the basis of the types of organizations or applications they belong to and can submit multiple jobs with varying specific needs. The interests of consumers and the resource service providers must be equally watched upon, with focus on commercials too. At the same time, the quality of the service must be ascertained to a committed level, thus enforcing an agreement. The authors propose an algorithm for a negotiation based scheduler that dynamically analyses and assesses the incoming jobs in terms of priorities and requirements, reserves them to resources after negotiations and match-making between the resource providers and the users. The jobs thus reserved are allocated resources for future. The performance evaluation of the scheduler for various parameters was done through simulations. The results were found to be optimal after incorporating advance reservation with dynamic priority control over job selection, involving the impact of situations confronting resource failures introducing economic policies and penalties.