Corpus ID: 26885835

Grid Resource Discovery using Tree Data Structure for Multi-Trait Requests

@inproceedings{Khanli2012GridRD,
  title={Grid Resource Discovery using Tree Data Structure for Multi-Trait Requests},
  author={Leyli Mohammad Khanli and Saeed Kargar and Ali Kazemi Niari},
  year={2012}
}
Grid is an extensive environment in which different resources are dispersed geographically. A user may need a resource or a combination of resources in order to solve a problem. The task to find such a resource is borne by resource discovery algorithms. Therefore, the resource disco very algorithms are of high importance in grids. The met hods proposed to resource discovery so far have not sugg ested a method to discover several resources simultaneously in the form of a request. In this paper… Expand

Figures from this paper

References

SHOWING 1-10 OF 20 REFERENCES
Using Matrix indexes for Resource Discovery in Grid Environment
There are many resources and services in grid environment which may be distributed geographically. So, resource discovery methods with lower update and discovery costs are of vital significance. TheExpand
FRDT: Footprint Resource Discovery Tree for grids
TLDR
The algorithm is compared with previous algorithms using simulations and results and it is shown that the number of nodes visited in the resource discovery algorithm is less than that for other algorithms, and the difference would be significant with an increase in thenumber of nodes. Expand
A resource discovery tree using bitmap for grids
TLDR
The experimental results show the number of visited nodes and performed operations, as a result of query forwarding, are smaller than in comparable approaches and the cost of update in the proposed algorithm is also lower, therefore, the algorithm can effectively improve the system efficiency for resource discovery. Expand
A time-to-live based reservation algorithm on fully decentralized resource discovery in Grid computing
TLDR
It is found that the performance of the algorithm seems to perform well only in the environment with enough resources, comparing with the density of requests in the network, and the algorithm that finds the available matching resource whose attributes are closest to the required attribute can improve the resource utilization. Expand
Peer-to-peer systems for discovering resources in a dynamic grid
TLDR
This paper presents two P2P systems based on Routing Indexes, which are used to efficiently route queries and update messages in the presence of highly variable data, and discusses the results of extensive simulation studies aimed at assessing the performance and scalability of the proposed approaches. Expand
Grid Resource Discovery Using Semantic Communities
TLDR
This paper proposes a semantic community approach to assisting the efficient resource discovery and query in grids and shows how searching the girds can take advantage of semantic communities to reduce the searching cost and improve the quality of search results. Expand
Evaluating Resource Discovery Protocols for Hierarchical and Super-Peer Grid Information Systems
  • C. Mastroianni, D. Talia, O. Verta
  • Computer Science
  • 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)
  • 2007
TLDR
Performance analysis shows that the hierarchical model is valuable for small and medium sized grids, while the super-peer model is better suited for very large grids. Expand
Decentralized Grid Resource Discovery Based on Resource Information Community
TLDR
A decentralized Grid resource discovery solution is presented in this paper, in which information nodes with the same type of registered resources are organized together to form resource information communities (RIC), and efficient navigation between different communities is achieved by a DHT P2P based bootstrap network. Expand
Matchmaking: distributed resource management for high throughput computing
  • Rajesh Raman, M. Livny, M. Solomon
  • Computer Science
  • Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244)
  • 1998
TLDR
The classified advertisement (classad) matchmaking framework is developed and implemented, a flexible and general approach to resource management in distributed environment with decentralized ownership of resources. Expand
Dividing Grid Service Discovery into 2-Stage Matchmaking
TLDR
A Grid Service Discovery Model Based on 2-Stage Matching which can enable more effective service discovery is proposed and initial simulation results show that the model can effectively aggregate the service information and avoid the workload caused by frequent dynamic updating. Expand
...
1
2
...