File System Bitmap Locking for Reduced Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional file systems experience latency due to flexible data operations that allow serialized access, leading to delayed file access requests, especially with the use of different storage representations and locking mechanisms.
Innovation Solution
Implementing a set of policies such as storage-representation usage, bitmap-representation conversion, and bitmap-locking policies to restrict access and synchronize data operations, allowing only bitmap representations for certain operations and dropping global locks to reduce latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If flexible data operations are allowed with multiple storage representations and broad locking operations, then the file system operates with flexibility and can handle various access patterns, but latency increases due to serialized access and multiple locks causing delayed file access requests
Solution Approach 1:
The patent segments the locking mechanism into bitmap-level locks instead of using global locks or cache locks. Each bitmap represents a specific storage region, and locks are applied at the bitmap level rather than at the global or cache level. This segmentation allows independent locking of different storage regions, eliminating the need for serialized access across the entire file system and reducing latency while maintaining flexible operations.
Solution Approach 2:
The patent inverts the traditional locking approach by using bitmap-level locks instead of global locks or cache locks. Instead of locking the entire file or cache at once, the system locks only the specific bitmap regions that need access. This inversion of the locking granularity allows multiple operations to proceed in parallel without serialized access, reducing latency while preserving operational flexibility.
2Reliability
If global locks and cache locks are used to manage storage access, then data integrity and access control are maintained, but latency increases due to serialized access requirements
Solution Approach 1:
The patent segments the locking mechanism into bitmap-level locks instead of using global locks or cache locks. Each bitmap represents a specific storage region, and locks are applied at the bitmap level rather than at the global or cache level. This segmentation allows independent locking of different storage regions, eliminating the need for serialized access across the entire file system and reducing latency while maintaining flexible operations.
Solution Approach 2:
The patent applies local quality by implementing locks at the bitmap level, which allows different parts of the storage system to have different access states simultaneously. Instead of a single global lock state, each bitmap can be locked or unlocked independently based on local access requirements. This local locking approach maintains data integrity for each region while allowing parallel operations across regions, reducing overall latency.
3Adaptability or versatility
If bitmap representation conversion is unrestricted, then storage representation flexibility is improved, but latency increases due to frequent conversions and additional synchronization requirements
Solution Approach 1:
The patent applies preliminary action by establishing bitmap-level locks before data operations occur. The locking mechanism is pre-configured at the bitmap level, allowing operations to proceed without frequent conversions between storage representations. By having the locking structure ready at the bitmap level, the system can perform data operations efficiently without incurring additional latency from conversion and synchronization operations.
Data Source
AI summary
Methods, systems, and computer storage media for providing reduced-latency data operations for data or storage in file systems. The file system implements a set of policies that indicate how data operations are performed. In operation, a request for access to storage of a file system to perform a data operation is received. The file system supports both a bitmap representation and a range-only representation of the storage. A bitmap representation of a region for performing the data operation is communicated because, for certain data operations, the file system operates based on communicating only bitmap representations while restricting access to range-only representations. The range-only representations are a compacted representation of storage of the file system. Based on the bitmap representation of the region, the storage of the file system is accessed. The bitmap representation of the region further includes a bitmap lock that restricts access to storage corresponding to the bitmap representation.