| 摘要 |
<p>Apparatus for scheduling at least two concurrent transactions accessing a shared data is provided. When a lock request is granted, the apparatus provides for constructing a history file for the shared data to show each data accessing transaction, and also provides for constructing a serialization graph with each node denoting an active transaction, and each directed edge denoting a dependency between two transactions. The serialization graph (20) is searched for a cycle formed by transactions (24,25,26), and if any is found, the transactions are aborted and restarted. <IMAGE></p> |
