Spare Resource Election in Distributed Computing Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems lack an efficient method to dynamically allocate a spare resource in distributed systems, leading to potential deadlocks and inefficient resource utilization when one resource fails, as they rely on pre-designated spare devices that may cause interruptions and data loss.
Innovation Solution
Implementing a spare election process where each computing resource requests permission to assume a spare state from others, with a hierarchical arrangement to resolve deadlocks and allow any resource to become operational, thereby minimizing interruptions and ensuring all resources can act as either active or spare dynamically.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a pre-designated spare device is used in an N+1 schema, then system redundancy is provided, but device complexity increases and potential deadlocks occur when multiple resources compete for spare state
Solution Approach 1:
The patent implements a dynamic spare election mechanism where any computing resource can assume the spare state based on real-time system conditions and hierarchical arbitration, rather than having a static pre-designated spare. This allows the spare role to be dynamically allocated to any resource in the system, optimizing resource utilization and avoiding deadlocks through hierarchical permission requests.
2Productivity
If any resource can become operational dynamically, then resource utilization efficiency improves, but the risk of deadlocks increases due to competition between resources
Solution Approach 1:
The patent introduces an asymmetric hierarchical structure among computing resources, where each resource has a unique hierarchy level. When multiple resources compete for the spare state, the resource with the higher hierarchy level has priority and can grant permission to lower-level resources. This asymmetric arrangement breaks the symmetry of competition that leads to deadlocks, ensuring that at least one resource can always proceed with the spare election.
Solution Approach 2:
The hierarchy level acts as an intermediary mechanism that mediates conflicts between competing resources. Instead of resources directly competing and potentially deadlocking, the hierarchy structure provides a mediating framework where higher-level resources can arbitrate and grant permission to lower-level resources, preventing circular waiting conditions that cause deadlocks.
3Reliability
If a hierarchical arrangement is implemented to resolve deadlocks, then deadlock risk decreases, but device complexity increases due to hierarchy management
Solution Approach 1:
The hierarchical spare election mechanism is implemented as a self-service system where each computing resource autonomously manages its own hierarchy level and participates in the election process based on its position in the hierarchy. Resources independently send permission requests to higher-level resources and make decisions based on received responses, without requiring centralized control or complex external management infrastructure.
Data Source
AI summary
A computing system comprising multiple computing resources in which one resource assumes spare status using a spare election algorithm. According to the algorithm each computing resource on initialization requests permission to assume spare state from the other computing resources. Then if all of the other computing resources grant the permission the requesting computing resource assumes spare state. If one of the other computing resources does not grant the permission to the requesting resource then the requesting resource assumes normal state.