Email this article 
Open Access
Subscription or Fee Access
Adaption of Optimal Evaluation Methods in Resource Utilization by Service Providers with Grid Approaches
Abstract
A Optimal Grid should have three characteristics: It should not allow resource providers to increase prices continuously,No provider should reject to provide resources to certain type of jobs due to risk associated in executing them, Resource Providers and Consumers are allowed to take autonomous decisions. Here we give different levels to jobs to be executed depending upon the application type to which they belong and resource quota is given for different type of jobs while allocating resources by a provider so that starvation of particular type jobs can be avoided. There will be no force on providers regarding the price for which they should offer their resources, but at the same time the price cannot be increased to any extent by providers because if no consumer is selecting him to offer his resources he should definitely get the price down. The two objectives identified are to schedule all type of jobs for execution and to minimize fairness deviation among resources. We present a scheduling scheme, which utilizes a peer-to-peer decentralized scheduling framework. Here we need not adjust competition degree explicitly , the provider automatically decreases his competition degree depending upon his capacity and number of jobs he is offered and automatically increases competition degree when jobs offered is more than his capacity.
Keywords
References
Proc. IEEE, special issue on grid computing, M. Parashar and C.A. Lee,eds., vol. 93, no. 3, pp. 479-714, 2005.
R. Buyya, D. Abramson, and J. Giddy, “Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid,” Proc. Fourth Int’l Conf. High-Performance Computing in the Asia-Pacific Region (HPC Asia), 2000.
O. Regev and N. Nisan, “The POPCORN Market: An OnlineMarket for Computational Resources,” Proc. First Int’l Conf.Information and Computation Economies (ICE ’98), pp. 148-157, 1998.
R. Wolski, J.S. Plank, T. Bryan, and J. Brevik, “G Commerce: Market Formulations Controlling Resource Allocation on the Computational Grid,” Proc. 15th Int’l Parallel and DistributedProcessing Symp. (IPDPS ’01), p. 8, 2001.
K. Lai, L. Rasmusson, E. Adar, L. Zhang, and B.A. Huberman,Tycoon:An Implementation of a Distributed, Market-BasedResource Allocation System,” Multiagent and Grid Systems, vol. 1,no. 3, pp. 169-182, 2005.
P. Padala, C. Harrison, N. Pelfort, E. Jansen, M.P. Frank, and C.Chokkareddy, “OCEAN: The Open Computation Exchange and Arbitration Network, a Market Approach to Meta Computing,”Proc.Second Int’l Symp. Parallel and Distributed Computing,pp. 185-192,2003.
J. Sherwani, N. Ali, N. Lotia, Z. Hayat, and R. Buyya, “Libra:A Computational Economy-Based Job Scheduling System forClusters,”Software: Practice and Experience, vol. 34, no. 6, pp. 573-590, 2004.
D.E. Irwin, L.E. Grit, and J.S. Chase, “Balancing Risk and Rewardin a Market-Based Task Service,” Proc. 13th Int’l Symp. High-Performance Distributed Computing (HPDC ’04), pp. 160-169, 2004.
R. Gupta, S. Sekhri, and A.K. Somani, “CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 11,pp. 1306-1320, Nov. 2006.
F. Yun, C. Jeffrey, C. Brent, S. Stephen, and V. Amin, “SHARP: An Architecture for Secure Resource Peering,” Proc. 19th ACM Symp.Operating Systems Principles (SOSP ’03), pp. 133-148, 2003.
Y. Zhu, L. Xiao, L.M. Ni, and Z. Xu, “Incentive-Based P2PScheduling in Grid Computing,” Proc. Third Int’l Conf. Grid and Cooperative Computing (GCC ’04), p. 209, 2004.
L. Xiao, Y. Zhu, L.M. Ni, and Z. Xu, “GridIS: An Incentive Based Grid Scheduling,” Proc. 19th IEEE Parallel and Distributed ProcessingSymp.(IPDPS ’05), p. 65, 2005.
Anderson, A. Nadalin, B. Parducci, D. Engavatow, H. Lockhart, M.Kudo,P. Humenn, S. Godik, S. Abderson, S. Crocker, and T. Moses.eXtensible Access Control Markup Language (XACML) Version 1.0.Technical report, OASIS, 2003.
Jorge Andrade and Jacob Odeberg. HapGrid: a resource for haplotype reconstructionand analysis using the computational Grid power in Nordugrid.HGM2004: New Technologies in Haplotyping and Genotyping, April 2004.
Andrieux, K. Czajkowski, A. Dan, K. Keahey, H. Ludwig, J. Pruyne,J.Rofrano, S. Tuecke, and M. Xu. Web services agreement specification (wsagreement).Technical report, Global Grid Forum, 2005.
Barmouta and R. Buyya. Gridbank: A grid accounting services architecture(gasa) for distributed systems sharing and integration. In Int.Parallel and Distributed Processing Symposium (IPDPS’03), Nice,France, 2003. IEEE.
F. Berman, G Fox, and A.J.G. Hey, editors. Grid Computing: Making the Global Infrastructure a Reality. John Wiley & Sons, 2003.
S. Blake, D. Black, M. Carlson, E. Davis, W. Zheng, and W. Weiss. Rfc 2475:An architecture for differentiated services. Technical report, IETF,1998.
Diana Bosio, James Casey, Akos Frohner, Leanne Guy, Peter Kunszt,ErwinLaure, Sophie Lemaitre, Levi Lucio, Heinz Stockinger, Kurt Stockinger,William Bell, David Cameron, Gavin McCance, Paul Millar,Joni Hahkala,Niklas Karlsson, Ville Nenonen, Mika Silander, Olle Mulmo, Gian-Luca Volpato,Giuseppe Andronico, Federico DiCarlo, Livio Salconi, Andrea Domenici,Ruben Carvajal-Schiaffino, and Floriano Zini. Next-generation eu datagriddata management services. In Proceedings of Computing in High Energy and Nuclear Physics, La Jolla, CA, USA, March 2003.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.