Eliding synchronization in a concurrent data structure
US9384063B2 · kind B2 · utility
0Cited by
4References
19Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 18, 2009 |
| Grant date | Jul 5, 2016 |
| Priority date | — |
| Expiry date | Nov 3, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2329
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A concurrent data structure allows synchronization to be elided for read accesses. Processing resources that remove one or more elements of the concurrent data structure are allowed to delete the elements only after all other processing resources have reached a safe point. Each processing resource maintains an indicator that indicates whether the processing resource has reached as safe point (i.e., will not access the concurrent data structure). When the indicators indicate that all processing resources have reached a safe point, elements of the data structure may be deleted.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.