Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ICPADS
1996
IEEE

favoriteEmaildiscussreport

104views Distributed And Parallel Com...» more ICPADS 1996»

An optimal deadlock resolution algorithm in multidatabase systems

13 years 9 months ago

An optimal deadlock resolution algorithm in multidatabase systems

Download www.cse.unsw.edu.au

In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes the use of network flow techniques, and runs in time O(n3),where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm dose not have livelock and transaction processing starvation problems.

Xuemin Lin, Jian Chen

Real-time Traffic

Deadlock Resolution Algorithm | Distributed And Parallel Computing | Global Deadlocks | ICPADS 1996 | Resolution Algorithm Dose |

claim paper

Related Content

» On Optimal Deadlock Detection Scheduling

» Stochastic analysis of distributed deadlock scheduling

» OnLine Detection and Resolution of Communication Deadlocks

» MC2DR Multicycle Deadlock Detection and Recovery Algorithm for Distributed Systems

» The Generalized Deadlock Resolution Problem

» Simulation based deadlock analysis for system level designs

» Design of a RealTime Scheduler for Kahn Process Networks on Multiprocessor Systems

» Transaction Processing in Mobile Heterogeneous Database Systems

» A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1996
Where	ICPADS
Authors	Xuemin Lin, Jian Chen

Comments (0)