Operation Lock Bitmap for Concurrent Resource Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing locking mechanisms for controlling concurrent access to resources in multi-threaded processing often restrict access too rigidly, limiting flexibility and efficiency, particularly in scenarios where multiple tasks can read a resource without modifying it, leading to potential race conditions and data integrity issues.
Innovation Solution
A novel locking mechanism using an operation lock (OPLOCK) with bitmaps that define allowed operations and their compatibility, allowing multiple tasks to access a resource simultaneously while ensuring data integrity, by using mask and policy bitmaps to manage access rights and prevent conflicts between operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional locks, semaphores or mutex are used to control access to a common resource, then data integrity is ensured by allowing only one task to access the resource at a time, but resource utilization efficiency deteriorates because multiple read operations cannot occur concurrently
Solution Approach 1:
The patent segments the access control mechanism into multiple independent bit fields within a bitmap, where each bit field corresponds to a specific operation type (read, write, delete, etc.). This segmentation allows different operation types to be tracked and controlled independently, enabling multiple read operations to proceed concurrently while still preventing conflicting write operations, thus improving resource utilization while maintaining data integrity.
Solution Approach 2:
The patent implements dynamic access control by allowing the number of concurrent operations of the same type to be configurable through the size of bit fields in the bitmap. The system dynamically adjusts which operations can proceed based on current resource state and operation compatibility rules, rather than using a static single-lock approach. This dynamic behavior enables optimal resource utilization while preventing race conditions.
2Reliability
If single access control is implemented to prevent race conditions, then data integrity is maintained, but operational flexibility deteriorates because multiple compatible operations (such as multiple reads) are unnecessarily blocked
Solution Approach 1:
The patent applies local quality by assigning different access control policies to different operation types through separate bit fields in the bitmap. Each operation type (read, write, delete) has its own bit field that can be independently managed, allowing the system to permit multiple concurrent reads while restricting concurrent writes. This localized control approach provides operational flexibility while maintaining data integrity for each operation type.
Solution Approach 2:
The patent changes the parameter of access control from a single binary lock state to a multi-dimensional bitmap state, where each bit field can independently track the state of different operation types. The compatibility bitmaps further parameterize the control by defining which operation combinations are allowed. This parameter expansion enables fine-grained control over operational flexibility while preserving data integrity constraints.
3Productivity
If a bitmap-based operation lock is used to allow multiple concurrent operations, then resource utilization improves, but system complexity increases due to multiple bitmaps and bitwise operations
Solution Approach 1:
The patent merges multiple access control mechanisms into a single bitmap structure, where all operation locks are combined into one data structure rather than using separate locks for each operation type. The mask bitmaps and compatibility bitmaps are also integrated into a unified system that works together through bitwise operations. This merging reduces the number of separate data structures and synchronization points, making the system more efficient despite the increased sophistication of the individual components.
Solution Approach 2:
The patent replaces traditional mechanical locking mechanisms (mutual exclusion locks, semaphores) with a bitwise computational system. Instead of using hardware or software locks that require acquisition and release sequences, the system uses bitmap operations to atomically check and update operation states. This substitution eliminates complex lock acquisition protocols and replaces them with efficient bitwise AND, OR, and comparison operations, reducing overall system complexity while improving performance.
4Measurement precision
If multiple bit fields are used to track different operation types, then operational control precision improves, but access control overhead increases due to additional bitmap operations
Solution Approach 1:
The patent creates a universal bitmap-based control mechanism that handles multiple operation types (read, write, delete, and user-defined operations) through a single unified data structure. The same bitmap and bitwise operation framework is used for all operation types, eliminating the need for separate control logic for each operation. This universality reduces the overhead of accessing and managing multiple separate data structures, making the precision control of individual operations more efficient.
Data Source
AI summary
A novel method of providing a locking mechanism which supports multiple operations rights is disclosed. The locking mechanism includes a policy aspect which defines which operations are allowed to access the common resource concurrently. The locking mechanism also includes the ability to allow predetermined number of tasks to access the common resource simultaneously. Furthermore, additional operations can be easily and quickly added to the mechanism.