HUET , Fabrice

Disponible dans le fichier attaché

Storing highly skewed data in a distributed system has become a very frequent issue, in particular with the emergence of semantic web and Big Data. This often leads to biased data dissemination among nodes. Addressing load imbalance is necessary, especially to minimize response time and avoid workload being handled by only one or few nodes. Our...

EventCloud allows storing and retrieving RDF data along two modes: synchronous (synchronous SPARQL query), or asynchronous (through subscription requests expressed in a subset of SPARQL) in which case data are notified in the form of events. As RDF, SPARQL is a W3C standard for the semantic web. EventCloud is built as a P2P structured overlay...

With the increasing demand and benefits of cloud computing infrastructure, real time computing can be performed on cloud infrastructure. A real time system can take advantage of intensive computing capabilities and scalable virtualized environment of cloud computing to execute real time tasks. In most of the real time cloud applications,...

Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorithms used in such systems. Blind flooding is not scalable because of its high communication cost. On the other hand, the performance of random walks approaches largely depends...

Hash functions are at the heart of data insertion and retrieval in DHT-based overlays. However, a standard hash function destroys the natural ordering of data. To perform efficient range queries processing, more and more systems opt for an order-preserving hash function to place data. Unlike a standard hash function, this technique cannot...

With the advent in cloud computing technologies, use of cloud computing infrastructure is increasing day by day and a lot of enterprises are shifting their computing from in-house infrastructure to the cloud infrastructure. Over a small period of time, it has substantiated to be an attractive choice for the enterprises. Especially for those,...

Hash functions are at the heart of data insertion and retrieval in DHT-based overlays. However, a standard hash function destroys the natural ordering of data. To perform efficient range queries processing, in a minimum number of hops, more and more systems opt for an order-preserving hash function to place data. Unlike a standard hash...

MapReduce is a programming model which allows the processing of vast amounts of data in parallel, on a large number of machines. It is particularly well suited to static or slow changing set of data since the execution time of a job is usually high. However, in practice data-centers collect data at fast rates which makes it very difficult to...

MapReduce is a programming model which allows the processing of vast amounts of data in parallel, on a large number of machines. It is particularly well suited to static or slow changing set of data since the execution time of a job is usually high. However, in practice data-centers collect data at fast rates which makes it very difficult to...

In this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an...

Active objects offer a paradigm which simplifies writing distributed applications. Since each active object has a single thread of control, data races are prevented. However, this programming model has its limitations: it is deadlock-prone, and it is not efficient on multicore machines. To overcome these limitations, we present an extension of...

Active objects offer a paradigm which simplifies writing distributed applications. Since each active object has a single thread of control, data races are prevented. However, this programming model has its limitations: it is deadlock-prone, and it is not efficient on multicore machines. To overcome these limitations, we present an extension of...

Stocker des informations du web sémantique implique d'être capable de pouvoir potentiellement gérer de très importants volumes de données. D'où le besoin d'opter pour une solution forcément distribuée, entre autres de type pair-à-pair, pour pouvoir passer à l'échelle. Un système de stockage RDF réparti requiert de mettre en place un algorithme...

In a multi-cloud environment, distributed application may need to have minimal inter-node latency to improve their performance. In this paper, We propose a model for the grouping of nodes with respect to network latency. The application scheduling is done on the basis of network latency. This model is a part of our proposed Cloud Scheduler...

This paper evaluates and compares the performance of two approaches for locating an agent in a mobile agent environment. The first approach dynamically creates a chain of forwarders to locate a moving agent, whereas the second one relies on a centralized server to perform this task. Based on a Markov chain analysis, we compute the performance...

Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours?...

Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours?...

Stocker des informations du web sémantique implique d'être capable de pouvoir potentiellement gérer de très importants volumes de données. D'où le besoin d'opter pour une solution forcément distribuée, entre autres de type pair-à-pair, pour pouvoir passer à l'échelle. Un système de stockage RDF réparti requiert de mettre en place un algorithme...

Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours?...

Deploying graph on a cluster requires its partitioning into a number of subgraphs, and assigning them to different machines. Two partitioning approaches have been proposed: vertex partitioning and edge partitioning. In the edge partitioning approach edges are allocated to partitions. Recent studies show that, for power-law graphs, edge...

This paper evaluates and compares the performance of two approaches for locating an agent (e.g. a code) in a mobile agent environment. The first approach dynamically creates a chain of forwarders to locate a moving agent whereas the second one relies on a centralized server to perform this task. Based on a Markov chain analysis, we compute the...

In distributed graph computation, graph partitioning is an important preliminary step, because the computation time can significantly depend on how the graph has been split among the different executors. In this paper, we propose a framework for distributed edge partitioning based on simulated annealing. The framework can be used to optimize a...

In distributed graph computation, graph partitioning is an important preliminarystep, because the computation time can significantly depend on how the graph has been split amongthe different executors. In this paper, we propose a framework for distributed edge partitioningbased on simulated annealing. The framework can be used to optimize a...