International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 122 - Number 9 |
Year of Publication: 2015 |
Authors: Deepti Gupta, Verender Singh Madra |
10.5120/21730-4895 |
Deepti Gupta, Verender Singh Madra . Analysis the Performance of CDS Algorithm with Constrained Price and Deadline in Grid Computing. International Journal of Computer Applications. 122, 9 ( July 2015), 29-34. DOI=10.5120/21730-4895
Clusters, grids and P2P networks enable aggregation of resources and creation of virtual enterprises for solving large scale problems. Resource planning in Grid computing is an advanced task owing to the heterogeneous and dynamic nature of the resources. Trade based scheduling is more attractive from point of view of business. This paper describes the design, implementation and evaluation of an economic strategy based Grid resource scheduling mechanism. It takes into account the architectural features, special requirements of computational Grids with ensuring economic efficiency. The design is concentrated on two goals. Mainly, the Grid computing environment is regarded as a distributed two-sided trade market; competition occurs on both sides of the market, users and resource providers simultaneously. Next, it needs to provide an effective scheduling environment that must have the ability to offer resources with minimal delay to jobs. In this dissertation, a framework for economic strategy based Grid scheduling is proposed. The framework entities such as users, broker and resources employ Continuous Double Scheduling Algorithm to decide the final values of prices and deadlines. We evaluated the performance of the different strategies of CDS with respect to each other and with the Offer Based Scheduling.