On Routing in Distributed Hash Tables

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.

This paper presents elastic transactions, an appealing alternative to traditional transactions, in particular to implement search structures in shared memory multicore architectures. Upon conflict detection, an elastic transaction might drop what it did so ...

This thesis develops a unified framework for modeling and solving various classes of rich routing problems with stochastic demands, including the VRP and the IRP. The work is inspired by the problem of collecting recyclables from sensorized containers in G ...

Recent trends in power system design such as an increasing share of renewable energy sources and smart grids are creating different subsystem interactions that require proper investigation, understanding, describing and estimating global system stability t ...

Key-Value (K-V) stores are an integral building block in modern datacenter applications. With byteaddressable persistent memory (PM) technologies, such as Intel/Micron's 3D XPoint, on the horizon, there has been an influx of new high performance K-V stores ...

Static Random Access Memory (SRAM)-based routing multiplexers, whatever structure is employed, share a common limitation: their area, delay and power increase linearly with the input size. This property results in most SRAM-based FPGA architectures ...

Despite the large number of studies on synchronization, the hypothesis that interactions bear a cost for involved individuals has seldom been considered. The introduction of costly interactions leads, instead, to the formulation of a dichotomous scenario i ...

Resistive Random Access Memory (RRAM)-based routing multiplexers, built using a one-level structure, are significantly more delay efficient than state-of-art SRAM-based implementations thanks to their lower achievable on-state resistance. In addition, the ...

Monte Carlo simulations are used to systematically investigate the effects of structural topology on the thermodynamics of n-alkanes adsorbed at Bronsted protons in zeolites having one-dimensional channel systems. In zeolites without cages, the enthalpy an ...

Non-volatile memory (NVM) technologies such as PCM, ReRAM and STT-RAM allow processors to directly write values to persistent storage at speeds that are significantly faster than previous durable media such as hard drives or SSDs. Many applications of NVM ...

On Routing in Distributed Hash Tables

Chat with Graph Search

Elastic transactions

Rich Vehicle and Inventory Routing Problems with Stochastic Demands

Medium Voltage Impedance-Admittance Measurement System Based on the Cascaded H-Bridge Multilevel Converter

Closing the Performance Gap Between Volatile and Persistent Key-Value Stores Using Cross-Referencing Logs

Optimization Opportunities in RRAM-based FPGA Architectures

Coevolution of Synchronization and Cooperation in Costly Networked Interactions

A High-performance FPGA Architecture Using One-Level RRAM-based Multiplexers

Effects of Pore and Cage Topology on the Thermodynamics of n-Alkane Adsorption at Bronsted Protons in Zeolites at High Temperature

Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols