QoS Oriented Failure Rate-Cost and Time Algorithm for Compute Grid

摘要

Grids provide infrastructure for intensive computations and storage of shared large scale database across a distributed environment. Although grid technologies enable the sharing and utilization of widespread resources, the performance of parallel applications on the Grid is sensitive to the effectiveness of the scheduling algorithms used. Scheduling is the decision process by which application components are assigned to available resources to optimize various performance metrics. In this paper we discuss how economy and quality of service plays important role in scheduling resources. Various Grid scheduling algorithms are discussed from different points of view, such as static vs. dynamic policies, objective functions, Quality of service constraints, strategies dealing with dynamic behavior of resources and so on. After discussing existing algorithms a new Failure rate-cost and time optimization algorithm is been proposed which will guarantee quality of service.