QoS oriented failure rate-cost and time algorithm for compute grid

Authors:
Darshana Shah;Swapnali Mahadik
Affiliations:
Fr. Conceicao Rodrigues College of engineering, Mumbai, India;Fr. Conceicao Rodrigues College of engineering, Mumbai, India
Venue:
Proceedings of the International Conference on Advances in Computing, Communication and Control
Year:
2009

Citing 2
Cited 0

Motivating Computational Grids

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.