Distributed Two-Phase Locking

IT 위키

Distributed Two-Phase Locking (Distributed 2PL) is a concurrency control protocol used in distributed database systems to ensure global serializability. In this protocol, each site manages locks independently while coordinating with other sites to maintain consistency across the distributed system.

Key Concepts[편집 | 원본 편집]

  • Global Serializability: Ensures that the execution of distributed transactions is equivalent to a serial execution.
  • Distributed Lock Management: Each site manages its own locks, but transactions may need to acquire locks from multiple sites.
  • Two-Phase Locking: Transactions follow the standard Two-Phase Locking protocol:
    • Growing Phase: Locks are acquired but not released.
    • Shrinking Phase: Locks are released but no new locks are acquired.

How Distributed 2PL Works[편집 | 원본 편집]

Distributed 2PL operates as follows:

  1. Each data item is associated with a site that manages its locks.
  2. A transaction requesting access to data at multiple sites must acquire locks from all relevant sites.
  3. Each site enforces Two-Phase Locking for the data items it manages.
  4. Global consistency is ensured by coordinating lock acquisition across sites.

Advantages[편집 | 원본 편집]

  • Decentralized Lock Management: Each site manages its own locks, reducing the risk of a single point of failure.
  • Flexibility: The protocol works well in systems with geographically distributed nodes.
  • Scalability: Handles large-scale systems by distributing lock management across multiple sites.

Limitations[편집 | 원본 편집]

  • High Communication Overhead: Coordination between sites increases network traffic and latency.
  • Deadlocks Across Sites: Distributed transactions can create inter-site deadlocks that are more complex to resolve.
  • Complex Implementation: Managing locks and ensuring consistency across multiple sites adds significant complexity.

Example of Distributed 2PL[편집 | 원본 편집]

Consider a distributed database with two sites:

  • Site 1 manages data item A.
  • Site 2 manages data item B.

Scenario[편집 | 원본 편집]

Transaction T1 and T2 execute as follows:

Step Transaction T1 Transaction T2 Actions at Sites
1 BEGIN TRANSACTION BEGIN TRANSACTION Both transactions start.
2 READ(A) - T1 requests a shared lock for A from Site 1.
3 - WRITE(A) T2 requests an exclusive lock for A from Site 1 but must wait as T1 holds a shared lock.
4 READ(B) - T1 requests a shared lock for B from Site 2.
5 - WRITE(B) T2 requests an exclusive lock for B from Site 2 but must wait as T1 holds a shared lock.
6 COMMIT - T1 releases locks on A and B.
7 - WRITE(A), WRITE(B) T2 acquires exclusive locks on A and B and completes its transaction.

This example demonstrates how locks are acquired and released across multiple sites, ensuring consistency while managing contention.

Deadlock Handling in Distributed 2PL[편집 | 원본 편집]

Distributed 2PL introduces the risk of inter-site deadlocks. Common strategies to handle deadlocks include:

  • Timeouts: Abort transactions that wait too long for locks.
  • Wait-For Graphs: Use a global wait-for graph to detect cycles and resolve deadlocks.
  • Deadlock Prevention: Enforce a predefined order for acquiring locks across sites.

Comparison with Other 2PL Variants[편집 | 원본 편집]

Feature Distributed 2PL Centralized 2PL Primary Copy 2PL
Lock Management Fully distributed across sites Centralized at a single site Managed by the primary copy for each data item
Fault Tolerance High (no single point of failure) Low (single point of failure) Moderate (failure of primary copy affects data availability)
Communication Overhead High (inter-site communication) Low Moderate
Scalability High Limited High (for read-heavy workloads)

Applications[편집 | 원본 편집]

Distributed 2PL is used in:

  • Distributed Databases: Ensures consistency in systems where data is partitioned across multiple nodes.
  • Global Transaction Systems: Supports transactions that span multiple geographical regions.
  • Cloud Databases: Provides concurrency control for distributed cloud-based systems.

Challenges[편집 | 원본 편집]

  • Network Latency: Communication delays between sites can impact transaction performance.
  • Replication Consistency: Ensuring consistency across replicas while maintaining performance.
  • Deadlock Resolution: Inter-site deadlocks are harder to detect and resolve compared to single-site systems.

See Also[편집 | 원본 편집]