CN114443248A - Object life cycle management method, device, electronic device and storage medium - Google Patents

Abstract

The application provides a method and a device for managing a life cycle of an object, electronic equipment and a storage medium, and relates to the technical field of data processing. For any processing queue, based on the work thread allocated to any processing queue, the object information of the object to be processed can be read from any processing queue, and the data of the object to be processed is processed according to the object information. The processing queue may include object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which the object to be processed belongs, and the work thread allocated to each processing queue is related to the queue priority of the corresponding processing queue. Therefore, the data of the objects can be isolated and processed through the priority, the problem that the processing speed of all the objects is reduced due to the fact that the data of a certain object is processed at a low speed is avoided, and the efficiency of life cycle management of the objects is improved.

Description

Object life cycle management method, device, electronic device and storage medium

technical field

The present application relates to the technical field of data processing, and in particular, to a method, apparatus, electronic device and storage medium for life cycle management of an object.

Background technique

Ceph object storage provides the life cycle management function of objects. According to the life cycle configuration rules, expired objects can be deleted or expired objects can be migrated to a storage pool of a specified category. Ceph can scan the index pool sharded data of the bucket, read the modification time of the objects one by one, compare them with the life cycle configuration rules, and delete or migrate the objects if they meet the conditions.

However, the sharding of the index is based on hash rules. The indexes of different services and different storage pools are mixed together in the index pool. If a certain service is under great pressure or a certain storage pool fails, the As a result, the speed of deleting or migrating objects related to the business or the storage pool decreases, which in turn leads to a decrease in the efficiency of life cycle management for all objects.

SUMMARY OF THE INVENTION

In order to solve the existing technical problems, the embodiments of the present application provide an object life cycle management method, apparatus, electronic device and storage medium, which can improve the efficiency of life cycle management for all objects.

In order to achieve the above purpose, the technical solutions of the embodiments of the present application are implemented as follows:

In a first aspect, an embodiment of the present application provides a life cycle management method for an object, the method comprising:

For any processing queue, based on the worker thread allocated to the any processing queue, read the object information of the object to be processed from the any processing queue, and according to the read object information of the object to be processed, processing the data of the object to be processed;

The processing queue includes object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which it belongs, and the work of the processing queue with a higher queue priority The number of threads is greater than the number of worker threads for the processing queue of the lower queue priority, or the worker thread start time of the processing queue of the higher queue priority is earlier than the start time of the worker threads of the processing queue of the lower queue priority.

The object life cycle management method provided by the embodiment of the present application, for any processing queue, based on the worker thread allocated to any processing queue, can read the object information of the to-be-processed object from any processing queue, and according to the read The object information of the object to be processed is processed, and the data of the object to be processed is processed. The processing queue may include object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which it belongs, and the worker thread of the processing queue with a higher queue priority There are more worker threads than the processing queue of the lower queue priority, or the processing queue of the higher queue priority has a worker thread start time that is earlier than the start time of the worker thread of the processing queue of the lower queue priority. Because the object information of the to-be-processed objects of different object priorities can be placed in the processing queues of different queue priorities, and the worker thread is used to read the object information of the to-be-processed objects from the corresponding processing queues. The data of the object is processed, so that objects with different priorities can be isolated through the queue, which avoids the slow processing speed of the data of a certain object, which reduces the processing speed of all objects and improves the processing speed of the object. Efficiency of Lifecycle Management.

In an optional embodiment, the object priority of the object to be processed is determined in the following manner:

A corresponding object priority is set for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object.

In this embodiment, since different object priorities can be set for objects to be processed with different system conditions or business requirements, the objects to be processed can be processed according to different object priorities, and the processing of objects can be improved. s efficiency.

In an optional embodiment, setting a corresponding object priority for the object to be processed according to the system status or business requirement corresponding to the object to be processed includes:

If the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, set a first object priority for the object to be processed;

If the corresponding system status of the to-be-processed object fails, or the business requirement corresponding to the to-be-processed object is to be processed later, a second object priority is set for the to-be-processed object; the first object priority higher than the second object priority.

In this embodiment, if the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, the first object priority is set for the object to be processed. If a fault occurs, or the business requirement corresponding to the object to be processed is to be processed later, a second object priority is set for the object to be processed. The priority of the first object is higher than the priority of the second object. Therefore, according to the normal operation or failure of the system status, and whether the business needs are processed immediately or later, a relatively high or relatively low object priority can be set for different objects to be processed respectively, and then different objects can be processed according to different objects. Priority, to process the data of different objects separately, and improve the efficiency of processing all objects.

In an optional embodiment, before the object information of the object to be processed is read from any one of the processing queues, the method further includes:

According to the object priority of the object to be processed, determine the queue priority that is the same as the object priority;

The object information of the object to be processed is placed in a processing queue corresponding to the queue priority.

In this embodiment, a queue priority that is the same as the object priority may be determined according to the object priority of the object to be processed, and the object information of the object to be processed is placed in the processing queue corresponding to the queue priority. Therefore, all the objects to be processed can be isolated and processed through the processing queues with different queue priorities, and then the corresponding worker threads can be used to process the data of the objects to be processed in the processing queues with different queue priorities respectively. The speed at which the object is processed.

In an optional embodiment, the object information includes an identifier corresponding to the object to be processed and processing requirements; the object information of the object to be processed is read according to the object information of the object to be processed. Data is processed, including:

According to the identifier corresponding to the object to be processed, look up the index information matching the identifier from the index memory;

According to the index information, the original storage location of the data of the object to be processed in the data memory is determined, and the data of the object to be processed is processed according to the processing requirements corresponding to the object to be processed.

In this embodiment, according to the identifier corresponding to the object to be processed included in the object information, the index information matching the identifier can be searched from the index memory, and the data describing the object to be processed can be determined according to the found index information. The data of the object to be processed is processed at the original storage location in the data storage and according to the processing requirements corresponding to the object to be processed included in the object information, so that the object to be processed can be processed more efficiently and the efficiency of processing the object can be improved .

In an optional embodiment, the processing of the data of the object to be processed according to the processing requirements corresponding to the object to be processed includes:

If the processing request instructs to delete the data of the object to be processed, delete the data of the object to be processed from the original storage location, and delete the index information from the index memory;

If the processing request indicates to perform a migration operation on the data of the object to be processed, the data of the object to be processed is migrated from the original storage location to the target storage location included in the object information, and the data of the object to be processed is migrated to the target storage location included in the object information. The index information in the index memory is updated.

In this embodiment, if the processing requirement corresponding to the object to be processed indicates that the data of the object to be processed is to be deleted, the data of the object to be processed can be deleted from the original storage location in the data storage, and the corresponding index information can be deleted. Delete from the index storage. If the processing requirement corresponding to the object to be processed indicates that the data of the object to be processed is to be migrated, the data of the object to be processed can be migrated from the original storage location in the data storage to the object of the object to be processed. At the target storage location included in the information, the corresponding index information in the index memory is updated, so that the deletion or migration operation of the object can be performed respectively according to the processing requirements corresponding to the object.

In a second aspect, an embodiment of the present application further provides an apparatus for managing a life cycle of an object, the apparatus comprising:

an object information reading unit, configured to, for any processing queue, read the object information of the object to be processed from the any processing queue based on the worker thread allocated to the processing queue; wherein, the processing queue It includes object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which it belongs, and the number of worker threads in the processing queue with a higher queue priority is more than that of a lower queue priority. The number of worker threads of the processing queue of the queue priority, or the start time of the worker thread of the processing queue of the higher queue priority is earlier than the start time of the worker thread of the processing queue of the lower queue priority;

The data processing unit is configured to process the data of the to-be-processed object according to the read object information of the to-be-processed object.

In an optional embodiment, the apparatus further includes a priority determination unit, configured to:

A corresponding object priority is set for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object.

In an optional embodiment, the priority determining unit is specifically configured to:

If the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, set a first object priority for the object to be processed;

If the corresponding system status of the to-be-processed object fails, or the business requirement corresponding to the to-be-processed object is to be processed later, a second object priority is set for the to-be-processed object; the first object priority higher than the second object priority.

In an optional embodiment, the apparatus further includes a queue adding unit for:

According to the object priority of the object to be processed, determine the queue priority that is the same as the object priority;

The object information of the object to be processed is placed in a processing queue corresponding to the queue priority.

In an optional embodiment, the object information includes an identifier corresponding to the object to be processed and processing requirements; the data processing unit is specifically configured to:

According to the identifier corresponding to the object to be processed, look up the index information matching the identifier from the index memory;

According to the index information, the original storage location of the data of the object to be processed in the data memory is determined, and the data of the object to be processed is processed according to the processing requirements corresponding to the object to be processed.

In an optional embodiment, the data processing unit is further configured to:

If the processing request instructs to delete the data of the object to be processed, delete the data of the object to be processed from the original storage location, and delete the index information from the index memory;

If the processing request indicates to perform a migration operation on the data of the object to be processed, the data of the object to be processed is migrated from the original storage location to the target storage location included in the object information, and the data of the object to be processed is migrated to the target storage location included in the object information. The index information in the index memory is updated.

In a third aspect, embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the life of the object of the first aspect is realized. cycle management approach.

In a fourth aspect, embodiments of the present application further provide an electronic device, including a memory and a processor, where the memory stores a computer program that can run on the processor, and when the computer program is executed by the processor When executed, the processor is caused to implement the object lifecycle management method of the first aspect.

For the technical effects brought by any one of the implementation manners of the second aspect to the fourth aspect, reference may be made to the technical effects brought by the corresponding implementation manners in the first aspect, which will not be repeated here.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present application more clearly, the following briefly introduces the drawings used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without any creative effort.

FIG. 1 is a flowchart of a method for life cycle management of an object provided by an embodiment of the present application;

FIG. 2 is a schematic diagram of a life cycle management method of an object provided by an embodiment of the present application;

3 is a flowchart of another object lifecycle management method provided by an embodiment of the present application;

FIG. 4 is a process flow diagram of an object life cycle management system provided by an embodiment of the present application;

FIG. 5 is a schematic structural diagram of a device for managing a life cycle of an object according to an embodiment of the present application;

FIG. 6 is a schematic structural diagram of another object life cycle management apparatus provided by an embodiment of the present application;

FIG. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the present application.

It should be noted that the terms "comprising" and "having" and their variants mentioned in the documents of this application are intended to cover non-exclusive inclusion, for example, a process, method, system, product including a series of steps or units Or apparatus is not necessarily limited to those steps or units expressly listed, but may include other steps or units not expressly listed or inherent to the process, method, product or apparatus.

The technical solutions provided by the embodiments of the present application will be described in detail below with reference to the accompanying drawings.

As used hereinafter, the word "exemplary" means "serving as an example, embodiment, or illustration." Any embodiment described as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments. In the description of the embodiments of the present application, unless otherwise specified, "plurality" means two or more.

The embodiment of the present application provides a life cycle management method for an object, as shown in FIG. 1 , including the following steps:

Step S101 , for any processing queue, based on the worker thread allocated to any processing queue, read the object information of the object to be processed from any processing queue.

The processing queue includes object information of at least one to-be-processed object, the object priority of the to-be-processed object in the processing queue matches the queue priority of the processing queue to which it belongs, and the processing queue with a higher queue priority has more worker threads than The number of worker threads for a processing queue with a lower queue priority, or the worker thread start time for a processing queue with a higher queue priority is earlier than that for a processing queue with a lower queue priority.

Optionally, a corresponding object priority may be set for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object.

Specifically, if the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, a first object priority is set for the object to be processed. If the corresponding system status of the object to be processed fails, or the business requirement corresponding to the object to be processed is to be processed later, a second object priority is set for the object to be processed. The priority of the first object is higher than the priority of the second object.

After the object priority is set for the object to be processed, the queue priority that is the same as the object priority can be determined according to the object priority of the object to be processed, and the object information of the object to be processed is placed in the processing queue corresponding to the queue priority .

For example, as shown in FIG. 2 , there are 3 to-be-processed objects, namely, to-be-processed object A, to-be-processed object B, and to-be-processed object C, and the object priority of the to-be-processed object A is 1, and the object priority of the to-be-processed object B is If it is 2, the object priority of the object C to be processed is 3. Wherein, the object priority is 1 greater than the object priority 2 is greater than the object priority 3.

According to the object priorities corresponding to the objects to be processed, the object information of the to-be-processed object A with the object priority of 1 can be placed in the processing queue a corresponding to the queue priority of 1, and the object to be processed with the object priority of 2. The object information of B is placed in the processing queue b corresponding to the queue priority of 2, and the object information of the to-be-processed object C with the object priority of 3 is placed in the processing queue c corresponding to the queue priority of 3.

According to the queue priority, a total of 3 worker threads can be allocated to the processing queue a with queue priority 1, including worker thread a1, worker thread a2 and worker thread a3, and the processing queue b with queue priority 2 can be allocated worker thread b1 and work thread Thread b2 has a total of 2 worker threads, and assigns a total of 1 worker thread c1 to the processing queue c with a queue priority of 3.

And the start time of worker thread a1, worker thread a2 and worker thread a3 reading object information of pending object A from processing queue a is earlier than that of worker thread b1 and worker thread b2 reading pending object B from processing queue b The start time of the object information, the start time of the worker thread b1 and the worker thread b2 to read the object information of the to-be-processed object B from the processing queue b is earlier than the start time of the worker thread c1 to read the object of the to-be-processed object C from the processing queue c The start time of the message.

Step S102, according to the read object information of the object to be processed, process the data of the object to be processed.

Wherein, the object information of the object to be processed includes an identifier and a processing requirement corresponding to the object to be processed.

After reading the object information of the object to be processed, the worker thread can search for the index information matching the identification from the index memory according to the identifier corresponding to the object to be processed included in the object information, and according to the found index information, Determine the original storage location of the data of the object to be processed in the data storage.

For example, the object to be processed may be a file, and the identifier corresponding to the object to be processed may be a file name, and the worker thread may search the index memory for index information matching the file name according to the file name, and the index information may be a file According to the storage information of the file, the original storage location of the file in the data storage can be determined.

After determining the original storage location of the data of the object to be processed in the data storage, if the processing requirement corresponding to the object to be processed indicates that the data of the object to be processed is deleted, the data of the object to be processed can be deleted from the original storage location , and delete the index information corresponding to the object to be processed from the index memory.

If the processing requirement corresponding to the object to be processed indicates that the data of the object to be processed is migrated, the data of the object to be processed can be migrated from the original storage location to the target storage location included in the object information of the object to be processed, and the The index information corresponding to the object to be processed in the index memory is updated.

In an embodiment, the object lifecycle management method provided in the embodiment of the present application can also be implemented according to the process shown in FIG. 3 , as shown in FIG. 3 , including the following steps:

Step S301, determining the object to be processed and the object priority of the object to be processed.

Before processing the data of the object to be processed, it is necessary to set a corresponding object priority for each object to be processed according to the system status or business requirements corresponding to each object to be processed.

Step S302, according to the object priority of the object to be processed, determine a queue priority that is the same as the object priority, and place the object information of the to-be-processed object in a processing queue corresponding to the queue priority.

After the object priority corresponding to each object to be processed is set, for an object to be processed, the queue priority that is the same as the object priority can be determined according to the object priority of the object to be processed, and the object information of the object to be processed can be determined. Placed in the processing queue corresponding to the queue priority.

The number of queue priorities and object priorities is the same, and the object information of an object to be processed corresponding to an object priority can be placed in a processing queue corresponding to a queue priority that is the same as the object priority.

Step S303, based on the assigned worker thread, read the object information of the object to be processed from the processing queue.

After the pending queue is placed in the processing queue, the corresponding worker thread can be assigned to the processing object. Among them, the number of worker threads of the processing queue with higher queue priority is more than the number of worker threads of the processing queue with lower queue priority, or the start time of worker threads of the processing queue with higher queue priority is earlier than that of the lower queue priority The worker thread start time of the processing queue of the level.

Based on the assigned worker thread, object information for pending objects can be read from the processing queue.

Step S304, according to the identifier corresponding to the object to be processed included in the object information, search for index information matching the identifier corresponding to the object to be processed from the index memory.

The object information of the object to be processed may include an identifier corresponding to the object to be processed, and according to the identifier corresponding to the object to be processed, index information matching the identifier can be searched from the index memory.

Step S305, according to the index information, determine the original storage location of the data of the object to be processed in the data storage.

According to the found index information, the original storage location of the data of the object to be processed in the data storage can be determined.

Step S306, if the processing requirement corresponding to the object to be processed included in the object information indicates that the data of the object to be processed is deleted, the data of the object to be processed is deleted from the original storage location, and the index information is deleted from the index memory.

The object information of the object to be processed may also include the processing request corresponding to the object to be processed. If the processing request indicates that the data of the object to be processed is deleted, the data of the object to be processed can be deleted from the original storage location in the data storage, and delete the index information from the index memory.

Step S307, if the processing requirement indicates that the data of the object to be processed is migrated, the data of the object to be processed is migrated from the original storage location to the target storage location included in the object information, and the index information in the index memory is updated. .

If the processing requirement indicates that the data of the object to be processed is migrated, the data of the object to be processed can be migrated from the original storage location in the data storage to the target storage location included in the object information, and the index information in the index storage can be migrated. to update.

In some embodiments, the present application also provides an object life cycle management system, which mainly includes: a priority policy manager, an index storage, a data storage, an index scanner, a processing queue, and a task scheduling manager.

Among them, the priority policy manager: receives the priority setting policy from the system administrator, sets priorities for different services (corresponding to buckets and data pools in the system), and manages the correspondence between services and processing queues.

Index storage: It is used to store the bucket index data of the object storage. When the number of objects in the bucket is large, hash sharding can be performed.

Data storage: It is used to store the data of object storage. It can be divided into different pools according to the business. Different pools have different hardware resources and do not affect each other.

Index scanner: The index scanner is a background thread that scans the index shards according to the policy set by the system (in what time period, how long to perform a round of scanning, etc.), and reads the object elements obtained from the index shards one by one Data, according to the bucket name, object name, modification time, bucket life cycle configuration rules and priority configuration rules in the metadata, save the object metadata and operation type (deletion or migration) to be processed in the corresponding processing queue , and the index scanner is the producer of the processing queue.

Processing queue: Processing queues with different queue priorities, and the processing queues are message queues, which are used to store the object metadata scanned by the index scanner to be processed.

Task scheduling manager: The task scheduling manager manages a set of worker threads, which are consumers of the processing queue, which are used to read object metadata information from the processing queue, perform corresponding operations according to the operation type, and manage the task scheduling. The processor can dynamically allocate worker threads based on priority settings.

Specifically, the processing flow of each component in the object life cycle management system provided in the embodiment of the present application may be as shown in FIG. 4 . As shown in Figure 4, the system administrator sets the priority policy of life cycle tasks according to the system status and business requirements. The priority policy manager can receive the priority setting policy sent by the system administrator, and carry out object assignment according to the priority setting policy. Priority setting and priority setting of the processing queue, as well as persistence of the priority setting policy and the priority setting result.

The index scanner can load priority setting policies and life cycle rules, scan periodically according to system settings, obtain index shard data from index storage, analyze each object in the shard according to the life cycle rules, and process if necessary. Then write the object information of the object to be processed into the corresponding processing queue, and continue to analyze the next object if no processing is required. The object information of the object may include object metadata, operation type, and the like.

The task scheduling manager can load the priority setting policy and assign worker threads to different processing queues according to the priority setting policy. The worker threads poll the assigned processing queues and process the data of the objects to be processed one by one: if it is a delete operation , delete the data of the object from the data storage and update the index; if it is a migration operation, migrate the data of the object from the original storage location in the data storage to the target storage location, and update the index.

Compared with the related art, the object life cycle management system provided by this application has the following advantages:

1. Improve the operability of the system. Task scheduling can be performed according to the specific conditions of the business and the system to make the overall resource utilization of the system more efficient.

2. Improve the stability of the system. Tasks between different businesses can be isolated from each other through task queues and worker threads, so that local turbulence of a business can cause overall turbulence.

This application provides an object life cycle management method, which can solve the problem of sequential processing of objects in the ceph object storage. However, if a certain business pressure is high, or a certain storage pool fails, the processing speed of the whole object will decrease. , which in turn affects the management efficiency of the overall life cycle. The object life cycle management method provided in this application enables the ceph object storage to perform precise scheduling of life cycle management tasks according to business characteristics, improving the operability of the system, and at the same time, the scanning and processing of the index is resolved through the priority queue. Coupling, save the scan results of different services (or data pools) to different queues, the task manager schedules tasks according to the priority of the business, the task exception of a queue will not affect the execution of other tasks, so that the business Isolation of tasks prevents local shocks of a single business from causing overall shocks to the system, and improves system stability.

Based on the same inventive concept as the object life cycle management method shown in FIG. 1 , the embodiment of the present application further provides an object life cycle management apparatus. Since the device is a device corresponding to the life cycle management method of the object of the present application, and the principle of solving the problem of the device is similar to that of the method, the implementation of the device can refer to the implementation of the above method, and the repetition will not be repeated.

FIG. 5 shows a schematic structural diagram of an object life cycle management apparatus provided by an embodiment of the present application. As shown in FIG. 5 , the object life cycle management apparatus includes an object information reading unit 501 and a data processing unit 502 .

The object information reading unit 501 is configured to, for any processing queue, read the object information of the object to be processed from any processing queue based on the worker thread allocated to any processing queue; wherein, the processing queue includes at least Object information of a pending object. The object priority of the pending object in the processing queue matches the queue priority of the processing queue to which it belongs. The processing queue with a higher queue priority has more worker threads than those with a lower queue priority. The number of worker threads of the queue, or, the worker thread start time of the processing queue of the higher queue priority is earlier than the start time of the worker thread of the processing queue of the lower queue priority;

The data processing unit 502 is configured to process the data of the object to be processed according to the read object information of the object to be processed.

In an optional embodiment, as shown in FIG. 6 , the foregoing apparatus may further include a priority determination unit 601, configured to:

Set the corresponding object priority for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object.

In an optional embodiment, the priority determination unit 601 is specifically configured to:

If the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, set the first object priority for the object to be processed;

If the corresponding system status of the to-be-processed object fails, or the business requirement corresponding to the to-be-processed object is to be processed later, a second object priority is set for the to-be-processed object; the first object priority is higher than the second object priority.

In an optional embodiment, as shown in FIG. 6 , the above-mentioned apparatus may further include a queue adding unit 602 for:

According to the object priority of the object to be processed, determine the queue priority that is the same as the object priority;

The object information of the object to be processed is placed in the processing queue corresponding to the queue priority.

In an optional embodiment, the object information includes the identifier and processing requirements corresponding to the object to be processed; the data processing unit 502 is specifically used for:

According to the identifier corresponding to the object to be processed, the index information matching the identifier is searched from the index memory;

According to the index information, the original storage location of the data of the object to be processed in the data storage is determined, and the data of the object to be processed is processed according to the processing requirements corresponding to the object to be processed.

In an optional embodiment, the data processing unit 502 is further configured to:

If the processing request indicates that the data of the object to be processed is deleted, the data of the object to be processed is deleted from the original storage location, and the index information is deleted from the index memory;

If the processing requirement indicates that the data of the object to be processed is migrated, the data of the object to be processed is migrated from the original storage location to the target storage location included in the object information, and the index information in the index memory is updated.

Based on the same inventive concept as the above method embodiments, the embodiments of the present application further provide an electronic device. The electronic device may be used to perform a lifecycle management process of the object. In this embodiment, the structure of the electronic device may be as shown in FIG. 7 , including a memory 701 and one or more processors 702 .

The memory 701 is used for storing computer programs executed by the processor 702 . The memory 701 may mainly include a stored program area and a stored data area, wherein the stored program area may store the operating system and the programs required for running the instant messaging function, and the like; the storage data area may store various instant messaging information and operation instruction sets.

The memory 701 may be a volatile memory (volatile memory), such as random-access memory (random-access memory, RAM); the memory 701 may also be a non-volatile memory (non-volatile memory), such as read-only memory, flash memory (flash memory), hard disk drive (HDD) or solid-state drive (SSD), or memory 701 is capable of carrying or storing desired program code in the form of instructions or data structures and capable of being used by a computer Access any other medium without limitation. The memory 701 may be a combination of the above-described memories.

The processor 702 may include one or more central processing units (central processing units, CPU), or be a digital processing unit or the like. The processor 702 is configured to implement the above object life cycle management method when invoking the computer program stored in the memory 701 .

The specific connection medium between the above-mentioned memory 701 and the processor 702 is not limited in this embodiment of the present application. In the embodiment of the present disclosure, the memory 701 and the processor 702 are connected through a bus 703 in FIG. 7 , and the bus 703 is represented by a thick line in FIG. 7 . The connection between other components is only for schematic illustration, not for be limited. The bus 703 can be divided into an address bus, a data bus, a control bus, and the like. For ease of presentation, only one thick line is used in FIG. 7, but it does not mean that there is only one bus or one type of bus.

According to one aspect of the present application, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the object lifecycle management method in the foregoing embodiment.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples (non-exhaustive list) of readable storage media include: electrical connections with one or more wires, portable disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited to this. should be covered within the scope of protection of this application.

Claims (10)

1. A life cycle management method for an object, comprising: For any processing queue, based on the worker thread allocated to the any processing queue, read the object information of the object to be processed from the any processing queue, and according to the read object information of the object to be processed, processing the data of the object to be processed; The processing queue includes object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which it belongs, and the work of the processing queue with a higher queue priority The number of threads is greater than the number of worker threads for the processing queue of the lower queue priority, or the worker thread start time of the processing queue of the higher queue priority is earlier than the start time of the worker threads of the processing queue of the lower queue priority. 2. The method of claim 1, wherein the object priority of the object to be processed is determined by: A corresponding object priority is set for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object. 3. The method according to claim 2, wherein, according to the system status or business requirement corresponding to the to-be-processed object, setting a corresponding object priority for the to-be-processed object, comprising: If the system status corresponding to the object to be processed is running normally, or the business requirement corresponding to the object to be processed is immediate processing, set a first object priority for the object to be processed; If the corresponding system status of the to-be-processed object fails, or the business requirement corresponding to the to-be-processed object is to be processed later, a second object priority is set for the to-be-processed object; the first object priority higher than the second object priority. 4. The method according to claim 1, wherein before reading the object information of the object to be processed from the any one of the processing queues, the method further comprises: According to the object priority of the object to be processed, determine the queue priority that is the same as the object priority; The object information of the object to be processed is placed in a processing queue corresponding to the queue priority. 5. The method according to claim 1, wherein the object information includes a corresponding identifier and processing requirements of the object to be processed; The data of the object to be processed is processed, including: According to the identifier corresponding to the object to be processed, look up the index information matching the identifier from the index memory; According to the index information, the original storage location of the data of the object to be processed in the data memory is determined, and the data of the object to be processed is processed according to the processing requirements corresponding to the object to be processed. 6. The method according to claim 5, wherein the processing of the data of the object to be processed according to the processing requirements corresponding to the object to be processed comprises: If the processing request instructs to delete the data of the object to be processed, delete the data of the object to be processed from the original storage location, and delete the index information from the index memory; If the processing request indicates to perform a migration operation on the data of the object to be processed, the data of the object to be processed is migrated from the original storage location to the target storage location included in the object information, and the data of the object to be processed is migrated to the target storage location included in the object information. The index information in the index memory is updated. 7. A device for managing the life cycle of an object, comprising: The object information reading unit is configured to, for any processing queue, read the object information of the object to be processed from the any processing queue based on the worker thread allocated to the processing queue; wherein, the processing queue It includes object information of at least one object to be processed, the object priority of the object to be processed in the processing queue matches the queue priority of the processing queue to which it belongs, and the number of worker threads in the processing queue with a higher queue priority is more than that of a lower queue priority. The number of worker threads of the processing queue of the queue priority, or the start time of the worker thread of the processing queue of the higher queue priority is earlier than the start time of the worker thread of the processing queue of the lower queue priority; The data processing unit is configured to process the data of the to-be-processed object according to the read object information of the to-be-processed object. 8. The apparatus according to claim 7, wherein the apparatus further comprises a priority determination unit for: A corresponding object priority is set for the to-be-processed object according to the system status or business requirement corresponding to the to-be-processed object. 9. An electronic device, characterized in that it comprises a processor and a memory, wherein the memory stores a program code that, when executed by the processor, causes the processor to execute claim 1 The steps of any of the methods in ~6. 10. A computer-readable storage medium, characterized in that it comprises program code, when the program code is run on an electronic device, the program code is used to cause the electronic device to execute any one of claims 1 to 6 a step of the method.

Images