Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

US Patent 8838944 · Granted Sep 16, 2014

Estimated economic value: $3,547,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Very large address space using extended page tables2025
Context-specific query response platform using large language models2025
Methods and apparatus for task relocation based on memory access patterns2025
Mounting system for building panels2024
Training neural networks using distributed batch normalization2024
Server recovery from a change in storage control chip2024
Enhanced SD-WAN path quality measurement and selection2023
Cross replica reduction on networks having degraded nodes2023
Methods and systems for creating root-of-trust for computing system components2023
Transactional lock elision with delayed lock checking2023
Dependency handling for configuration transport2023
Hybrid data-model parallelism for efficient deep learning2023