Resource scheduling method, device, medium and electronic device based on storage system

Abstract

The present disclosure relates to a resource scheduling method, device, medium and electronic device based on a storage system, so that data processing tasks of different object storage buckets can be scheduled more fairly, and the timeliness and efficiency of task completion can be improved. The method includes: obtaining the manifest file corresponding to each object storage bucket in the storage system; performing cyclic traversal allocation for each object storage bucket according to the preset object allocation rule to obtain the target object allocation quota of each object storage bucket; generating corresponding data processing tasks for each object storage bucket based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, and the data processing task is to execute the task according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing task of an object storage bucket is not greater than the target object allocation quota of the object storage bucket; and controlling the parallel execution of the data processing tasks of each object storage bucket.

Description

Technical Field

[0001] The present disclosure relates to the field of data processing technology, and in particular to a resource scheduling method, device, medium and electronic device based on a storage system. Background Art

[0002] A bucket is a container for storing object data. Lifecycle management refers to setting management policies for objects in the bucket so that they are deleted or transferred to other storage types after being stored for a period of time, thereby reducing storage resource consumption.

[0003] In the related technology, objects in the storage bucket are scanned based on the management policy, expired objects that meet the management policy are placed in the processing task queue, the processing task queue is executed, and expired objects are deleted or transferred to other storage types. Due to the different number and processing time of expired objects in different storage buckets, as well as the different processing orders in the queue, how to globally and efficiently schedule the processing tasks of different storage buckets, improve task processing efficiency and reduce storage costs is a technical problem that the industry urgently needs to solve. Summary of the invention

[0004] This summary is provided to introduce concepts in a brief form that will be described in detail in the detailed description below. This summary is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0005] In a first aspect, the present disclosure provides a resource scheduling method based on a storage system, the method comprising:

[0006] Obtain a manifest file corresponding to each object storage bucket in the storage system, wherein the manifest file includes a scanned object list of the object storage bucket and a number of expired objects in the scanned object list;

[0007] According to the preset object allocation rule, a cyclic traversal allocation is performed for each object storage bucket to obtain a target object allocation quota for each object storage bucket; wherein the preset allocation rule is used to control the object allocation for the object storage bucket based on a single bucket allocation quota limit value and / or a total allocation quota limit value;

[0008] Based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, wherein the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket;

[0009] Controls the parallel execution of data processing tasks for each object storage bucket.

[0010] In a second aspect, the present disclosure provides a resource scheduling device based on a storage system, the device comprising:

[0011] An acquisition module, configured to acquire a list file corresponding to each object storage bucket in the storage system, wherein the list file includes a list of scanned objects in the object storage bucket and a number of expired objects in the list of scanned objects;

[0012] An allocation module, configured to perform cyclic traversal allocation for each object storage bucket according to a preset object allocation rule, and obtain a target object allocation quota for each object storage bucket; wherein the preset allocation rule is used to control the object allocation for the object storage bucket based on a single bucket allocation quota limit value and / or a total allocation quota limit value;

[0013] A generation module, for generating a corresponding data processing task for each object storage bucket based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, wherein the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket;

[0014] The execution module is used to control the parallel execution of data processing tasks of each object storage bucket.

[0015] In a third aspect, the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processing device, implements the steps of any one of the methods described in the first aspect.

[0016] In a fourth aspect, the present disclosure provides an electronic device, including:

[0017] a storage device having a computer program stored thereon;

[0018] A processing device is used to execute the computer program in the storage device to implement the steps of any method described in the first aspect above.

[0019] In a fifth aspect, the present disclosure provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of any one of the methods in the first aspect.

[0020] Through the above technical solution, by cyclically traversing and allocating each object storage bucket in the storage system, the target object allocation quota of each object storage bucket is obtained, and then based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, and then the data processing tasks of each object storage bucket are controlled to be executed in parallel. Since the number of expired objects in the manifest file executed by the total data processing task of an object storage bucket is not greater than the target object allocation quota of the object storage bucket, that is, the expired objects to be processed by each object storage bucket can be limited to the object allocation quota allocated to the object storage bucket, it can ensure that the number of expired objects to be processed by each object storage bucket is relatively fair, so that the data processing tasks of different object storage buckets can be more fairly scheduled, the timeliness and efficiency of task completion can be improved, and the purpose of reducing storage costs can be achieved.

[0021] Other features and advantages of the present disclosure will be described in detail in the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale. In the drawings:

[0023] Figure 1 is a flow chart of a resource scheduling method based on a storage system according to an exemplary embodiment of the present disclosure;

[0024] Figure 2 is a flowchart of a scanning task according to an exemplary embodiment of the present disclosure;

[0025] Figure 3 is a schematic diagram of a task allocation process according to an exemplary embodiment of the present disclosure;

[0026] Figure 4 is a schematic diagram showing task information according to an exemplary embodiment of the present disclosure;

[0027] Figure 5 is a structural block diagram of a resource scheduling device based on a storage system according to an exemplary embodiment of the present disclosure;

[0028] Figure 6 It is a schematic structural diagram of an electronic device according to an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0029] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0030] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0031] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0032] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0033] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0034] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0035] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0036] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.

[0037] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0038] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet the relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0039] At the same time, it is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.

[0040] In the related art, lifecycle management mainly includes the following steps: first, the user sets an expiration policy for the object file for the storage bucket, such as transferring it to other storage types that consume less storage resources after 3 days, deleting it after 7 days, etc.; then the object storage service records the storage time when storing the object file; then the lifecycle system executes a scanning task to scan the object files in the storage bucket, and puts the object files that meet the expiration policy into the processing task queue; finally, the data processing operation is performed to delete or transfer the expired object files in the processing task queue to achieve the purpose of reducing storage resource consumption.

[0041] For example, buckets A, B, and C each have different expiration policies and the number of expired objects corresponding to them. Taking the processing task queues {A1, A2, A3, A4, B1, B2, B3, C1, C2} generated by buckets A, B, and C as an example, since different processing tasks require different execution times, if the processing task of bucket A takes a lot of execution time, buckets B and C will not be able to complete the processing tasks in time. That is, lifecycle management is performed in the order of the processing task queues, which will make it impossible to fairly schedule the processing tasks of different buckets. Therefore, how to globally and efficiently schedule the processing tasks of different buckets, improve task processing efficiency and reduce storage costs is a technical problem that the industry urgently needs to solve.

[0042] In view of this, the present disclosure provides a resource scheduling method, device, medium and electronic device based on a storage system to solve the above technical problems.

[0043] The embodiments of the present disclosure are further explained below with reference to the accompanying drawings.

[0044] Figure 1 is a flowchart of a resource scheduling method based on a storage system according to an exemplary embodiment of the present disclosure, referring to Figure 1 , the method comprising:

[0045] S101: Obtain a manifest file corresponding to each object storage bucket in the storage system, wherein the manifest file includes a scanned object list of the object storage bucket and the number of expired objects in the scanned object list.

[0046] It should be understood that file data is stored in a key-value pair format, with the file name as the key and the file data as the value. This key-value pair is called an object. A bucket is a container for storing object data. All objects must belong to a bucket, which is equivalent to a namespace.

[0047] S102: According to the preset object allocation rule, a circular traversal allocation is performed for each object storage bucket to obtain a target object allocation quota for each object storage bucket.

[0048] The preset allocation rule is used to control the allocation of objects to the object storage bucket based on the single bucket allocation quota limit value and / or the total allocation quota limit value.

[0049] S103: Based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, and the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket.

[0050] S104: Control the parallel execution of data processing tasks for each object storage bucket.

[0051] By adopting the above method, since the number of expired objects in the list file of the total data processing task execution of an object storage bucket is not greater than the target object allocation quota of the object storage bucket, that is, the expired objects to be processed by each object storage bucket can be limited to the object allocation quota allocated to the object storage bucket, it can be ensured that the number of expired objects to be processed by each object storage bucket is relatively fair, so that data processing tasks of different object storage buckets can be scheduled more fairly, thereby improving the timeliness and efficiency of task completion and achieving the purpose of reducing storage costs.

[0052] It should be noted that the lifecycle system can scan all buckets or specified buckets in the storage system on a daily basis and generate corresponding data processing tasks, and delete or transfer expired objects by executing data processing tasks.

[0053] It should be understood that for buckets storing massive amounts of data, it takes a certain amount of time for the scanning service to complete the scanning tasks of all buckets, so the daily data processing tasks of the lifecycle system can be divided into multiple rounds of execution. The scanning service can be started at a fixed time every day, and a round of data processing tasks can be determined and executed at each preset interval. For example, the scanning service is started at 0 o'clock every day, and the first round of data processing tasks are determined for the list file from 0 to 1 o'clock at 1 o'clock and the first round of data processing tasks are executed between 1 and 2 o'clock, and the second round of data processing tasks are determined for the list file from 1 to 2 o'clock at 2 o'clock and the second round of data processing tasks are executed between 2 and 3 o'clock, or if there are expired objects that have not been processed in the list file from 0 to 1 o'clock, the second round of data processing tasks are determined and executed for the remaining expired objects in the list file from 0 to 1 o'clock and the list file from 1 to 2 o'clock at 2 o'clock, and so on, until all data processing tasks are completed. Among them, the start time of the scanning service and the preset duration of the interval can be set according to demand, and the present disclosure does not limit this. In order to make full use of time to improve data processing efficiency.

[0054] In a possible manner, obtaining a manifest file corresponding to each object storage bucket in the storage system includes: obtaining a lifecycle policy for each object storage bucket in the storage system; scanning objects in each object storage bucket in turn, and matching the scanned objects based on the corresponding lifecycle policy to obtain matched expired objects, counting the number of expired objects, and generating at least one manifest file for each object storage bucket at the end of the scan.

[0055] By way of example, for each object storage bucket, a scanning task is executed, the scanned objects are stored in an initial object list, and the scanned objects are matched with the lifecycle rules corresponding to the object storage bucket, and the number of expired objects that meet the lifecycle rules is counted. When the preset inventory generation conditions are met, the initial object list is used as the scanned object list, and an inventory file including the scanned object list and the number of expired objects is generated until the scanning task is completed; wherein the preset inventory generation conditions include at least one of the following: the number of objects in the initial object list is equal to the preset number; all objects in the object storage bucket have been scanned; and the scanning time for the object storage bucket is equal to the preset scanning time.

[0056] For example, a scanning task is performed on object storage bucket X, the scanned object Y1 is stored in a list, and object Y1 is matched with the lifecycle rule corresponding to object storage bucket X. If the lifecycle rule is met, the number of expired objects in object storage bucket X is increased by 1, and object Y2 is scanned. And so on. When the preset inventory generation conditions are met, a list file including the scanned object list {Y1, Y2, ...} and the number of expired objects is obtained until the scanning task is completed.

[0057] Among them, the life cycle rules can be set according to the needs, such as specifying the object name prefix, label and expiration date of expired objects, and the present disclosure does not limit this. The preset inventory generation conditions can also be set according to the needs, such as outputting a list file every time a preset number of objects are scanned, or all objects in the object storage bucket have been scanned. For example, 100,000 objects correspond to one list file. When the object storage bucket has a total of 210,000 objects, after scanning 200,000 objects and outputting two list files, continue to scan the remaining 10,000 objects, all objects in the object storage bucket have been scanned and a list file is also output. It is also possible to generate a list file every preset scanning time interval, etc. The present disclosure does not limit this.

[0058] For example, refer to Figure 2 After the scanning task starts, first obtain the lifecycle rules of the object storage bucket to be scanned. After scanning an object, it is necessary to first determine whether the object storage bucket corresponding to the object is configured with a lifecycle rule. If so, further determine whether the object hits the lifecycle rule based on the object name prefix, label, storage time and other features of the object. If not, continue to scan the next object after completing the scanning rules of other functions. When the object storage bucket of the object is configured with a lifecycle rule and the object hits the lifecycle rule, it means that the object is an expired object, then the number of expired objects +1, and then determine whether the preset inventory generation conditions are met. If so, the inventory file is output, and the number of expired objects counted is output to the HTTP (HyperTextTransferProtocol, Hypertext Transfer Protocol) header of the inventory file. If the lifecycle rule is not hit or the preset inventory generation conditions are not met, continue to scan the next object until the scanning task ends.

[0059] The manifest file is a file format obtained by scanning the object list of the bucket after the scanning service scans it, that is, a file including the scanned object list. An object storage bucket can scan multiple manifest files. By judging whether the object meets the life cycle rules in advance when executing the scanning task, it can provide a reference for the fair allocation and scheduling of data processing tasks.

[0060] It is worth noting that an object storage bucket has at least one inventory file every day. If there are many objects in the object storage bucket, there will be multiple inventory files. In addition, the scanning task of the object storage bucket can be a dedicated scanning task for lifecycle management, or a general scanning task including security scanning, expired object scanning and other functions, which can avoid launching too many scanning tasks and causing waste of resources.

[0061] It should be noted that the lifecycle system is divided into manager process (management process) and worker process (work process). The manager process is responsible for allocating inventory files to generate data processing tasks, and the worker process is responsible for executing data processing tasks.

[0062] The following first describes an example of the manager process.

[0063] First, the manager process obtains the list files of all object storage buckets. It should be understood that the embodiment of the present disclosure is illustrated by the generation process of a round of data processing tasks. For example, the list files obtained at 1-2 and the remaining expired in the unprocessed list files of the previous round are obtained at 2 o'clock, which will not be repeated later. Then the total number of expired objects (indicating the number of unprocessed expired objects) and the number of processed objects (the number of processed expired objects) of each object storage bucket are calculated respectively.

[0064] In a possible manner, according to a preset object allocation rule, a loop is traversed and allocated for each object storage bucket to obtain a target object allocation quota for each object storage bucket, including: sorting each object storage bucket according to a preset bucket sorting rule to obtain an object storage bucket sequence; wherein the preset bucket sorting rule is used to indicate that object storage buckets with equal allocated object allocation quotas are sorted in ascending order according to the number of expired objects in the object storage bucket; allocating equal object allocation quotas to each object storage bucket in turn according to the object storage bucket sequence; repeatedly executing the steps of sorting each object storage bucket according to the preset bucket sorting rule to obtain an object storage bucket sequence and allocating the same object allocation quota to each object storage bucket in turn according to the object storage bucket sequence until the preset object allocation rule is satisfied and the target object allocation quota for each object storage bucket is obtained.

[0065] For example, the following process is iteratively performed until the preset object allocation rule is met to obtain the target object allocation quota for each object storage bucket: sort the object storage buckets according to the preset sorting rule to obtain an object storage bucket sequence; and allocate equal object allocation quotas to each object storage bucket in turn according to the object storage bucket sequence.

[0066] Among them, the preset object allocation rules include at least one of the following: when the object allocation quota allocated to any object storage bucket reaches the number of expired objects and / or the single bucket allocation quota limit value of the object storage bucket, the object allocation for the object storage bucket is terminated, and the single bucket allocation quota limit value includes at least one of the object processing quota limit value and the preset allocation quota limit value; when the total object allocation quota of all object storage buckets reaches the total allocation quota limit value, the object allocation for all object storage buckets is terminated; when the object allocation quota allocated to each object storage bucket reaches the number of expired objects corresponding to each object storage bucket, the object allocation for all object storage buckets is terminated.

[0067] For example, when processing expired objects, the lifecycle system needs to send a request to the object storage service. The object storage service is used to provide operation interfaces such as object uploading, deleting, and converting storage types. Since the processing capacity of the object storage service is upper bounded, the total upper bound threshold of object processing for all object storage buckets can be set as the total allocation quota limit value and the upper bound threshold of object processing for each object storage bucket can be set as the corresponding object processing quota limit value to prevent the total target object allocation quota of all object storage buckets from exceeding the processing capacity of all object storage buckets or the target object allocation quota of a single object storage bucket from exceeding the processing capacity of a single object storage bucket.

[0068] For example, a round of data processing tasks is set with a corresponding single-round execution time, such as one hour, and the present disclosure does not impose any restrictions on this. Then the total upper limit threshold of object processing for all object storage buckets can be set = total request QPS upper limit threshold × single-round execution time × discount factor, where the total request QPS upper limit threshold (Query Per Second) represents the number of expired objects that the object storage service of all object storage buckets can process per second, and the discount factor takes into account the time consumption of task allocation and scheduling, as well as the time consumption of filtering out non-expired objects that do not need to be processed in the scanned objects. The discount factor is configurable, such as 0.8, 0.9, etc., and the present disclosure does not impose any restrictions on this.

[0069] Accordingly, the object processing quota limit value of a single object storage bucket can be set = object storage bucket request QPS upper limit threshold × single round execution time × discount factor. In addition, for object storage buckets with newly configured lifecycle rules, the threshold can be converted from the time when the rules are configured on the day to 24:00. For example, if the rules are configured at 15:00, the upper limit threshold that the object storage bucket can process on the day = object processing quota limit value × ((24-15) / 24).

[0070] For example, in order to prevent a single object storage bucket from having too many expired objects in its data processing tasks, which would affect other object storage buckets from executing data processing tasks, a preset allocation quota limit value for a single object storage bucket can also be set, such as 1 billion, which means that after a single object storage bucket processes 1 billion objects, quota allocation will not be performed temporarily, and other object storage buckets will be allocated quotas first. This can be set specifically according to needs, and this disclosure does not limit this.

[0071] The following process is iteratively executed below: First, all object storage buckets are classified and sorted, and object storage bucket list 1 whose allocated object allocation quota does not exceed the preset allocation quota limit value and object storage bucket list 2 whose allocated object allocation quota exceeds the preset allocation quota limit value are first classified. Then, for object storage bucket list 1, the allocated object allocation quota of each object storage bucket is sorted in ascending order, and object storage buckets with equal allocated object allocation quotas are sorted in ascending order according to the number of expired objects. Then, according to the sorted order, the same object allocation quota is allocated to each object storage bucket in turn, for example, 1 million quotas are allocated each time, and the specific setting is based on the needs, and the present disclosure does not impose any restrictions on this. Until the preset object allocation rule is met, the allocation process of a single object storage bucket or all object storage buckets is ended, and the target object allocation quota of each object storage bucket is obtained.

[0072] In a possible manner, the method also includes: after obtaining the target object allocation quota of each object storage bucket, if the total object allocation quota of all object storage buckets is less than the total allocation quota limit value, screening out the target object storage bucket whose target object allocation quota reaches the preset allocation quota limit value from all object storage buckets; according to the preset object allocation rule, performing a loop traversal allocation for each target object storage bucket to obtain the object allocation supplementary quota of each target object storage bucket; based on the object allocation supplementary quota of each target object storage bucket and the manifest file corresponding to each target object storage bucket, generating a corresponding data processing supplementary task for each target object storage bucket; wherein the execution priority of the data processing task is higher than the execution priority of the data processing supplementary task.

[0073] For example, after obtaining the object allocation quota of each object storage bucket, if the total object allocation quota of all object storage buckets is less than the total allocation quota limit value, it means that the object storage service of all object storage buckets has not reached the processing capacity limit, then the target object storage buckets whose target object allocation quota reaches the preset allocation quota limit value can be screened out from all object storage buckets, and then according to the preset object allocation rule, the target object storage buckets are traversed and allocated in a loop to obtain the supplementary object allocation quota of each target object storage bucket, that is, the object storage bucket list 2 is sorted, and then the object storage buckets are traversed and allocated in a loop in the sorted order until the preset object allocation rule is met to obtain the object allocation supplementary quota of each target object storage bucket.

[0074] It is worth noting that the execution priority of the data processing tasks generated based on the target object allocation quota is higher than the execution priority of the data processing supplementary tasks generated based on the object allocation supplementary quota, that is, the data processing tasks within the target object allocation quota are given priority.

[0075] By prioritizing the data processing tasks of the object storage buckets according to whether they have reached the preset allocation limit value, and evenly traversing and allocating them to each object storage bucket, the fairness of the expired object processing volume between different object storage buckets can be guaranteed. In addition, when the lifecycle system increases the processing capacity limit, the expanded capacity can be evenly allocated to each object storage bucket, and there will be no resource imbalance.

[0076] In a possible manner, based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, including: for each object storage bucket, selecting a manifest file in which the number of expired objects is not greater than the target object allocation quota of the object storage bucket from at least one manifest file of the object storage bucket as the target manifest file; based on the target manifest file of each object storage bucket, generating a data processing task corresponding to each object storage bucket.

[0077] For example, the number of expired objects in the manifest file of an object storage bucket may be greater than the target object allocation quota of the object storage bucket. Figure 3 , the target list file whose number of expired objects is not greater than the target object allocation quota of the object storage bucket can be first filtered out from the list file, and the target list file of each object storage bucket can be used to generate data processing tasks corresponding to each object storage bucket to ensure that the number of expired objects corresponding to the data processing tasks of each object storage bucket is within the target object allocation quota of the object storage bucket.

[0078] It should be understood that if the target inventory file whose number of expired objects is equal to the object allocation quota of the object storage bucket cannot be filtered out, the target inventory file whose number of expired objects is less than and closest to the target object allocation quota of the object storage bucket is filtered out, such as Figure 3 Alternatively, tasks can be assigned based on some expired objects in the manifest file, for example Figure 3 Replace B5 of the target inventory file filtered out by object storage bucket B with B7, but specify that the number of expired objects that can be allocated by B7 is 1 million, so that the number of expired objects in the target inventory file is equal to the target object allocation quota.

[0079] In a possible manner, based on the target manifest file of each object storage bucket, a data processing task corresponding to each object storage bucket is generated, including: according to the number of expired objects in the target manifest file of each object storage bucket, the target manifest files whose number of expired objects belongs to the same data range are marked with the same manifest file priority; wherein different manifest file priorities correspond to different data ranges; based on the marked target manifest file of each object storage bucket, a data processing task corresponding to each object storage bucket is generated, and the priority of the target manifest file is configured as the execution priority of the corresponding data processing task.

[0080] By way of example, the following process is iteratively performed until the manifest file priority marking of all target manifest files of each object storage bucket is completed: a first manifest file having the largest number of expired objects among all target manifest files of each object storage bucket is determined; for each object storage bucket in each object storage bucket except the object storage bucket corresponding to the first manifest file, a second manifest file is screened out from the target manifest files of the object storage bucket according to the first manifest file, the second manifest file representing a combination of manifest files whose number of expired objects in the target manifest files of the object storage bucket is closest to the number of expired objects in the first manifest file, and the first manifest file and the second manifest file are marked as having the same manifest file priority.

[0081] For example, continue to refer to Figure 3 In the first iteration, the first list file with the largest number of expired objects is first found, such as the number of expired objects in A2 of object storage bucket A is 2 million, and then the closest second list file is combined for each object storage bucket except the object storage bucket, such as the sum of the number of expired objects in B1 and B2 of object storage bucket B is 2 million. And so on, and then continue to iterate the second and third iterations in the remaining target list files until the list file priority marking of all target list files is completed.

[0082] It is worth noting that the execution priorities of data processing tasks generated by manifest files with the same manifest file priority are the same, and the execution priorities of data processing tasks generated by manifest files with different manifest file priorities are different. The priority of the manifest file marked in the previous iteration process can be higher than the priority of the manifest file marked in the next iteration process, or the priority of the manifest file marked in the next iteration process can be higher than the priority of the manifest file marked in the previous iteration process, as long as the manifest files with a relatively close number of expired objects have the same processing priority, thus ensuring that the data processing tasks with a relatively close number of expired objects have the same processing priority.

[0083] This ensures that object storage buckets with different numbers of expired objects can execute data processing tasks in parallel, and the order of task execution will not be affected by different lifecycle rules and the number of expired objects, thereby affecting the timeliness and efficiency of task completion.

[0084] After generating the data processing tasks corresponding to each object storage bucket based on the target inventory files of each object storage bucket, the data processing supplementary tasks corresponding to each target object storage bucket can be determined based on the object allocation supplementary quota of each target object storage bucket and the remaining inventory files. The two processes are similar and will not be repeated in this disclosure.

[0085] It should be noted that the priority of the list files screened out based on the object allocation supplementary quota of each target object storage bucket and the remaining list files is lower than the above-mentioned target list files. Accordingly, the execution priority of the data processing tasks generated based on the target object allocation supplementary quota is higher than the execution priority of the data processing supplementary tasks generated based on the object allocation supplementary quota, that is, the data processing tasks within the target object allocation quota are given priority.

[0086] Furthermore, the data processing tasks generated by the manager process are assigned to the worker process for execution, and the worker process can process tasks with the same execution priority in parallel.

[0087] In a possible manner, the data processing tasks of each object storage bucket are controlled to be executed in parallel, including: during the execution of the data processing tasks of each object storage bucket in parallel, the lifecycle policy of each object storage bucket is used to match the expired objects corresponding to the data processing tasks, and the expired objects that are matched are deleted or transferred.

[0088] For example, during the execution of the data processing task corresponding to each object storage bucket, each object in the scanned object list corresponding to the data processing task is matched with the lifecycle rule corresponding to the object storage bucket in turn, and for each expired object that hits the lifecycle rule, the expired object is deleted or transferred.

[0089] For example, during the execution of a data processing task, a request is sent to the object storage service, and each object in the scanned object list is matched with the lifecycle rule corresponding to the object storage bucket in turn, and expired objects that match the lifecycle rule are deleted or transferred, depending on the lifecycle rule that is matched.

[0090] It is easy to understand that the above process executes data processing tasks according to the granularity of the manifest file. However, in actual application, the manifest file may be partially allocated or the data processing task execution may be interrupted. Therefore, it is also necessary to divide the tasks based on the granularity of the number of expired objects.

[0091] For example, the processing progress of the scanned list can be recorded during the worker process executing the data processing task. When the list file is partially allocated or the data processing task is interrupted, the next round of data processing tasks can be continued from the breakpoint to avoid repeated processing.

[0092] Among possible ways, controlling the parallel execution of data processing tasks for each object storage bucket includes:

[0093] In the process of controlling the parallel execution of data processing tasks of each object storage bucket, when the data processing task carries the starting object information and the starting position information, the specified object is located according to the starting object information and the starting position information, and processing starts from the specified object.

[0094] For example, refer to Figure 4 , when generating a data processing task, the corresponding task information can be generated based on the manifest file. Among them, TotalNeedProcessNum represents the total number of expired objects in the manifest file, TotalProcessDoneNum represents the number of expired objects that have been processed in the manifest file, TaskNeedProcessNum represents the number of expired objects that need to be processed in this task, StartKeyHash represents the hash value of the first object in the manifest file that does not match the rule, that is, the starting object information, FileStartOffset represents the range (range) reading point of the first object in the manifest file that does not match the rule, that is, the starting position information, and StartKeyHash and FileStartOffset are used to locate the first object that does not match the rule. Among them, the values ​​of TotalProcessDoneNum, StartKeyHash, and FileStartOffset are updated by the lifecycle system during the execution of the task.

[0095] For example, in the process of generating data processing tasks, partial or full allocation of the manifest file can be achieved. For example, when the number of expired objects that can be processed is greater than the total number of expired objects in the manifest file, the manifest file is fully allocated and TaskNeedProcessNum is set to -1. Otherwise, the manifest is partially allocated and TaskNeedProcessNum is set to the number of expired objects that can be processed. Or, assuming that the data processing task M is interrupted, the number of unprocessed remaining expired objects in the manifest file corresponding to the data processing task M is TotalNeedProcessNum-TotalProcessDoneNum, which is recorded as N here. When generating the next round of data processing tasks, N is used as the number of expired objects in the manifest file to re-allocate the object quota and generate the data processing tasks.

[0096] By specifying TaskNeedProcessNum, StartKeyHash, and FileStartOffset in the task information to process all or part of the expired objects in the manifest file, the task can be divided into granularities based on the number of expired objects.

[0097] For example, when the worker process executes a data processing task, it searches for the specified object in the manifest file according to the FileStartOffset and StartKeyHash of the task information. That is, the worker process reads from the starting position of the manifest file until it reads the range interval of FileStartOffset, and then calculates line by line whether the hash value of the line matches StartKeyHash. If so, it means that the position of the specified object has been read, and then rule matching begins. During the processing of the worker process, the memory records the hash value and range interval of each matched object.

[0098] For example, when the number of objects matched by the rule reaches TaskNeedProcessNum or the task is interrupted, the worker process can be based on the following Figure 4 The fields shown mark the list file information and exit the task. The next time a task is assigned, the task information of the new data processing task can be obtained based on the list file information. That is, the first object in the scanned object list corresponding to the data processing task that has not been matched by the rule is marked as the target object, and a new list file is obtained. When a new data processing task is generated based on the new list file, the object information of the target object is used as the designated object to be processed by the new data processing task.

[0099] Through the above method, the breakpoint resumption capability of the manifest file of the object storage bucket can be realized to achieve fine-grained, reentrant task scheduling, which can effectively avoid repeated and invalid processing of the manifest file, reduce the request pressure on the object storage service, and further improve the timeliness and efficiency of task completion.

[0100] Based on the same concept, the embodiment of the present disclosure also provides a resource scheduling device based on a storage system, referring to Figure 5 , the storage system-based resource scheduling device 500 includes:

[0101] An acquisition module 501 is used to acquire a list file corresponding to each object storage bucket in the storage system, wherein the list file includes a list of scanned objects in the object storage bucket and the number of expired objects in the list of scanned objects;

[0102] The allocation module 502 is used to perform cyclic traversal allocation for each object storage bucket according to a preset object allocation rule to obtain a target object allocation quota for each object storage bucket in the storage system; wherein the preset allocation rule is used to control the object allocation for the object storage bucket based on a single bucket allocation quota limit value and / or a total allocation quota limit value;

[0103] A generation module 503 is used to generate a corresponding data processing task for each object storage bucket based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, wherein the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket;

[0104] The execution module 504 is used to control the parallel execution of the data processing tasks of each object storage bucket.

[0105] Optionally, the generating module 503 is used to:

[0106] For each object storage bucket, selecting, from at least one inventory file of the object storage bucket, an inventory file having a number of expired objects not greater than a target object allocation quota of the object storage bucket as a target inventory file;

[0107] Based on the target list file of each object storage bucket, generate the data processing task corresponding to each object storage bucket.

[0108] Optionally, the generating module 503 is used to:

[0109] According to the number of expired objects in the target inventory file of each object storage bucket, target inventory files whose number of expired objects belongs to the same data range are marked as having the same inventory file priority; wherein different inventory file priorities correspond to different data ranges;

[0110] Based on the marked target list files of the object storage buckets, data processing tasks corresponding to the object storage buckets are generated, and the priorities of the target list files are configured as execution priorities of the corresponding data processing tasks.

[0111] Optionally, the allocation module 502 is used to:

[0112] The object storage buckets are sorted according to a preset bucket sorting rule to obtain an object storage bucket sequence; wherein the preset bucket sorting rule is used to indicate that the object storage buckets are sorted in ascending order according to the allocated object allocation quotas, and the object storage buckets with equal allocated object allocation quotas are sorted in ascending order according to the number of expired objects;

[0113] Allocating equal object allocation quotas to each object storage bucket in turn according to the object storage bucket sequence;

[0114] Repeat the steps of sorting the object storage buckets according to the preset bucket sorting rule to obtain the object storage bucket sequence and allocating an equal object allocation quota to each object storage bucket in turn according to the object storage bucket sequence until the preset object allocation rule is met and the target object allocation quota of each object storage bucket is obtained.

[0115] Optionally, the preset object allocation rule includes at least one of the following:

[0116] When the object allocation quota allocated to any object storage bucket reaches the number of expired objects in the object storage bucket and / or the single bucket allocation quota limit value, the object allocation for the object storage bucket is terminated, and the single bucket allocation quota limit value includes at least one of the object processing quota limit value and the preset allocation quota limit value;

[0117] When the total amount of object allocations of all object storage buckets reaches the total allocation amount limit value, ending the object allocation for all object storage buckets;

[0118] When the object allocation quotas allocated to each object storage bucket reach the number of expired objects corresponding to each object storage bucket, object allocation for all object storage buckets is terminated.

[0119] Optionally, the storage system-based resource scheduling device 500 further includes a supplementing module, and the supplementing module is used to:

[0120] After obtaining the target object allocation quota of each object storage bucket, if the total object allocation quota of all the object storage buckets is less than the total allocation quota limit value, select the target object storage bucket whose target object allocation quota reaches the preset allocation quota limit value from all the object storage buckets;

[0121] According to the preset object allocation rule, a cyclic traversal allocation is performed for each target object storage bucket to obtain an object allocation supplementary quota for each target object storage bucket;

[0122] Based on the object allocation supplementary quota of each target object storage bucket and the inventory file corresponding to each target object storage bucket, a corresponding data processing supplementary task is generated for each target object storage bucket; wherein the execution priority of the data processing task is higher than the execution priority of the data processing supplementary task.

[0123] Optionally, the execution module 504 is used to:

[0124] During the execution of the data processing tasks of each object storage bucket in parallel, the lifecycle policy of each object storage bucket is used to match the expired objects corresponding to the data processing tasks, and the matched expired objects are deleted or transferred.

[0125] Optionally, the execution module 504 is used to:

[0126] In the process of controlling the parallel execution of data processing tasks of each object storage bucket, when the data processing task carries starting object information and starting position information, the specified object is located according to the starting object information and the starting position information, and processing starts from the specified object.

[0127] Optionally, the acquisition module 501 is used to:

[0128] Get the lifecycle policy of each object storage bucket in the storage system;

[0129] Scan the objects in each object storage bucket in turn, match the scanned objects based on the corresponding lifecycle policy to obtain matching expired objects, count the number of expired objects, and generate at least one manifest file for each object storage bucket at the end of the scan.

[0130] Based on the same concept, an embodiment of the present disclosure further provides a computer-readable medium on which a computer program is stored. When the program is executed by a processing device, the steps of the above-mentioned resource scheduling method based on the storage system are implemented.

[0131] Based on the same concept, the present disclosure also provides an electronic device, which may include:

[0132] a storage device having a computer program stored thereon;

[0133] A processing device is used to execute the computer program in the storage device to implement the steps of the above-mentioned resource scheduling method based on the storage system.

[0134] Based on the same concept, an embodiment of the present disclosure further provides a computer program product, including a computer program, which implements the steps of the above-mentioned resource scheduling method based on the storage system when executed by a processor.

[0135] Reference below Figure 6 , which shows a schematic diagram of the structure of an electronic device 600 suitable for implementing the embodiment of the present disclosure. The terminal device in the embodiment of the present disclosure may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle terminals (such as vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 6 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0136] like Figure 6 As shown, the electronic device 600 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0137] Typically, the following devices may be connected to the I / O interface 605: an input device 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 607 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 608 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 609. The communication device 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 6 The electronic device 600 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0138] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 609, or installed from a storage device 608, or installed from a ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0139] It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. Computer readable signal media may also be any computer readable medium other than computer readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0140] In some embodiments, any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol) can be used for communication, and can be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0141] The computer-readable medium may be included in the electronic device, or may exist independently without being installed in the electronic device.

[0142] The above-mentioned computer-readable medium carries one or more programs. When the above-mentioned one or more programs are executed by the electronic device, the electronic device: obtains the manifest file corresponding to each object storage bucket in the storage system, and the manifest file includes a list of scanned objects of the object storage bucket and the number of expired objects in the scanned object list; according to the preset object allocation rule, performs a loop traversal allocation for each object storage bucket to obtain the target object allocation quota of each object storage bucket; wherein the preset allocation rule is used to control the object allocation for the object storage bucket based on the single bucket allocation quota limit value and / or the total allocation quota limit value; based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, and the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing task of an object storage bucket is not greater than the target object allocation quota of the object storage bucket; and controls the parallel execution of the data processing tasks of each object storage bucket.

[0143] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0144] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0145] The modules involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the name of a module does not, in some cases, limit the module itself.

[0146] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0147] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0148] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0149] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0150] Although the subject matter has been described in language specific to structural features and / or method logic actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims. Regarding the device in the above embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Claims

1. A resource scheduling method based on a storage system, characterized in that: The method comprises: Obtain a manifest file corresponding to each object storage bucket in the storage system, wherein the manifest file includes a scanned object list of the object storage bucket and a number of expired objects in the scanned object list; According to the preset object allocation rule, a cyclic traversal allocation is performed for each object storage bucket to obtain the target object allocation quota of each object storage bucket; wherein the preset object allocation rule is used to control the object allocation for the object storage bucket based on the single bucket allocation quota limit value and / or the total allocation quota limit value; Based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, a corresponding data processing task is generated for each object storage bucket, wherein the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket; Controls the parallel execution of data processing tasks for each object storage bucket.

2. The resource scheduling method based on the storage system according to claim 1, characterized in that: The step of generating a corresponding data processing task for each object storage bucket based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket includes: For each object storage bucket, selecting, from at least one inventory file of the object storage bucket, an inventory file having a number of expired objects not greater than a target object allocation quota of the object storage bucket as a target inventory file; Based on the target list file of each object storage bucket, generate the data processing task corresponding to each object storage bucket.

3. The resource scheduling method based on the storage system according to claim 2, characterized in that: The step of generating data processing tasks corresponding to each object storage bucket based on the target list file of each object storage bucket includes: According to the number of expired objects in the target inventory file of each object storage bucket, target inventory files whose number of expired objects belongs to the same data range are marked as having the same inventory file priority; wherein different inventory file priorities correspond to different data ranges; Based on the marked target list files of the object storage buckets, data processing tasks corresponding to the object storage buckets are generated, and the priorities of the target list files are configured as execution priorities of the corresponding data processing tasks.

4. The resource scheduling method based on the storage system according to any one of claims 1 to 3, characterized in that: The step of performing cyclic traversal allocation for each object storage bucket according to the preset object allocation rule to obtain the target object allocation quota for each object storage bucket includes: The object storage buckets are sorted according to a preset bucket sorting rule to obtain an object storage bucket sequence; wherein the preset bucket sorting rule is used to indicate that the object storage buckets are sorted in ascending order according to the allocated object allocation quotas, and the object storage buckets with equal allocated object allocation quotas are sorted in ascending order according to the number of expired objects; Allocating equal object allocation quotas to each object storage bucket in turn according to the object storage bucket sequence; Repeat the steps of sorting the object storage buckets according to the preset bucket sorting rule to obtain the object storage bucket sequence and allocating an equal object allocation quota to each object storage bucket in turn according to the object storage bucket sequence until the preset object allocation rule is met and the target object allocation quota of each object storage bucket is obtained.

5. The resource scheduling method based on the storage system according to claims 1-3, characterized in that: The preset object allocation rule includes at least one of the following: When the object allocation quota allocated to any object storage bucket reaches the number of expired objects in the object storage bucket and / or the single bucket allocation quota limit value, the object allocation for the object storage bucket is terminated, and the single bucket allocation quota limit value includes at least one of the object processing quota limit value and the preset allocation quota limit value; When the total amount of object allocations of all object storage buckets reaches the total allocation amount limit value, ending the object allocation for all object storage buckets; When the object allocation quotas allocated to each object storage bucket reach the number of expired objects corresponding to each object storage bucket, object allocation for all object storage buckets is terminated.

6. The resource scheduling method based on the storage system according to claim 5, characterized in that: The method further comprises: After obtaining the target object allocation quota of each object storage bucket, if the total object allocation quota of all the object storage buckets is less than the total allocation quota limit value, select the target object storage bucket whose target object allocation quota reaches the preset allocation quota limit value from all the object storage buckets; According to the preset object allocation rule, a cyclic traversal allocation is performed for each target object storage bucket to obtain an object allocation supplementary quota for each target object storage bucket; Based on the object allocation supplementary quota of each target object storage bucket and the inventory file corresponding to each target object storage bucket, a corresponding data processing supplementary task is generated for each target object storage bucket; wherein the execution priority of the data processing task is higher than the execution priority of the data processing supplementary task.

7. The resource scheduling method based on a storage system according to any one of claims 1 to 3, characterized in that: The control executes data processing tasks of each object storage bucket in parallel, including: During the execution of the data processing tasks of each object storage bucket in parallel, the lifecycle policy of each object storage bucket is used to match the expired objects corresponding to the data processing tasks, and the matched expired objects are deleted or transferred.

8. The resource scheduling method based on a storage system according to any one of claims 1 to 3, characterized in that: The control executes data processing tasks of each object storage bucket in parallel, including: In the process of controlling the parallel execution of data processing tasks of each object storage bucket, when the data processing task carries starting object information and starting position information, the specified object is located according to the starting object information and the starting position information, and processing starts from the specified object.

9. The resource scheduling method based on a storage system according to any one of claims 1 to 3, characterized in that: The obtaining of the manifest files corresponding to each object storage bucket in the storage system includes: Get the lifecycle policy of each object storage bucket in the storage system; Scan the objects in each object storage bucket in turn, match the scanned objects based on the corresponding lifecycle policy to obtain matching expired objects, count the number of expired objects, and generate at least one manifest file for each object storage bucket at the end of the scan.

10. A resource scheduling device based on a storage system, characterized in that: The device comprises: An acquisition module, configured to acquire a list file corresponding to each object storage bucket in the storage system, wherein the list file includes a list of scanned objects in the object storage bucket and a number of expired objects in the list of scanned objects; An allocation module, configured to perform cyclic traversal allocation for each object storage bucket according to a preset object allocation rule, and obtain a target object allocation quota for each object storage bucket in the storage system; wherein the preset object allocation rule is used to control the object allocation for the object storage bucket based on a single bucket allocation quota limit value and / or a total allocation quota limit value; A generation module, for generating a corresponding data processing task for each object storage bucket based on the target object allocation quota of each object storage bucket and the manifest file corresponding to each object storage bucket, wherein the data processing task is executed according to the granularity of the manifest file; wherein the number of expired objects in the manifest file executed by the total data processing tasks of an object storage bucket is not greater than the target object allocation quota of the object storage bucket; The execution module is used to control the parallel execution of data processing tasks of each object storage bucket.

11. A computer readable medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processing device, the steps of the method according to any one of claims 1 to 9 are implemented.

12. An electronic device, characterized in that: include: a storage device having a computer program stored thereon; A processing device, configured to execute the computer program in the storage device to implement the steps of the method according to any one of claims 1 to 9.

13. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.

Images