The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
ISBN: 0-8186-7038-X
pp: 192
P. Krishna Reddy , Div. of Comput. Eng., Delhi Inst. of Technol., India
S. Bhalla , Div. of Comput. Eng., Delhi Inst. of Technol., India
ABSTRACT
Concurrency control based on conventional techniques requires additional efforts for deadlock detection and elimination. The possibility of a deadlock is also connected to the introduction of delays, and repeated restarts of transactions in deadlock cycles. In the proposed approach, a technique for generation of data flow precedence graphs among transactions at data sites has been studied. The local access graph approach is a fully distributed approach. Through local computations, the approach can prevent deadlocks in a distributed system.
INDEX TERMS
concurrency control; distributed databases; system recovery; transaction processing; data flow graphs; database theory; nonblocking concurrency control; distributed database systems; deadlock detection; deadlock elimination; delays; repeated transaction restarts; deadlock cycles; data flow precedence graphs; data sites; local access graph approach; fully distributed approach; local computations
CITATION
P. Krishna Reddy, S. Bhalla, "Non-blocking concurrency control in distributed database systems", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 192, 1995, doi:10.1109/AISPAS.1995.401338
194 ms
(Ver 3.3 (11022016))