Implementing a fully dynamic lock-free hash table without dummy nodes
US7702628B1 · kind B1 · utility
36Cited by
8References
12Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 30, 2004 |
| Grant date | Apr 20, 2010 |
| Priority date | — |
| Expiry date | Jan 5, 2026 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99936
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
One embodiment of the present invention provides a system that performs operations on a hash table that is fully dynamic and lock-free. This hash table is implemented with a linked list containing data nodes and a bucket array containing bucket pointers, wherein the bucket pointers point to portions of the linked list that function as hash buckets, and wherein the linked list contains only data nodes and no dummy nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.