DEADLOCK RESOLUTION IN PARALLEL EXECUTION OF NESTED TRANSACTIONS

概要

論文の詳細を見る
A distributed system is composed of multiple objects which are interconnected by various communication networks. Objects are abstract data types, which provide the data structure and operations for manipulating the data structure. Users issue transactions to manipulate the objects in the system. Transactions are composed of multiple operations on the objects and also atomic units of work. Each operation a on an object 0can call operations on another object. The operation a changes not only the state, i.e. data structure of 0but also the states of another objects. Suppose that one operation a on an object 0calls two operations b on an object p and C on q. If b and C are independent, they can be called in parallel. For each object 0,some compatibility relation among operations is defined. In order to synchronize the executions of operations on 0,some conflict-based locking mechanism is used. One problem of locking mechanism is deadlock. The deadlock problem occurred in the nested transaction is discussed in. this paper, we would like to discuss deadlock problems occurred when transactions are executed in parallel. In this paper, we assume that deadlock can be detected by some deadlock detection mechanism. If the deadlock is detected, one deadlocked transaction T is selected to be aborted to resolve the deadlock. In our system, only a part of the transaction T is aborted, i.e. partially aborted. In this paper, we present a method where some operation is executed to abort each operation to be aborted. The operation is named a compensate of the operation.
一般社団法人情報処理学会の論文
1991-02-25

DEADLOCK RESOLUTION IN PARALLEL EXECUTION OF NESTED TRANSACTIONS

スポンサーリンク

概要

著者

関連論文

スポンサーリンク