DYNAMIC INTELLIGENT DUAL QUEUE MATCHMAKING MODEL (DIDQMM) FOR RESOURCE ALLOCATION IN GRID ENVIRONMENT

Dr. J. Japhynth; Dr.J.R.Isaac Balasingh

Abstract

Grid resources can be distributed in different geographical regions. Matching jobs with distributed resources is one of the key issues in grid computing. In traditional matchmaking algorithms, matchmaking is based on static attributes; the dynamicity of the resource pool is not considered; the final ranks are not normalized and there is no fairness in allocation of jobs. This leads to incomplete jobs, job failures, user dissatisfaction and infinite waiting of jobs. Hence selecting appropriate resource for a job plays a vital role in resource allocation. The resource matching mechanism must consider the dynamically changing conditions both in terms of resource demand and resource availability. The request submitted by the user may have different constraints that can only be satisfied by certain types of resources with specific capabilities. Resource matching mechanisms must be able to match multiple jobs to a single resource, provided the resource has enough capacity to handle the matched jobs simultaneously. Resource matching mechanism should also consider multiple parameters in matchmaking process to select the best available resources such that the capacity consumed by the matched jobs does not exceed the total resource capacity. Therefore a novel Dynamic Intelligent Dual Queue Matchmaking Model (DIDQMM) is proposed, which considers static, dynamic and behavioral parameters and Dual Queues to allocate best resource to the job.

Keywords

Matchmaking, parameters, allocation, static, dynamic, Intelligent.

References

[1] Amos Brocco, Apostolos Malatras, Beat Hirsbrunner , “Proactive Information caching for efficient resource discovery in self structured grid”, BADS’09, June 19, 2009, Barcelona, Spain, Copyright 2009 ACM 978-1- 60558-584-0/09/06. [2] Anthony Sulistio, “Advance Reservation and Revenuebased Resource Management for Grid Systems” a thesis submitted in the Department of Computer Science and Software Engineering, The University of Melbourne, Australia. [3] Chien-Min Wanga, Hsi-Min Chenb, Chun-Chen Hsuc, Jonathan Lee, “Dynamic resource selection heuristics for a non-reserved bidding-based Grid Environment”, Future Generation Computer Systems, Vol. 26, pp. 183-197, 2010. [4] Clematis A, A. Corana, D. D'Agostino, A. Galizia, A. Quarati, “Job resource matchmaking on Grid through two-level benchmarking”, Future Generation Computer Systems, Vol. 26, Issue 8, pp. 1165-1179, Oct 2010. [5] Daniel C. Vanderster, Nikitas J. Dimopoulosb, Rafael Parra-Hernandez, Randall J. Sobie, “Resourceallocation on computational grids using a utility model and the knapsack problem”, Future Generation Computer Systems, Vol. 25, pp. 35-50, 2009. [6] Emir Imamagic, Branimir Radic, Dobrisa Dobrenic, “An Approach to Grid Scheduling by using CondorG Matchmaking Mechanism”, Journal of Computing and Information Technology – CIT, pp. 329–336, 2006. [7] Eunjoung E tal, “Scheduling scheme based on dedication rate in volunteer computing environment”, in the proceedings of the 4th International Symposium on Parallel and Distributed Computing, IEEE Computer Society Washington, DC, USA ©2005. [8] Gao Shu, Omer F. Rana, Nick J. Avis, Chen Dingfang, “Ontology-based semantic matchmaking approach”, Advances in Engineering Software, Vol. 38, pp. 59- 67,2007. [9] Guanfeng Liu, “Reputation Evaluation Framework based on Qos in Grid Economy Environments” Quantitative Quality of service, IGI global pages 219- 232. [10]Gustavo Sousa Pavani, Helio Waldman, “Coscheduling in Lambda Grid Systems by means of Ant Colony Optimization”, Future Generation Computer Systems, Vol. 25, pp. 257-265, 2009. [11]Han Yu, Xin Bai, Dan C. Marinescu, “Workflow management and resource Discovery for an intelligent grid”, Parallel Computing, Vol. 31, pp. 797-811, 2005. [12]Japhynth Jacob, Elijah Blessing Rajsingh, Isaac Balasingh Jesudason “Three Dimensional Matchmaking Model for optimal Allocation of Resources in Grid" European Journal of Scientific Research, Vol 67, Issue 1, pp. 128-136.ISSN: 1450- 216X/1450-202X, Dec 2011. [13] Li Chunlin, Li Layuan, “Utility-based Scheduling for Grid Computing under Constraints of Energy Budget and Deadline” Computer Standards & Interfaces, doi: 10.1016/j.csi.2008.12.004, 2008. [14] Martin KOLLÁR “Evaluation of real call set up success rate in GSM”, Acta Electrotechnical et Informatica, Vol. 8, No. 3, pp.53-56, 2008. [15] Michael Linch, “The similarity index and DNA fingerprinting”, Molecular Biological Evolution, Vol. 7, pp 478-484, 1990. [16] Rajiv Ranjan, Aaron Harwood and Rajkumar Buyya, “Case for Cooperative and incentive Based Federation of Distributed Clusters”, Future Generation Computer Systems, Vol.24, pp. 280-295, May 2007. [17] Rajkumar Buyya, Sudharshan Vazhkudai, “Compute Power Market: Towards a Market-Oriented Grid”, in the proceedings of the First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01), pp.574, ISBN: 0-7695-1010-8, 2001. [18] Seymour K, A YarKhan, S Agrawal, J. Dongarra, “NetSolve: Grid Enabling Scientific Computing Environments”, Grid Computing and New Frontiers of High Performance Processing, vol. 14, pp. 33-51, Netherlands, 2005. [19] Subodha Kumar, Kaushik Dutta, Vijay Mookerjee, “ Maximizing business value by optimal assignment of jobs to resources in grid computing”, European journal of scientific research, Vol. 194, Issue 3, pp. 856-872, April 2009. [20] Vadhiyar S, Dongarra J, Yarkhan A, “GrADSolve - RPC for High Performance Computing on the Grid", in the proceedings of 9th International Euro-Par Conference, Springer, LCNS 2790, pp. 394-403, August 26 -29, 2003. [21] Vijay, Chuang Liu K. Naik, Chuang Liu, Jonathan Wagner, “On-line Resource Matching for Heterogeneous Grid Environments”, IEEE International Symposium on Cluster Computing and the Grid, Vol. 2, pp. 607 – 614, 2005. [22] Vladimir V. Korkhova, Jakub T. Moscicki, Valeria V. Krzhizhanovskaya, “Dynamic workload balancing of parallel applications with user-level scheduling on the Grid”, Future Generation Computer Systems, Vol. 25, pp 268-34, 2009.

Cites this article as

D. J. J. . , D. B. , "DYNAMIC INTELLIGENT DUAL QUEUE MATCHMAKING MODEL (DIDQMM) FOR RESOURCE ALLOCATION IN GRID ENVIRONMENT", International Journal of Innovative Research in Engineering & Management (IJIREM), Vol-2, Issue-3, Page No-11 - 18, 2015. Available from: