Sciweavers

1080 search results - page 36 / 216
» Distributed Hash Tables
Sort
View
DSN
2005
IEEE
15 years 8 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
SPIRE
2005
Springer
15 years 8 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
134
Voted
CORR
2010
Springer
150views Education» more  CORR 2010»
15 years 2 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
134
Voted
TPDS
2010
126views more  TPDS 2010»
14 years 9 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
98
Voted
ICN
2009
Springer
15 years 9 months ago
Distributed Information Object Resolution
The established host-centric networking paradigm is challenged due to handicaps related with disconnected operation, mobility, and broken locator/identifier semantics. This paper...
Kostas Pentikousis