Distributed Lock via Storage Register Quorum

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current distributed locking protocols in computer systems are vulnerable to timing dependencies and message exchange inefficiencies, leading to issues like data corruption, process crashes, and deadlocks due to their reliance on communication message transmission delays and instability.

Innovation Solution

A distributed storage register is employed to implement a robust distributed lock, using a quorum-based approach to manage concurrent access to shared resources, with processes storing local values and routines to ensure consistent and reliable operation across interconnected systems.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional distributed locking protocols are used, then resource sharing can be achieved, but the system becomes vulnerable to timing dependencies and communication message transmission delays

Engineering Contradiction:
Improverobustness against timing dependenciesVSAvoidprotocol complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces a distributed storage register as an intermediary component that mediates between multiple processes competing for resource access. The register maintains a quorum of processes and uses read-write operations to coordinate access, eliminating the need for complex timing-dependent protocols while achieving reliable resource sharing.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent implements a distributed storage register that replicates data across multiple processes. Each process maintains a local copy of the register state, and changes are propagated through quorum-based read-write operations. This copying mechanism eliminates single-point-of-failure vulnerabilities and reduces dependency on centralized coordination timing.

Inventive Principle:
Principle #26Copying

2Productivity

If traditional distributed locking protocols are used, then concurrent access control is achieved, but significant message traffic is required to coordinate shared access

Engineering Contradiction:
Improvemessage traffic efficiencyVSAvoidaccess coordination reliability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent merges the lock coordination function with the distributed storage register operations. The quorum-based read-write operations simultaneously achieve both data consistency and access coordination, eliminating the need for separate message exchange protocols and reducing overall message traffic while maintaining reliability.

Inventive Principle:
Principle #5Merging (Combining)

3Adaptability or versatility

If traditional distributed locking protocols are used, then resource sharing is enabled, but the system is vulnerable to process instability and communication problems

Engineering Contradiction:
Improvehandling process instabilityVSAvoidprotocol complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements beforehand cushioning by maintaining a quorum of processes that can continue operating even if some processes become unstable or crash. The distributed storage register ensures that as long as a quorum remains functional, the system can maintain consistent access coordination without requiring complex error handling or protocol recovery mechanisms.

Inventive Principle:
Principle #11Beforehand cushioning (Prior cushioning)

Data Source

PatentUS8495266B2Distributed lock
Publication Date: 2013.07.23 HEWLETT PACKARD ENTERPRISE DEV LP
  • US8495266B2 patent drawing
  • US8495266B2 patent drawing
  • US8495266B2 patent drawing

AI summary

Various embodiments of the present invention are directed to a distributed lock and distributed locking protocol to allow multiple communicating entities to share access to a computing resource. Certain embodiments of the present invention employ a data storage register implemented by the communicating entities to hold a value reflective of a distributed lock state.