Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Lock reordering for optimistic locking of data on a single node to avoid transaction deadlock

Lock reordering for optimistic locking of data on a single node to avoid transaction deadlock

US Patent 9208190 · Granted Dec 8, 2015

Estimated economic value: $10,494,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Registering data modification listener in a data-grid2019
Non-blocking listener registration in the presence of data grid nodes joining th2019
Using a shared data store for peer discovery2019
Transferring data between sites2018
Fault tolerant listener registration in the presence of node crashes in a data g2018
Non-blocking listener registration in the presence of data grid nodes joining th2018
Using a shared data store for peer discovery2017
Fault tolerant listener registration in the presence of node crashes in a data g2017
Performing object relational mapping for a data grid2015
Supporting transactions in distributed environments using a local copy of remote2015
Incremental optimistic locking of data distributed on multiple nodes to avoid tr2015
Incremental optimistic locking of data distributed on multiple nodes to avoid tr2015