Bitmap Conversion Using Vectorized Bitwise Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Bitmap conversion in storage systems consumes significant system resources, impacting performance, particularly during scenarios like lazy clean and FL-to-WIL conversion, where high resource utilization can lead to IO disruptions and prolonged queue times.
Innovation Solution
A method and device for bitmap conversion that determines whether bits in a first bitmap correspond to a dirty bit based on processor line width alignment, optimizing processing by using bitwise operations and mask tables to reduce the number of comparisons, thereby minimizing resource consumption and conversion time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If bitmap conversion is performed using traditional bit-by-bit comparison methods, then conversion accuracy is maintained, but system resource consumption increases and conversion time is prolonged
Solution Approach 1:
The patent segments the bitmap conversion process into fixed-width units (e.g., 32-bit or 64-bit words) that align with processor line width. Instead of processing bits individually, the method divides the bitmap into multiple segments that can be processed in parallel using vector instructions, thereby maintaining accuracy while significantly improving conversion speed.
Solution Approach 2:
The patent changes the processing parameter from bit-level operations to word-level operations matching the processor's native line width. By using vector instructions that operate on multiple bits simultaneously (e.g., 32 or 64 bits in one operation), the conversion process achieves both accuracy and high performance through parameter optimization.
2Adaptability or versatility
If bitmap conversion is performed frequently for storage management operations, then storage system adaptability is improved, but system resource consumption and IO delay increase
Solution Approach 1:
The patent enables continuous bitmap conversion operations by optimizing the conversion process to run efficiently without disrupting normal storage operations. The vectorized approach allows conversion to proceed continuously at high speed, maintaining storage management flexibility while minimizing IO delay through reduced processing time.
Solution Approach 2:
The patent performs bitmap conversion in advance or in parallel with storage operations rather than waiting for conversion to complete before proceeding. By using efficient vectorized operations, the system can prepare converted bitmaps beforehand or process them concurrently, maintaining adaptability while reducing the time impact on IO operations.
3Ease of manufacture
If traditional bitmap conversion methods are used, then implementation simplicity is maintained, but device complexity increases due to resource management requirements
Solution Approach 1:
The patent replaces traditional mechanical bit-by-bit comparison methods with vectorized instruction sets native to modern processors. By leveraging hardware-level vector operations (such as SIMD instructions), the implementation becomes simpler at the software level while the hardware efficiently handles the complexity of parallel processing, reducing overall resource management burden.
Data Source
AI summary
Techniques convert a first bitmap into a second bitmap. Such techniques involve determining a first plurality of bits in the first bitmap corresponding to a particular bit in the second bitmap; determining whether the first plurality of bits include a dirty bit as a unit of a processor line width; in response to determining that the first plurality of bits include a dirty bit, setting the particular bit as a dirty bit; and in response to determining that the first plurality of bits do not include a dirty bit, setting the particular bit as a non-dirty bit.