We show that when memory is bounded, i.e. memory buckets are finite, dynamic hash tables that allow insertions and deletions behave significantly worse than their static counterparts that only allow insertions. This behavior differs from previous results in which, when memory is unbounded, the two models behave similarly. We show the decrease in performance in dynamic hash tables using several hash-table schemes. We also provide tight upper and lower bounds on the achievable overflow fractions in these schemes. Finally, we propose an architecture with content-addressable memory (CAM), which mitigates this decrease in performance.
Bibliographical noteFunding Information:
Isaac Keslassy received the M.S. and Ph.D. degrees in electrical engineering from Stanford University, Stanford, CA, in 2000 and 2004, respectively. He is currently an associate professor in the electrical engineering department of the Technion, Haifa, Israel. His recent research interests include the design and analysis of high-performance routers and on-chip networks. He is the recipient of the Yigal Alon Fellowship, the ATS-WD Career Development Chair and the ERC Starting Grant.
The work was partly supported by the European Research Council Starting Grant No. 210389 , the European Research Council Starting Grant No. 259085 , the Alon Fellowship, the ATS-WD Career Development Chair, and the Loewengart Research Fund .
- Dynamic hash tables
- High-Speed networks
- Queuing theory and analysis