oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Comparative Analysis of Resource Discovery Approaches in Grid Computing  [cached]
Anju Sharma,Seema Bawa
Journal of Computers , 2008, DOI: 10.4304/jcp.3.5.60-64
Abstract: Grid technologies enable the sharing of a wide variety of distributed resources. To utilize these resources, effective Resource Management systems are needed. Resource Management system performs resource discovery to obtain information about the available resources. However, the complex and dynamic nature of grid resources make sharing and discovery, a challenging issue. Resource Discovery is initiated by a network application to find suitable resources with in the Grid. Resource Discovery process is critical for efficient resource allocation and management. For making the Resource Discovery more efficient and reliable large numbers of Approaches are there. This paper analyses some of existing Approaches for Resource Discovery, which can search for the preferred resources quickly and efficiently (return the correct results quickly and reduce network complexity) in Grid computing. Finally a qualitative comparison between these Approaches based on the factors that affect Grid Resource Discovery process, has been done and results are presented.
A Novel P2P Based Grid Resource Discovery Model  [cached]
Dong Chen,Guiran Chang,Xiuying Zheng,Dawei Sun
Journal of Networks , 2011, DOI: 10.4304/jnw.6.10.1390-1397
Abstract: Resource discovery is a fundamental problem in grid systems. Original approaches to provide grid resource discovery services are either centralized or hierarchical and proved to be inefficient when the scale of grid systems rapidly increases. A P2P network is a distributed system with the attributes of dynamicity and scalability. P2P systems have the same goal as grid systems: to share and exchange various resources. With their development, P2P systems and grid systems can be combined into a new system which has their attributes. In this paper, a novel hierarchical P2P based grid model based on the existing grid resource discovery models is discussed. In our model, Chord and Gnutella are selected as the typical protocols to form the virtual P2P layer. Through the experiment results, we argue that the 3C-2G model performs better than the other models in resource discovery among grids oriented to the same application field.
Scalable Grid Resource Discovery through Distributed Search  [PDF]
Fouad Butt,Syed Saadat Bokhari,Abdolreza Abhari,Alexander Ferworn
Computer Science , 2011, DOI: 10.5121/ijdps.2011.2501
Abstract: This paper proposes a simple and scalable web-based model for grid resource discovery for the Internet. The resource discovery model contains the metadata and resource finder web services. The information of resource finder web services is kept in the repositories that are distributed in the application layer of Internet. The resource finder web services will be discovered by sending queries to the repositories in a similar way as the DNS protocol. The underlying technology for implementation of the two architectures of this model is introduced. These architectures are: Direct and Centralized Web-Based Grid Resource Discovery. The resource discovery time is computed after simulating each of these models in GridSim. By performing scalability tests, we found that when increasing the load on the grid with more users and resources, the cost of our model in comparison to the grid resource discovery time is marginal.
Mincost-based grid resource discovery model
一种基于最小代价的网格资源发现模型

ZHANG Zhong-ping,JIA Qian,
张忠平
,贾 倩

计算机应用研究 , 2012,
Abstract: By introducing the concepts of domain and resource router, and setting the mincost function to group grid resources into domains and layering, this paper proposed a mincost-based hierarchical grid resource discovery model. Then it designed the algorithms for the resource router selection, resource register and resource search. Performance analysis and simulation experiments show that the mechanism has better scalability and fault tolerance, and less cost. The model can meet the dynamism, decentralization, and scalability of grid, simultaneously avoid the heterogeneous among different resources. It also has a good preformance on searching resources.
SCALABLE GRID RESOURCE DISCOVERY THROUGH DISTRIBUTED SEARCH  [PDF]
Fouad Butt,Syed Saadat Bokhari,Abdolrezza Abhari,Alexander Ferworn
Signal & Image Processing , 2011,
Abstract: This paper proposes a simple and scalable web-based model for grid resource discovery for the Internet.The resource discovery model contains the metadata and resource finder web services. The information ofresource finder web services is kept in the repositories that are distributed in the application layer ofInternet. The resource finder web services will be discovered by sending queries to the repositories in asimilar way as the DNS protocol. The underlying technology for implementation of the two architectures ofthis model is introduced.These architectures are: Direct and Centralized Web-Based Grid Resource Discovery. The resourcediscovery time is computed after simulating each of these models in GridSim.By performing scalability tests, we found that when increasing the load on the grid with more users andresources, the cost of our model in comparison to the grid resource discovery time is marginal.
A Hybrid Resource Discovery Model for Grid Computing  [PDF]
Mohammed Bakri Bashir,Muhammad Shafie Bin Abd Latiff,Aboamama Atahar Ahmed,Yahaya Coulibaly
International Journal of Grid Computing & Applications , 2011,
Abstract: Grid computing system is a generalized spread network-computing infrastructure with machines distributed across multiple organizations and administrative domains. The aim of a grid is to provide uniform access to heterogeneous resources and services such as computing, network and storage. Among different functions of a grid system, such as resource selection, resource discovery (RD), resource monitoring, and others, RD remains the most important issue in grid computing environment. The successof other functions depends on RD, especially in large grid systems. RD involves finding suitable resources that match user requirements. In this paper, the results of a review of current RD schemes are presented. Additionally, a novel RD technique which is under evaluation is proposed. Thus, the exact contribution of this paper is a review of the state-of-art of resource discovery techniques in grid computing.
Customized way of Resource Discovery in a Campus Grid  [PDF]
Damandeep Kaur,Lokesh Shandi,Jyotsna Sengupta
Computer Science , 2010,
Abstract: Campus Grid computing involves heterogeneous resources of an organization working in collaboration to sol e the problems that cannot be addressed by a single resource. However, basic problem for Campus Grid users is how to disco er the best resources required for the particular type of a job. There are various approaches using which Grid Discovery can be performed. This paper pro ides the grid resource discovery solutions for Campus Grid using Globus Toolkit which will enable us to customize the resource information according to the requirements based on the jobs to be run on the Campus Grid and present it in our own format. Here we propose building up our own service on top of globus MDS in order to process the information provided by MDS and use it in our Campus Grid Portal.
Multidomain Hierarchical Resource Allocation for Grid Applications  [PDF]
Mohamed Abouelela,Mohamed El-Darieby
Journal of Electrical and Computer Engineering , 2012, DOI: 10.1155/2012/415182
Abstract: Geographically distributed applications in grid computing environments are becoming more and more resource intensive. Many applications require the collaboration between different domains, may be independently administrated domains, to exchange data and share computing and storage resources. This collaboration should be done in a way that maintains the privacy of each participant domain. This calls for new architectures and approaches to deal with such multidomain environments. We propose a hierarchical-based architecture as well as multidomain hierarchical resource allocation approach. The resource allocation is performed in a distributed way among different domains such that each participant domain keeps its internal topology and private data hidden while sharing abstracted information with other domains. Both computing and networking resources are jointly scheduled while optimizing the application completion time taking into account data transfer delays. Simulation results show the scalability and feasibility of the proposed approach.
Semantic Resource Discovery with Resource Usage Policies in Grid Environment  [PDF]
Mandeep Kaur
International Journal of Computer Science Issues , 2012,
Abstract: Grid Schedulers aggregate the Grid resource that belongs to multiple administrative domains in a transparent manner. The Grid resource providers have their own local resources policies for the resources that reflects the restrictions on the resource what they are providing to the users. However, the Grid users are submitting the user application requirements with the Quality of Service (QoS) parameters. Currently, most of the existing Grid Schedulers discover the suitable Grid resources to execute the application based on the capability of the Grid resources using the keyword based matchmaking that leads to failure of finding out the potential resources. In this paper we have proposed the semantic based resource discovery mechanism that considers both the resource and local resource policy information. The proposed work is incorporated with semantic similarity calculator that will finds out the suitable and potential resources by considering the capability of resources and user required QoS parameter of deadline, job completion time and etc. It is integrated with the existing scheduler of Community Scheduling Framework (CSF) and tested for the various test cases in the real-time experimental setup. The various performance metrics such as hit/miss ratio, matchmaking time has been measured and analyzed. The results infer that the proposed work enhances the various performance measures compared to the conventional scheduler.
The Mechanism of Resource Dissemination and Resource Discovery for Computational Grid
计算网格的资源分发和发现机制

WU Xiu-Chuan JU Jiu-Bin,
武秀川
,鞠九滨

计算机科学 , 2003,
Abstract: Computational Grid is a large-scale distributed computing environment. The resource management of computational Grid discoveries and locates and allocates resources for users within the filed of grid environment as they have a request to these resources. The other case for that is co-operating in order to finish a large computing. These tasks are accomplished by the mechanism of resource dissemination and resource discovery of the resource management for the grid system. In this paper,some problems about resource dissemination and resource discovery are discussed and analyzed,further more future work about that is proposed.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.