Guaranteeing global serializability by applying commitment ordering selectively to global transactions
US5504899A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Dec 2, 1994 |
| Grant date | Apr 2, 1996 |
| Priority date | — |
| Expiry date | Dec 2, 2014 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/466
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Global serializability in a distributed computing system having a plurality of resource managers is guaranteed by selectively committing global transactions, and aborting or delaying commitment of transactions to enforce an order of commitment of global transactions that is the same as an order of conflicts among the global transactions, including indirect conflicts caused by local transactions. These conflicts are detected, for example, by maintaining a serializability graph in each resource manager recording the effects of local as well as global transactions, including the effects of committed local transactions. The serializability graph includes nodes representing transactions, directed edges representing direct conflicts, and paths including more than one edge representing indirect conflicts. By referencing the serializability graph, global serializability is achieved in a most efficient manner. An atomic commitment coordinator, for example, communicates with a plurality of resource managers by way of "prepare," "commit" and "abort" commands, and the serializability graph in each resource manager is referenced to delay acknowledging that a global transaction has been "prepare…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.