EMOMA: Exact Match in One Memory Access
Salvatore Pontarelli, Pedro Reviriego, Michael Mitzenmacher

TL;DR
EMOMA introduces a hash table structure that guarantees exactly one off-chip memory access per lookup by combining cuckoo hashing with an on-chip pre-filter, optimizing hardware performance for packet processing.
Contribution
It presents a novel cuckoo hash-based data structure that ensures single off-chip memory access per lookup using an on-chip pre-filter, enhancing hardware predictability and efficiency.
Findings
Achieves one off-chip memory access per lookup.
Compatible with hardware implementations for packet processing.
Provides a simple, hardware-friendly design.
Abstract
An important function in modern routers and switches is to perform a lookup for a key. Hash-based methods, and in particular cuckoo hash tables, are popular for such lookup operations, but for large structures stored in off-chip memory, such methods have the downside that they may require more than one off-chip memory access to perform the key lookup. Although the number of off-chip memory accesses can be reduced using on-chip approximate membership structures such as Bloom filters, some lookups may still require more than one off-chip memory access. This can be problematic for some hardware implementations, as having only a single off-chip memory access enables a predictable processing of lookups and avoids the need to queue pending requests. We provide a data structure for hash-based lookups based on cuckoo hashing that uses only one off-chip memory access per lookup, by utilizing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
