Sciweavers

84 search results - page 6 / 17
» D1HT: a distributed one hop hash table
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
TMC
2010
138views more  TMC 2010»
13 years 5 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
INFOCOM
2005
IEEE
14 years 29 days ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
13 years 9 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner