Results 21 - 30
of
38
Grid Oriented Storage devices
, 2007
"... Available online at www.sciencedirect.com ..."
(Show Context)
Snap-stabilizing Prefix Tree for Peer-to-peer Systems
, 2007
"... Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-s ..."
Abstract
- Add to MetaCart
(Show Context)
Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h+h ′ ) rounds, where h and h ′ are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n 2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice. Keywords: Peer-to-peer systems, Fault-tolerance, Self-stabilization, Snap-stabilization, Grid computing
Acyclic Graphs
"... of RAM, etc. DPTs solve this by performing parallel searches on different trees, then consolidating the results at the client side. We investigate how lookups can be made more scalable and efficient. In this paper, we propose a prefixbased lookup mechanism using a trie structure. In particular, we p ..."
Abstract
- Add to MetaCart
(Show Context)
of RAM, etc. DPTs solve this by performing parallel searches on different trees, then consolidating the results at the client side. We investigate how lookups can be made more scalable and efficient. In this paper, we propose a prefixbased lookup mechanism using a trie structure. In particular, we present two main contributions: (a) the DPG data structure which offers improved lookup performance over the Dynamic Prefix Tree (DPT) [3] by reducing the number of hops during node traversal; and (b) an lexical encoding scheme that allows numeric properties to be handled. With this encoding scheme, range queries with numeric properties require less messages as requests are sent to those nodes that are pertinent to the search.
Matchmaking through Economic-based Approaches in Ad-hoc Grids
"... In this paper we present an overview on different economic-based approaches for resource allocation in Grids. We consider economic models as a platform for matchmaking where consumer and producer of resources meet. The main contribution of the paper is to provide a deeper understanding of the choice ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper we present an overview on different economic-based approaches for resource allocation in Grids. We consider economic models as a platform for matchmaking where consumer and producer of resources meet. The main contribution of the paper is to provide a deeper understanding of the choices one can make as far as economic approaches for resource allocation is concerned.
Universidade Federal de Campina Grande
"... Abstract: eScience is rapidly changing the way we do research. As a result, many research labs now need non-trivial computational power. Grid and voluntary computing are well-established solutions for this need. However, not all labs can effectively benefit from these technologies. In particular, sm ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: eScience is rapidly changing the way we do research. As a result, many research labs now need non-trivial computational power. Grid and voluntary computing are well-established solutions for this need. However, not all labs can effectively benefit from these technologies. In particular, small and medium research labs (which are the majority of the labs in the world) have a hard time using these technologies as they demand high visibility projects and/or high-qualified computer personnel. This paper describes OurGrid, a system designed to fill this gap. OurGrid is an open, free-to-join, cooperative grid in which labs donate their idle computational resources in exchange for accessing other labs ’ idle resources when needed. It relies on an incentive mechanism that makes it in the best interest of participants to collaborate with the system, employs a novel application scheduling technique that demands very little information, and uses virtual machines to isolate applications and thus provide security. The vision is that OurGrid enables labs to combine their resources in a massive worldwide computing platform. OurGrid is in production since December 2004. Any lab can join it by downloading its software from www.ourgrid.org.
Self-Configuring Information Management for Large-Scale Service Overlays
"... Abstract — Service overlay networks (SON) provide important infrastructure support for many emerging distributed applications such as web service composition, distributed stream processing, and workflow management. Quality-sensitive distributed applications such as multimedia services and on-line da ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Service overlay networks (SON) provide important infrastructure support for many emerging distributed applications such as web service composition, distributed stream processing, and workflow management. Quality-sensitive distributed applications such as multimedia services and on-line data analysis often desire the SON to provide up-to-date dynamic information about different overlay nodes and overlay links. However, it is a challenging task to provide scalable and efficient information management for large-scale SONs, where both system conditions and application requirements can change over time. In this paper, we present InfoEye, a model-based self-configuring distributed information management system that consists of a set of monitoring sensors deployed on different overlay nodes. InfoEye can dynamically configure the operations of different sensors based on current statistical application query patterns and system attribute distributions. Thus, InfoEye can greatly improve the scalability of SON by answering information queries with minimum monitoring overhead. We have implemented a prototype of InfoEye and evaluated its performance using both extensive simulations and micro-benchmark experiments on PlanetLab. The experimental results show that InfoEye can significantly reduce the information management overhead compared with existing approaches. In addition, InfoEye can quickly reconfigure itself in response to application requirement and system information pattern changes. I.
Author manuscript, published in "N/P" RW-OGS: an Optimized Random Walk Protocol for Resource Discovery in Large Scale Dynamic Grids
, 2009
"... The information service is an important component of any Grid middleware as it helps users to find resources suitable for the execution of their applications. Traditional approaches based on data bases that have been designed for Grids of moderate size do not fit the requirements of wide-area large ..."
Abstract
- Add to MetaCart
(Show Context)
The information service is an important component of any Grid middleware as it helps users to find resources suitable for the execution of their applications. Traditional approaches based on data bases that have been designed for Grids of moderate size do not fit the requirements of wide-area large scale Grids composed of dozens of thousands highly dynamic nodes. In this paper, we propose a fully distributed information service relying on an unstructured overlay network. The core of this information service is the RW-OGS cached-based optimized random walk protocol. We describe experimental results showing that RW-OGS outperforms state of the art protocols in terms of bandwidth consumption and resource discovery latency. Moreover, RW-OGS is optimized to increase the probability to discover nodes with free resources and to enable fast discovery of rare resources. The RW-OGS protocol has been implemented as part of the Vigne middleware aiming at easing the use of large scale desktop Grids for executing a wide range of distributed applications. 1.
A Dynamic Prefix Tree for Service Discovery within Large Scale Grids
, 2006
"... Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among th ..."
Abstract
- Add to MetaCart
(Show Context)
Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the exibility of the discovery and its efficiency on widearea dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-topeer systems exhibits interesting complexities within our architecture. The analysis' results are con rmed by some simulation experiments run using several grid's data sets.
ISSN 0249-6399 ISRN INRIA/RR--6297--FR+ENGSnap-stabilizing Prefix Tree for Peer-to-peer Systems
"... apport de recherche ..."
(Show Context)
