The power of one move: hashing schemes for hardware

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 565-573

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER COMMUNICATIONS; HARDWARE IMPLEMENTATIONS; HASH TABLES; SPACE UTILIZATION;

COMPUTER NETWORKS; NUMERICAL METHODS;

COMPUTER HARDWARE;

EID: 51349086895     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.30     Document Type: Conference Paper

References (21)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal on Computing 29(1): 180-200, 1999.
2. A. Broder and A. Karlin. Multilevel adaptive hashing. In Proceedings of the 1st ACM-SIAM Symposium on Discivte Algorithms (SODA), pp. 43-53, 1990.
3. A. Broder and M. Mitzenmacher. Using multiple hash functions to improve IP Lookups. In Proceedings of IEEE INFOCOM, pp. 1454-1463, 2001.
4. J. Byers, J. Considine, and M. Mitzenmacher Geometric generalization of the power of two choices. In Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 54-63, 2004.
5. M. Dietzfelbinger and C. Weidling. Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science. 380:(1-2):47-68, 2007.
6. C. Estan, K. Keys, D. Moore, and G. Varghese. Building a Better NetFlow. In Proceedings of ACM SIGCOMM, pp. 245-256, 2004.
7. 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.
8. G. Grimmett and D. Stirzaker. Probability and Random Processes. Third Edition, Oxford University Press, 2003.
9. 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.edu/~kirsch/pubs/sshmc/ ton-cr.pdf.
10. A. Kirsch and M. Mitzenmacher. Using a Queue to De-amortize Cuckoo Hashing in Hardware. In Proceedings of the Forty-Fifth Annual Allerton Conference on Communication, Control, and Computing, 2007.
11. T.G. Kurtz. Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes. Journal of Applied Probability, (7):49-58, 1970.
12. T. G. Kurtz, Approximation of Population Processes, SIAM, 1981.
13. M. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. Ph.D. thesis. University of California. Berkeley, 1996.
14. M. Mitzenmacher, A. Richa, and R. Sitaraman. The Power of Two Choices: A Survey of Techniques and Results, edited by P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim. Kluwer Academic Publishers, Norwell, MA, 2001, pp. 255-312.
15. M. Mitzenmacher and B. Vöcking. The Asympotics of Selecting the Shortest of Two, Improved. In Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich, American Mathematical Society, pp. 165-176, 2003, Edited by Y. Suhov.
16. R. Pagh and F. Rodler. Cuckoo hashing. Journal of Algorithms, 51(2): 122-144, 2004.
17. R. Panigrahy. Efficient hashing with lookups in two memory accesses. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 830-839, 2005.
18. A. Shwartz and A. Weiss. Large Deviations for Performance Analysis: Queues, Communications, and Computing. Chapman & Hall, 1995.
19. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast hash table lookup using extended Bloom filter: an aid to network processing. In Proceedings of ACM SIGCOMM, pp. 181-192, 2005.
20. B. Vöcking. How Asymmetry Helps Load Balancing. Journal of the ACM, 50:4, pp. 568-589, 2003.
21. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. ACM SIGCOMM Computer Communication Review, 27(4):25-36, 1997.