Sciweavers

118 search results - page 6 / 24
» A Simple Fault Tolerant Distributed Hash Table
Sort
View
TON
2010
138views more  TON 2010»
13 years 2 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
SC
2009
ACM
14 years 2 months ago
Kestrel: an XMPP-based framework for many task computing applications
This paper presents a new distributed computing framework for Many Task Computing (MTC) applications, based on the Extensible Messaging and Presence Protocol (XMPP). A lightweight...
Lance Stout, Michael A. Murphy, Sebastien Goasguen
PADL
2009
Springer
14 years 8 months ago
Operational Semantics for Declarative Networking
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
Juan A. Navarro, Andrey Rybalchenko
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
ICDCN
2009
Springer
14 years 2 months ago
FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications
We introduce FTRepMI, a simple fault-tolerant protocol for providing sequential consistency amongst replicated objects in a grid, without using any centralized components. FTRepMI ...
Ana-Maria Oprescu, Thilo Kielmann, Wan Fokkink