Using a queue to de - Amortize cuckoo hashing in hardware

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 2, Issue , 2007, Pages 751-758

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEPRECIATION; ROUTERS;

HARDWARE ROUTERS; HASH TABLE; HIGH PERFORMANCE ROUTERS; LOW PROBABILITY; MULTIPLE CHOICE; SPACE UTILIZATION;

HARDWARE;

EID: 70350350133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced Allocations. SIAM Journal on Computing, 29(1): 180-200, 1999.
2. L. Devroye and P. Morin. Cuckoo Hashing: Further Analysis. Information Processing Letters, 86(4):215-219, 2003.
3. M. Dietzfelbinger and C. Weidling. Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. Theoretical Computer Science, 380:(l-2):47-68, 2007.
4. D. Fotakis, R. Pagh, P. Sanders, and P. Spirakis. Space Efficient Hash Tables With Worst Case Constant Access TimE. Theory of Computing Systems, 38(2): 229-248, 2005.
5. A. Kirsch and M. MitzenmacheR. Simple Summaries for Hashing with Choices. IEEE/ACM Transactions on Networking, to appeaR. Temporary version available at: http://www.eecs.harvard.eduAkirsch/pubs/sshmc/ton-cr.pdf.
6. A. Kirsch and M. MitzenmacheR. The Power of One Move: Hashing Schemes for HardwarE. Submitted. Temporary version available at: http://www.eecs.harvard.edu/~kirsch/pubs/hashing-hardware/hashing-hardware-submit.pdf.
7. M. MitzenmacheR. The Power of Two Choices in Randomized Load Balancing. Ph.D. thesis, University of California, Berkeley, 1996.
8. R. Pagh and F. RodleR. Cuckoo Hashing. Journal of Algorithms, 51(2): 122-144, 2004.