CN113284039B - Bitmap management method, device and equipment and readable storage medium - Google Patents
Bitmap management method, device and equipment and readable storage medium Download PDFInfo
- Publication number
- CN113284039B CN113284039B CN202110803604.XA CN202110803604A CN113284039B CN 113284039 B CN113284039 B CN 113284039B CN 202110803604 A CN202110803604 A CN 202110803604A CN 113284039 B CN113284039 B CN 113284039B
- Authority
- CN
- China
- Prior art keywords
- bitmap
- copy
- reference count
- address
- bitmap copy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/60—Memory management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
Abstract
The invention discloses a bitmap management method, when creating a bitmap, only one bitmap copy is created in a program, and the operation of each thread on the bitmap is performed aiming at the bitmap copy, so that the storage space can be effectively saved; meanwhile, after receiving an operation request for the bitmap copy, the method collects bitmap update operation commands within a period of time and then performs the bitmap update operation commands in a combined manner, so that the performance loss can be reduced, wherein in the combined execution of the update commands, an execution object is a new bitmap copy obtained after the bitmap copy is copied, the bitmap state change before the service process of the bitmap copy is not finished by other threads can be avoided, and the stability and the continuity of the service process are ensured; moreover, each thread only needs to acquire and store the address of the bitmap, a real bitmap copy does not need to be stored, the threads do not interfere with each other, and the performance loss can be reduced. The invention also discloses a bitmap management device, equipment and a readable storage medium, and the bitmap management device, the equipment and the readable storage medium have corresponding technical effects.
Description
Technical Field
The present invention relates to the field of data management technologies, and in particular, to a bitmap management method, apparatus, device, and readable storage medium.
Background
Bitmaps are common storage means for storing the attribute status of a plurality of things of the same kind. A memory block comprising a plurality of bits in a bitmap represents two different attributes or states of an object by a bit value (0 or 1), for example, in a black list function implementation of a network device, a black list can be represented by a bitmap, each bit in the bitmap corresponds to an IP, and a value according to each bit indicates whether the IP is included in the black list.
The value of the bitmap in the whole life cycle from creation to deletion is not fixed, and the thread is allowed to update and modify the bitmap, for example, for a blacklist function, a management thread in a multithread program can convert a command into modification (to a plurality of bits 1 or zero) of the bitmap in the program after receiving the setting command of a user on the blacklist. When updating and modifying the bitmap, the multithread program needs to meet the requirement of data Consistency (Consistency) when changing the data which needs to be accessed by each thread, and the data Consistency refers to the data Consistency in the problem of multiple copies (Replications). In order to satisfy data consistency, at present, two ways are mainly adopted for managing bitmaps, one of which is to create only one bitmap and locks bound to the bitmap when the bitmap needs to be created, lock the bitmap when a modification operation is performed on the bitmap, and then modify the bitmap. In the process, other threads cannot access the bitmap, so that the service processing processes of other threads are blocked, and the program performance is low; and secondly, when the bitmap needs to be created, creating a copy of the bitmap for each thread, modifying the bitmap copy belonging to each thread when each thread needs to modify operation, then sending the modifying operation to other threads, and then executing the modification of the respective bitmap copy by other threads. Under the scheme, the memory loss is very large, and when the bitmap operation command is frequent, the performance of the program is also greatly influenced.
In summary, how to occupy as little storage space as possible in management of bitmaps and reduce program performance loss caused by bitmap updating as much as possible is a technical problem that needs to be solved urgently by those skilled in the art.
Disclosure of Invention
The invention aims to provide a bitmap management method, a bitmap management device, bitmap management equipment and a readable storage medium, which occupy less storage space and have low program performance loss.
In order to solve the technical problems, the invention provides the following technical scheme:
a bitmap management method, comprising:
after receiving a bitmap creation command, creating a bitmap copy containing reference counts;
sending the address of the bitmap copy to each thread, and setting the reference count as the total number of the threads;
counting bitmap updating commands received by the address within a preset time interval;
copying the bitmap copy to obtain a new bitmap copy;
executing the bitmap updating command on the new bitmap copy to serve as an updated bitmap copy;
and sending the address of the updated bitmap copy to each thread so that the thread stores the address of the updated bitmap copy after finishing the business process of the bitmap copy, adding 1 to the reference count of the updated bitmap copy, and subtracting 1 from the reference count of the bitmap copy.
Optionally, after the subtracting 1 from the reference count of the bitmap copy, the method further includes:
judging whether the reference count of the bitmap copy is 0 or not;
and if so, deleting the bitmap copy.
Optionally, the executing the bitmap update command on the new bitmap copy includes:
and sequentially executing the new bitmap copies according to the receiving sequence of the bitmap updating commands.
Optionally, counting bitmap update commands received by the address within a preset time interval includes:
and performing the step of counting the bitmap updating commands received by the addresses at preset time intervals.
A bitmap management apparatus, comprising:
the bitmap creating unit is used for creating a bitmap copy containing reference counts after receiving a bitmap creating command;
the address propagation unit is used for sending the address of the bitmap copy to each thread and setting the reference count as the total number of the threads;
the command counting unit is used for counting bitmap updating commands received by the addresses within a preset time interval;
the bitmap copying unit is used for copying the bitmap copy to obtain a new bitmap copy;
a command execution unit, configured to execute the bitmap update command on the new bitmap copy as an update bitmap copy;
and the address updating unit is used for sending the address of the updated bitmap copy to each thread so that the thread stores the address of the updated bitmap copy after finishing the business process of the bitmap copy, adds 1 to the reference count of the updated bitmap copy and subtracts 1 from the reference count of the bitmap copy.
Optionally, the bitmap management apparatus further includes a bitmap deletion unit, connected to the address update unit, and configured to determine whether a reference count of the bitmap copy is 0 after the reference count of the bitmap copy is decremented by 1; and if so, deleting the bitmap copy.
Optionally, the command execution unit is specifically configured to: and sequentially executing the new bitmap copies according to the receiving sequence of the bitmap updating commands.
Optionally, the command statistics unit is specifically configured to: and performing the step of counting the bitmap updating commands received by the addresses at preset time intervals.
A computer device, comprising:
a memory for storing a computer program;
and the processor is used for realizing the steps of the bitmap management method when executing the computer program.
A readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the bitmap management method described above.
According to the method provided by the embodiment of the invention, when the bitmap is created, only one bitmap copy is created in the program, the operation of each thread on the bitmap is performed aiming at the bitmap copy, and the storage space is greatly saved for a large-capacity bitmap; meanwhile, after receiving an operation request for the bitmap copy, the method is not executed immediately, but collects and combines the bitmap updating operation commands in different time periods so as to reduce the performance loss, wherein in the combination execution of the updating command, an execution object is not an original bitmap copy, but a new bitmap copy obtained after the bitmap copy is copied so as to avoid the bitmap state change before the business process of the bitmap copy is not finished by other threads, and the stability and the continuity of the business process are ensured; in the management of the whole bitmap, each thread only needs to acquire and store the address of the bitmap, a real bitmap copy does not need to be stored, the threads do not interfere with each other, and the performance loss can be reduced.
Accordingly, embodiments of the present invention further provide a bitmap management apparatus, a device, and a readable storage medium corresponding to the bitmap management method, which have the above technical effects and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present invention or technical solutions in related arts, the drawings used in the description of the embodiments or related arts will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flowchart illustrating an implementation of a bitmap management method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a bitmap management apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The core of the invention is to provide a bitmap management method, which occupies less storage space and has low program performance loss.
In order that those skilled in the art will better understand the disclosure, the invention will be described in further detail with reference to the accompanying drawings and specific embodiments. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
When updating and modifying the bitmap, the multithread program needs to satisfy a data Consistency (Consistency) requirement when changing the data that each thread needs to access. Data consistency can be divided into strong consistency and weak consistency. The strong consistency requires that when all threads access the target data at any time, the target data are consistent; weak consistency is only required as long as the target data accessed by each thread keeps a trend of convergence all the time.
At present, two methods are mainly adopted for managing bitmaps, one of which is that when a bitmap needs to be created, only one bitmap and a lock bound with the bitmap are created, and when a thread needs to perform a modification operation on the bitmap, the thread locks the bitmap by using the lock bound with the bitmap and then performs the modification on the bitmap. In the process, when other threads need to access the bitmap, the other threads also try to lock the bitmap, but the process fails because the previous threads are successfully locked, and the service can be continued only if the previous threads complete modification of the bitmap and release the lock and then the other threads can acquire the lock and continue to access the modified bitmap. In the scheme, once a certain thread modifies the bitmap, other threads see the modified bitmap, so that the scheme can meet the requirement of strong consistency. However, in the management method, after the thread locks the bitmap for modifying the bitmap, other threads cannot access the bitmap, and the service processing process is blocked, which results in low program performance.
And secondly, when the bitmap needs to be created, a copy of the bitmap is created for each thread, and each copy can be accessed and modified only by the owner thread of the copy. When one of the threads needs to perform the modification operation on the bitmap (for example, a user issues a bitmap modification command to the management thread), the thread can modify the bitmap copy belonging to the thread immediately, then the modification operation is encapsulated into a message to be sent to other threads, and after the other threads subsequently receive the message sent to the thread before, the other threads perform the modification on the bitmap copies of the threads respectively, so as to ensure that the modification of one thread can be synchronized with the bitmap copies corresponding to the other threads. However, in this scheme, as many bitmap copies are required for as many threads as there are, and especially when a large-capacity bitmap is processed, such memory loss is very large; in addition, when the bitmap operation command is very frequent, the performance of the program is also greatly affected, because each thread performs one transmission or reception of a message and one modification of the bitmap for each bitmap modification operation.
Based on the above prior art, the present application aims to occupy as little storage space as possible when managing bitmaps, and to reduce program performance loss caused by bitmap updating as much as possible. Based on the above, a bitmap management method is provided, which can ensure weak consistency synchronization of bitmaps. Referring to fig. 1, fig. 1 is a flowchart illustrating a bitmap management method according to an embodiment of the present invention, where the method mainly includes the following steps:
s101, after receiving a bitmap creation command, creating a bitmap copy containing reference counts;
when a program creates a bitmap, only one bitmap copy is created, and the bitmap copy contains reference counts in addition to necessary bitmap data, and the reference counts are used for indicating how many threads are currently using the bitmap, for example, when the reference count of the bitmap copy is 3, 3 threads are using the bitmap copy.
S102, sending the address of the bitmap copy to each thread, and setting the reference count as the total number of the threads;
the addresses of the newly created bitmap copies are sent to each thread so that each thread can access the bitmap copies based on the addresses to implement the operation of the threads on the bitmap copies. The reference count in the bitmap copy is increased to be consistent with the thread number, for example, there are 3 threads currently, and the reference count of the bitmap copy is set to 3.
It should be noted that the threads described in this embodiment only refer to threads used for managing or operating the bitmap in the system, and do not include threads for other purposes, for example, there are 500 threads in the system in total, where when 10 threads are allocated for managing or operating the bitmap, only the addresses of the bitmap copy need to be sent to the 10 threads, and when the reference count is initially set, the total number of threads used for managing or operating the bitmap is also set (10).
S103, counting bitmap updating commands received by the address at preset time intervals;
when a certain thread receives a bitmap updating command (for example, a management thread receives a bitmap updating operation command of a user), the updating operation is not executed immediately, and all the updating operation commands in the time interval are collected uniformly after a fixed or non-fixed time period, so that the uniform operation is performed.
It should be noted that, counting the bitmap update commands in a time interval may be executed at regular time, or triggered manually, and to improve the automation degree, counting the bitmap update commands received by the address in the preset time interval may specifically be: and executing the step of counting the bitmap updating command received by the address at preset time intervals. And setting a fixed time interval, and triggering the step of counting the commands after every fixed time length, so that the commands are ensured to be executed as soon as possible, and the user experience is improved.
S104, copying the bitmap copy to obtain a new bitmap copy;
in this embodiment, the operation for the bitmap copy is not directly applied to the bitmap copy, so as to prevent the bitmap from changing in the complete service process of other threads that depend on the bitmap, and all the bitmap is applied to the copied bitmap to form a new bitmap. Specifically, a bitmap copy needs to be copied first to serve as a new bitmap copy, and it should be noted that the new bitmap copy also contains reference counts.
S105, executing a bitmap updating command on the new bitmap copy to serve as an updated bitmap copy;
and after the new bitmap copy is obtained through copying, executing all bitmap updating commands within a preset time interval obtained through statistics according to the new bitmap copy.
In this embodiment, the execution mode of the command is not limited, and to ensure the validity of each operation, the corresponding commands may be sequentially executed on the new bitmap copy according to the receiving order of the bitmap update commands.
S106, sending the address of the updated bitmap copy to each thread, so that the thread stores the address of the updated bitmap copy after finishing the business process of the bitmap copy, adding 1 to the reference count of the updated bitmap copy, and subtracting 1 from the reference count of the bitmap copy.
And encapsulating the address of the updated bitmap copy into a message and sending the message to other threads. And after receiving the message, other threads update the respective saved bitmap addresses to the addresses of the updated bitmap copy, add 1 to the reference count of the updated bitmap copy, and subtract 1 from the reference count in the old bitmap (bitmap copy) so as to determine the thread calling conditions of the old bitmap and the new bitmap.
Each thread needs to store the address of the updated bitmap copy after finishing the business process of the bitmap copy, and adds 1 to the reference count of the updated bitmap copy, and subtracts 1 from the reference count of the bitmap copy. After the service process for the old bitmap is finished, the general thread receives a message, namely an address updating message, and updates the bitmap address to ensure continuous and complete execution of a task process; if the thread is set to receive messages simultaneously in the business process for some special reasons, then the process ending mark needs to be set, after receiving the address updating message, it needs to judge whether the process ending mark is in the finished state, if it is finished, then the reference count of the new bitmap is +1, the reference count of the old bitmap is-1, if it is in the unfinished state, then it needs to wait for the current business process to finish and then execute the address updating step.
It should be noted that, the above steps describe a bitmap management process within a preset time interval, and after entering the next time interval, step S103 to step S106 may be repeatedly executed; if a new bitmap needs to be created, step S101 and the following steps may be repeatedly performed.
Based on the above description, in the technical solution provided in the embodiments of the present invention, when creating a bitmap, only one bitmap copy is created in a program, and operations on the bitmap by each thread are performed on the bitmap copy, so that for a large-capacity bitmap, a storage space is greatly saved; meanwhile, after receiving an operation request for the bitmap copy, the method is not executed immediately, but collects and combines the bitmap updating operation commands in different time periods so as to reduce the performance loss, wherein in the combination execution of the updating command, an execution object is not an original bitmap copy, but a new bitmap copy obtained after the bitmap copy is copied so as to avoid the bitmap state change before the business process of the bitmap copy is not finished by other threads, and the stability and the continuity of the business process are ensured; in the management of the whole bitmap, each thread only needs to acquire and store the address of the bitmap, a real bitmap copy does not need to be stored, the threads do not interfere with each other, and the performance loss can be reduced.
It should be noted that, based on the above embodiments, the embodiments of the present invention also provide corresponding improvements. In the preferred/improved embodiment, the same steps as those in the above embodiment or corresponding steps may be referred to each other, and corresponding advantageous effects may also be referred to each other, which are not described in detail in the preferred/improved embodiment herein.
Further, after the step S160 in the above embodiment performs subtracting 1 from the reference count of the bitmap copy, in order to reduce the space occupation of bitmap management, the following steps may be further performed:
(1) judging whether the reference count of the bitmap copy is 0 or not;
(2) and if so, deleting the bitmap copy.
And judging whether the reference count of the bitmap copy is 0 or not, judging whether threads reference the old bitmap according to the reference count, if the reference count is 0, indicating that all the current service processes aiming at the bitmap copy are finished, and no thread references the old bitmap currently, wherein the old bitmap can be directly deleted in order to reduce the space occupation of the old bitmap copy. If not 0, this embodiment is not limited to this case, and any step may not be performed.
Corresponding to the above method embodiments, the embodiments of the present invention further provide a bitmap management apparatus, and the bitmap management apparatus described below and the bitmap management method described above may be referred to in correspondence with each other.
Referring to fig. 2, the apparatus includes the following modules:
the bitmap creation unit 110 is mainly used for creating a bitmap copy containing reference counts after receiving a bitmap creation command;
the address propagation unit 120 is mainly configured to send the address of the bitmap copy to each thread, and set the reference count as the total number of threads;
the command counting unit 130 is mainly used for counting bitmap updating commands received by addresses within a preset time interval;
the bitmap copying unit 140 is mainly used for copying the bitmap copy to obtain a new bitmap copy;
the command executing unit 150 is mainly configured to execute a bitmap update command on the new bitmap copy as an update bitmap copy;
the address updating unit 160 is mainly configured to send the address of the updated bitmap copy to each thread, so that the thread stores the address of the updated bitmap copy after the service process of the bitmap copy is completed, and adds 1 to the reference count of the updated bitmap copy, and subtracts 1 from the reference count of the bitmap copy.
In a specific embodiment of the present invention, the bitmap management apparatus further includes a bitmap deletion unit, connected to the address update unit, for determining whether the reference count of the bitmap copy is 0 after subtracting 1 from the reference count of the bitmap copy; and if so, deleting the bitmap copy.
In an embodiment of the present invention, the command execution unit is specifically configured to: and sequentially executing the new bitmap copies according to the receiving sequence of the bitmap updating commands.
In an embodiment of the present invention, the command statistics unit is specifically configured to: and executing the step of counting the bitmap updating command received by the address at preset time intervals.
Corresponding to the above method embodiment, an embodiment of the present invention further provides a computer device, and a computer device described below and a bitmap management method described above may be referred to in correspondence.
The computer device includes:
a memory for storing a computer program;
a processor for implementing the steps of the bitmap management method of the above-described method embodiments when executing a computer program.
Specifically, referring to fig. 3, a specific structural diagram of a computer device provided in this embodiment is a schematic diagram of a computer device, which may generate relatively large differences due to different configurations or performances, and may include one or more processors (CPUs) 322 (e.g., one or more processors) and a memory 332, where the memory 332 stores one or more computer applications 342 or data 344. Memory 332 may be, among other things, transient or persistent storage. The program stored in memory 332 may include one or more modules (not shown), each of which may include a sequence of instructions operating on a data processing device. Still further, the central processor 322 may be configured to communicate with the memory 332 to execute a series of instruction operations in the memory 332 on the computer device 301.
The computer device 301 may also include one or more power supplies 326, one or more wired or wireless network interfaces 350, one or more input-output interfaces 358, and/or one or more operating systems 341.
The steps in the bitmap management method described above can be implemented by the structure of the computer device provided in the present embodiment.
Corresponding to the above method embodiment, an embodiment of the present invention further provides a readable storage medium, and a readable storage medium described below and a bitmap management method described above may be referred to in correspondence with each other.
A readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the bitmap management method of the above-mentioned method embodiments.
The readable storage medium may be a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and various other readable storage media capable of storing program codes.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
Claims (10)
1. A bitmap management method, comprising:
after receiving a bitmap creation command, creating a bitmap copy containing reference counts; the reference count is used to indicate how many threads are currently using the bitmap copy;
sending the address of the bitmap copy to each thread, and setting the reference count as the total number of the threads;
counting bitmap updating commands received by the address within a preset time interval;
copying the bitmap copy to obtain a new bitmap copy; the new bitmap copy also contains a reference count;
executing the bitmap updating command on the new bitmap copy to serve as an updated bitmap copy;
and sending the address of the updated bitmap copy to each thread so that the thread stores the address of the updated bitmap copy after finishing the business process of the bitmap copy, adding 1 to the reference count of the updated bitmap copy, and subtracting 1 from the reference count of the bitmap copy.
2. The bitmap management method according to claim 1, further comprising, after the subtracting 1 from the reference count of the bitmap copy:
judging whether the reference count of the bitmap copy is 0 or not;
and if so, deleting the bitmap copy.
3. The bitmap management method of claim 1, wherein the executing the bitmap update command on the new bitmap copy comprises:
and sequentially executing the new bitmap copies according to the receiving sequence of the bitmap updating commands.
4. The bitmap management method according to claim 1, wherein the counting bitmap update commands received at the address within the preset time interval comprises:
and performing the step of counting the bitmap updating commands received by the addresses at preset time intervals.
5. A bitmap management apparatus, comprising:
the bitmap creating unit is used for creating a bitmap copy containing reference counts after receiving a bitmap creating command; the reference count is used to indicate how many threads are currently using the bitmap copy;
the address propagation unit is used for sending the address of the bitmap copy to each thread and setting the reference count as the total number of the threads;
the command counting unit is used for counting bitmap updating commands received by the addresses within a preset time interval;
the bitmap copying unit is used for copying the bitmap copy to obtain a new bitmap copy; the new bitmap copy also contains a reference count;
a command execution unit, configured to execute the bitmap update command on the new bitmap copy as an update bitmap copy;
and the address updating unit is used for sending the address of the updated bitmap copy to each thread so that the thread stores the address of the updated bitmap copy after finishing the business process of the bitmap copy, adds 1 to the reference count of the updated bitmap copy and subtracts 1 from the reference count of the bitmap copy.
6. The bitmap management apparatus according to claim 5, further comprising a bitmap deletion unit connected to the address update unit, configured to determine whether the reference count of the bitmap copy is 0 after the reference count of the bitmap copy is decremented by 1; and if so, deleting the bitmap copy.
7. The bitmap management apparatus according to claim 5, wherein the command execution unit is specifically configured to: and sequentially executing the new bitmap copies according to the receiving sequence of the bitmap updating commands.
8. The bitmap management apparatus according to claim 5, wherein the command statistics unit is specifically configured to: and performing the step of counting the bitmap updating commands received by the addresses at preset time intervals.
9. A computer device, comprising:
a memory for storing a computer program;
processor for implementing the steps of the bitmap management method according to any of claims 1 to 4 when executing the computer program.
10. A readable storage medium, having stored thereon a computer program which, when executed by a processor, carries out the steps of the bitmap management method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110803604.XA CN113284039B (en) | 2021-07-16 | 2021-07-16 | Bitmap management method, device and equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110803604.XA CN113284039B (en) | 2021-07-16 | 2021-07-16 | Bitmap management method, device and equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113284039A CN113284039A (en) | 2021-08-20 |
| CN113284039B true CN113284039B (en) | 2021-10-08 |
Family
ID=77286655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110803604.XA Active CN113284039B (en) | 2021-07-16 | 2021-07-16 | Bitmap management method, device and equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113284039B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114546978B (en) * | 2022-02-18 | 2024-01-26 | 苏州浪潮智能科技有限公司 | Bitmap management method, system, equipment and medium for storage cluster |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005301590A (en) * | 2004-04-09 | 2005-10-27 | Hitachi Ltd | Storage system and data copying method |
| WO2006052888A2 (en) * | 2004-11-05 | 2006-05-18 | Trusted Data Corporation | Dynamically expandable and contractible fault-tolerant storage system permitting variously sized storage devices and method |
| CN101676906B (en) * | 2008-09-18 | 2013-06-05 | 中兴通讯股份有限公司 | Method of managing memory database space by using bitmap |
| CN103207867B (en) * | 2012-01-16 | 2019-04-26 | 联想(北京)有限公司 | It handles the method for data block, initiate the method and node of recovery operation |
| US9501240B2 (en) * | 2014-02-21 | 2016-11-22 | International Business Machines Corporation | Efficient free-space management of multi-target peer-to-peer remote copy (PPRC) modified sectors bitmap in bind segments |
| CN109460662B (en) * | 2018-11-05 | 2020-12-18 | 杭州安恒信息技术股份有限公司 | Path feedback-based Javascript engine fuzzy test method and device |
| US20200311042A1 (en) * | 2019-04-01 | 2020-10-01 | Intel Corporation | Hardware index mapping mechanism |
| CN111158958B (en) * | 2019-12-31 | 2020-11-13 | 广州鼎甲计算机科技有限公司 | Backup method, system, device and storage medium capable of quickly recovering data |
-
2021
- 2021-07-16 CN CN202110803604.XA patent/CN113284039B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113284039A (en) | 2021-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109493076B (en) | Kafka message unique consumption method, system, server and storage medium | |
| CN111880936B (en) | Resource scheduling method, device, container cluster, computer equipment and storage medium | |
| CN113284039B (en) | Bitmap management method, device and equipment and readable storage medium | |
| CN111291062B (en) | Data synchronous writing method and device, computer equipment and storage medium | |
| CN111177254A (en) | Method and device for data synchronization between heterogeneous relational databases | |
| CN109697112B (en) | Distributed intensive one-stop operating system and implementation method | |
| CN111897643A (en) | Thread pool configuration system, method, device and storage medium | |
| CN111984196A (en) | File migration method, device, equipment and readable storage medium | |
| CN114900449B (en) | Resource information management method, system and device | |
| CN112463757A (en) | Resource access method of distributed system and related device | |
| CN114780177A (en) | Transaction execution method and device, storage medium and electronic device | |
| CN108509281A (en) | Message storage method and device | |
| CN110851199A (en) | Information protection system in power system and initialization method thereof | |
| CN113094431A (en) | Read-write separation method and device and server | |
| CN112667437A (en) | Multi-copy distributed cluster recovery method, device, equipment and storage medium | |
| CN113360272A (en) | Access processing method and device of shared resource, electronic equipment and storage medium | |
| CN110569231A (en) | Data migration method, device, equipment and medium | |
| CN111405313A (en) | Method and system for storing streaming media data | |
| CN117407356B (en) | Inter-core communication method and device based on shared memory, storage medium and terminal | |
| CN110096552A (en) | A kind of read-write method of business datum, device, equipment and storage medium | |
| CN116719626B (en) | Multithreading parallel processing method and processing system for splitting mass data | |
| CN115328880B (en) | Distributed file online recovery method, system, computer equipment and storage medium | |
| CN113282245B (en) | Method for auditing supply number and host platform | |
| CN116719481B (en) | Configuration data processing method and device and related equipment | |
| CN110879747B (en) | Resource management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |