Publication

Adaptive Load Sharing for Network Processors

Related publications (43)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jet-scheduling control for flat systems

Davide Buccieri

The control of cranes and nonholonomic robots has gained increased interest mainly because of the civilian and military industrial need to achieve fast and accurate transport of goods and equipment. Old and new harbors are now venturing into fully automate ...

EPFL2008

Hybrid DHT Design for Mobile Environments

Simon Schubert, Zoran Despotovic

In this paper we present a hybrid design concept for Distributed Hash Tables (DHTs), in order to increase the performance of DHTs in scenarios with mobile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay ...

Springer-Verlag2008

On Obstruction-Free Transactions

Rachid Guerraoui, Michal Kapalka

This paper studies obstruction-free software transactional memory systems (OFTMs). These systems are appealing, for they combine the atomicity property of transactions with a liveness property that ensures the commitment of every transaction that eventuall ...

ACM2008

On Obstruction-Free Transactions

Rachid Guerraoui, Michal Kapalka

2008

On Routing in Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Sarunas Girdzijauskas

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

Karl Aberer, Fabius Klemm

There has been an increasing research interest in developing full-text retrieval based on peer-to-peer (P2P) technology. So far, these research efforts have largely concentrated on efficiently distributing an index. However, ranking of the results retrieve ...

2005

On SmallWorld Graphs in Non-uniformly Distributed Key Spaces

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world model [6] we extend the model of building “routing-efficient” small-world graph ...

2005

Adding limited reconfigurability to superscalar processors

Marc Epalza

For the last thirty years, electronics, at first built with discrete components, and then as Integrated Circuits (IC), have brought diverse and lasting improvements to our quality of life. Examples might include digital calculators, automotive and airplane ...

EPFL2004