AN IMPROVED FAULT TOLERANT SCHEDULING ALGORITHM FOR GRID ENVIRONMENT

Abstract

Framework processing is getting to be noticeably famous because of the spectacular development in the web, uniting the assets which makes the client to get quick answers for the substantial scale issues. This empowers sharing, determination and total of a wide assortment of topographically conveyed assets. As size of the applications develop, more utilization of assets for longer timeframes, may prompt expanding number of asset disappointments. At the point when disappointments happen, the execution of the employments that is allotted to the fizzled assets will be influenced. In this way, adaptation to internal failure is vital in such cases. To beat the disappointment, a booking calculation is suggested that relies upon another factor called planning pointer in choosing the assets. This factor contains the reaction time and the blame rate of network assets. The blame rate depends on the achievement and the disappointment of occupation execution. At whatever point a framework scheduler has employments to plan on network assets, it utilizes the booking pointer to create the planning choices. The asset with least planning pointer esteem gets the occupation.