The document presents Magiclock, a technique for detecting potential deadlocks in large multithreaded programs. Magiclock analyzes execution traces without any actual deadlocks occurring. It iteratively eliminates unnecessary lock dependencies and partitions lock dependencies by thread to efficiently detect potential deadlock chains without examining duplicate permutations. The experimental results showed Magiclock is more scalable and efficient than existing dynamic detectors.

1. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 40,
NO. 3, MARCH 2014
Magiclock: Scalable Detection of Potential Deadlocks in Large-
Scale Multithreaded Programs

2. Abstract
 We present Magiclock, a novel potential deadlock detection
technique by analyzing execution traces (containing no deadlock
occurrence) of large-scale multithreaded programs.
 Magiclock iteratively eliminates removable lock dependencies
before potential deadlock localization.
 It divides lock dependencies into thread specific partitions,
consolidates equivalent lock dependencies, and searches over
the set of lock dependency chains without the need to examine
any duplicated permutations of the same lock dependency
chains. We validate Magiclock through a suite of real-world,
large-scale multithreaded programs.
 The experimental results show that Magiclock is significantly
more scalable and efficient than existing dynamic detectors in
analyzing and detecting potential deadlocks in execution traces
of large-scale multithreaded programs.

3. Existing System
 Most distributed dealings applications
use two section commit protocol to coordinate sub-transactions.
 These sub-transactions try to lock resources before
updating data to ensure that the transaction commits
at all resource managers or at none of them
To detect deadlocks introduced
by extremely synchronal access, some
researchers projected graph-based
detection algorithmic rule to detect deadlocks.
 Though deadlock detection may be effective, it prices a
lot in business transaction services. In respect to inner
deadlock, nothing can be done even if deadlock is
detected.

4. Proposed System
 In distributed particularly grid surroundings, commercial
transaction services are often deployed on different sites.
Each transaction, whatever local or global, may access
many different resources at the similar time. In this paper,
we call local transactions for only one big nested
transaction with several sub-transactions.
 The contributions in solving these problems are: (i)
Designing an intelligent resource admin to detect inner
transactions collisions or global transaction deadlock and
assign applicable locks for every transaction.
 Synchronization Parallel compute used to avoid the
deadlock occurs in a application. Providing efficient replica
mechanism to support for locking services of preventing
inner deadlock in local transactions.

5. System Requirements
 Hardware Requirements:
Platform : DOTNET (VS2010) , ASP.NET
Dot net framework 4.0
Database : SQL Server 2008 R2
 Software Requirements:
Processor : Core 2 duo
Speed : 2.2GHZ
RAM : 2GB
Hard Disk : 160GB

6. Architecture Diagram