10.7 Conclusion
For real-time embedded systems such as network processors, conventional hash tables have the problems of performance degradation due to concurrency issues with multithreading, large memory accessing delays and not dealing with deleted entries efficiently. In this paper, we propose an approach combining hybrid open hash tables with incremental garbage collection to meet the needs of real-time applications. By maintaining two hash tables instead of one table as in conventional approaches, the hybrid open hashing approach incrementally copies the valid keys from the alternate table into the current table, skipping over the deleted or empty entries. In this way, hashing operations always deal with a table without too many hash collisions. Performance evaluations show that the hybrid open hash table is better than Brutil and it still has the potential to be improved further by several enhancement approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Peyravian and J. Calvignac. Fundamental architectural considerations for network processors. IEEE Journal of Computer Networks, pp. 587–600, issue 41, 2003.
D. E. Comer. Network Systems Design using Network Processors, Agere Version. Upper Saddle River, NJ: Prentice Hall, 2004.
D. Comer. Computer Networks and Internets with Internet Applications, Third Edition. Upper Saddle River, NJ: Prentice-Hall, 2001.
Traditional IP Network Address Translator (Traditional NAT). Internet Engineering Task Force and the Internet Engineering Steering Group, Request for Comments 3022, Jan. 2001.
I. Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: a scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM 2001, San Diego, CA, Aug. 2001.
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329–350, Nov. 2001.
Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph and John Kubiatowicz. Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications, 22, No. 1, Jan. 2004.
RFC 3174. http://www.faqs.org/rfcs/rfc3174.html, accessed on Sep. 6, 2005.
S. Friedman, N. Leidenfrost, B. Brodie and R. Cytron. Hashtables for embedded and real-time systems. In Proceedings of IEEE Real-time Embedded System Workshop, Dec. 2001.
T. H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1989.
D. Knuth. The Art of Computer Programming. Vol. 3, Searching and Sorting, Reading, MA: Addison-Wesley, 1973.
T. Szymanski. Hash table reorganization. Journal of Algorithms, 6(3), pp. 322–335, 1985.
M. Dietzfelbinger and F. Meyer auf der Hyde. An optimal parallel dictionary. In Prococeeding of ACM Symposium on Parallel Algorithms and Architectures, pp. 360–368, 1989.
M. Ajtai, M. Fredman, and J. Komlós. Hash functions for priority queues. In 24th Annual Symposium on Foundations of Computer Science, pp. 299–303, Tucson, Arizona, 7–9 Nov. 1983.
R. Jones. Garbage Collection, Algorithms for Automatic Dynamic Memory Management. Chichester, John Wiley & Sons, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this chapter
Cite this chapter
Parson, D., Ye, Q., Cheng, L. (2007). Hybrid Open Hash Tables for Network Processors. In: Elhanany, I., Hamdi, M. (eds) High-performance Packet Switching Architectures. Springer, London . https://doi.org/10.1007/1-84628-274-8_10
Download citation
DOI: https://doi.org/10.1007/1-84628-274-8_10
Publisher Name: Springer, London
Print ISBN: 978-1-84628-273-7
Online ISBN: 978-1-84628-274-4
eBook Packages: EngineeringEngineering (R0)