CN116225639A - Task allocation method and device, electronic equipment and readable storage medium - Google Patents

Task allocation method and device, electronic equipment and readable storage medium Download PDF

Info

Publication number
CN116225639A
CN116225639A CN202211606833.3A CN202211606833A CN116225639A CN 116225639 A CN116225639 A CN 116225639A CN 202211606833 A CN202211606833 A CN 202211606833A CN 116225639 A CN116225639 A CN 116225639A
Authority
CN
China
Prior art keywords
target
ipfs node
resource occupation
ipfs
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202211606833.3A
Other languages
Chinese (zh)
Other versions
CN116225639B (en
Inventor
邹小川
姚子丹
秦明
尹立东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Microprofit Electronic Co ltd
Original Assignee
Shenzhen Microprofit Electronic Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Microprofit Electronic Co ltd filed Critical Shenzhen Microprofit Electronic Co ltd
Priority to CN202211606833.3A priority Critical patent/CN116225639B/en
Publication of CN116225639A publication Critical patent/CN116225639A/en
Application granted granted Critical
Publication of CN116225639B publication Critical patent/CN116225639B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application provides a task allocation method, a device, electronic equipment and a readable storage medium, wherein the task allocation method comprises the following steps: acquiring tag information of a target I PFS node, wherein the tag information comprises a current data sealing stage in which the target I PFS node is positioned and a current resource occupation space corresponding to the target I PFS node in the current data sealing stage; searching a resource occupation limit value corresponding to a current data sealing stage in a preset resource occupation table based on label information, wherein the preset resource occupation table is used for representing a mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by a target I PFS node in the current data sealing stage; and distributing tasks to the target I PFS nodes according to the current resource occupation space and the resource occupation limit value. The method and the device solve the technical problem of low utilization rate of the I PFS node resources in the prior art.

Description

Task allocation method and device, electronic equipment and readable storage medium
Technical Field
The present disclosure relates to the field of blockchain technologies, and in particular, to a task allocation method, a task allocation device, an electronic device, and a readable storage medium.
Background
The interplanetary file system IPFS (Inter-Planetary File System) is a global, point-to-point oriented, distributed version of the file system that is dedicated to creating a network transport protocol that persists and stores and shares files in a distributed manner, and it can be used for blockchain projects of storage, but not all file stores can be used as a computational standard. The stored file needs to be subjected to a sealing process, after the sealing is finished, the data is moved and stored into the IPFS node to become calculation power, the node resource utilization rate of the IPFS node is usually improved by improving the performance of a host CPU and a graphics card GPU of the IPFS node, but in the actual use process, the resource space required to be utilized in each data sealing stage is different, if the resource utilization rate of one of the host CPU and the graphics card GPU reaches the maximum value, the IPFS node resource is judged to be completely utilized, the utilization of the other resource is stopped, namely, one resource is completely utilized, and the utilization rate of the other resource is not completely utilized, so that the utilization rate of the host CPU and the graphics card GPU is not in direct proportion, and the utilization rate of the IPFS node resource is low.
Disclosure of Invention
The main purpose of the application is to provide a task allocation method, a device, an electronic device and a readable storage medium, and aims to solve the technical problem of low utilization rate of IPFS node resources in the prior art.
In order to achieve the above object, the present application provides a task allocation method, including:
acquiring label information of a target IPFS node, wherein the label information comprises a current data sealing stage in which the target IPFS node is positioned and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage;
and distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
To achieve the above object, the present application further provides a task allocation device, including:
The system comprises a tag information acquisition module, a target IPFS node and a target IPFS node, wherein the tag information acquisition module is used for acquiring tag information of the target IPFS node, and the tag information comprises a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
the resource occupation limit value acquisition module is used for searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space which can be occupied by the target IPFS node in the current data sealing stage;
and the task allocation module is used for allocating tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
The application also provides an electronic device comprising: the task allocation method comprises a memory, a processor and a program of the task allocation method stored in the memory and capable of running on the processor, wherein the program of the task allocation method can realize the steps of the task allocation method when being executed by the processor.
The present application also provides a computer-readable storage medium having stored thereon a program for implementing a task allocation method, which when executed by a processor implements the steps of the task allocation method as described above.
The present application also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of a task allocation method as described above.
Compared with the prior art that the node resource utilization rate of an IPFS node is improved by improving the performances of a host CPU and a graphics card GPU of the IPFS node, the task allocation method, the device, the electronic equipment and the readable storage medium firstly acquire tag information of a target IPFS node, wherein the tag information comprises a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage; searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage; and distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value. According to the method and the device, the data sealing stage where the currently used IPFS node is located is monitored in real time, the resource utilization condition of the IPFS node in each stage is analyzed, tasks are distributed in stages, and therefore the maximum resource occupation space of the IPFS node in each stage is guaranteed, the maximum utilization of the IPFS node resources is achieved, the technical defect that the utilization rate of a host CPU and a graphics card GPU is not in direct proportion is overcome, if the utilization rate of one of the resources in the host CPU and the graphics card GPU reaches the maximum value, it is judged that the IPFS node resources are completely utilized, the utilization of the other resources is stopped, namely, the resources of one side are completely utilized, the utilization rate of the host CPU and the graphics card GPU is not in direct proportion, and therefore the utilization rate of the IPFS node resources is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be used in the description of the embodiments or the prior art will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.
FIG. 1 is a schematic flow chart of a task allocation method according to an embodiment of the present application;
FIG. 2 is a schematic flow chart of a task allocation method according to a second embodiment of the present application;
FIG. 3 is a schematic flow chart of a task allocation method according to a third embodiment of the present application;
FIG. 4 is a schematic structural diagram of a task assigning device according to a fourth embodiment of the present application;
fig. 5 is a schematic device structure diagram of a hardware operating environment related to a task allocation method in an embodiment of the present application.
The implementation, functional features and advantages of the present application will be further described with reference to the accompanying drawings in conjunction with the embodiments.
Detailed Description
In order to make the above objects, features and advantages of the present application more comprehensible, the following description will make the technical solutions of the embodiments of the present application clear and complete with reference to the accompanying drawings of the embodiments of the present application. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. All other embodiments, based on the embodiments herein, which are within the scope of the protection of the present application, will be within the purview of one of ordinary skill in the art without the exercise of inventive faculty.
Example 1
The interplanetary file system IPFS (Inter-Planetary File System) is a global, point-to-point oriented, distributed version of the file system that is dedicated to creating a network transport protocol that persists and stores and shares files in a distributed manner, and it can be used for blockchain projects of storage, but not all file stores can be used as a computational standard. The stored file needs to be subjected to a sealing process, after the sealing is finished, the data is moved and stored into the IPFS node to become calculation power, the node resource utilization rate of the IPFS node is usually improved by improving the performance of a host CPU and a graphics card GPU of the IPFS node, but in the actual use process, the resource space required to be utilized in each data sealing stage is different, if the resource utilization rate of one of the host CPU and the graphics card GPU reaches the maximum value, the IPFS node resource is judged to be completely utilized, the utilization of the other resource is stopped, namely, one resource is completely utilized, and the utilization rate of the other resource is not completely utilized, so that the utilization rate of the host CPU and the graphics card GPU is not in direct proportion, and the utilization rate of the IPFS node resource is low.
An embodiment of the present application provides a task allocation method, in a first embodiment of the task allocation method of the present application, referring to fig. 1, the task allocation method includes:
step S10, acquiring label information of a target IPFS node, wherein the label information comprises a current data sealing stage in which the target IPFS node is positioned and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
in the embodiment of the present application, it should be noted that the target IPFS node refers to an IPFS node that is currently executing a task.
Additionally, it should be noted that the tag information includes a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage, where the current data sealing stage includes a pre Commit 1 stage, a pre Commit 2 stage, a Commit 1 stage, and a Commit 2 stage.
Step S20, searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage;
In this embodiment of the present application, it should be noted that the preset resource occupancy table is used to characterize a mapping relationship between each data sealing stage and the resource occupancy limit, where the resource occupancy limit refers to a maximum resource space that the target IPFS node can occupy in the current data sealing stage.
And step S30, distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
In the embodiment of the present application, it should be noted that, the step of allocating the task to the target IPFS node only has two cases, one is to add the task to the target IPFS node in response to the task adding command when the current resource occupation space is smaller than the resource occupation limit value, and the other is to keep the task of the target IPFS node, that is, not to add the task to the target IPFS node when the current resource occupation space is not smaller than the resource occupation limit value.
As an example, steps S10 to S30 include: obtaining hash identifications of all IPFS nodes, and determining a currently used target IPFS node based on the hash identifications; acquiring label information of the target IPFS node, wherein the label information comprises a current data sealing stage in which the target IPFS node is positioned and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage; searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage; and if the current resource occupation space is detected to be smaller than the resource occupation limit value, assigning tasks to the target IPFS node. According to the method and the device, the target IPFS node used currently is determined through the hash mark, whether the resource occupation space corresponding to the data sealing stage of the IPFS node used currently reaches the maximum resource space occupied by the data sealing stage or not is monitored in real time to distribute tasks, and if the resource occupation space of the IPFS node in the data sealing stage of the IPFS node is not reached to the maximum resource occupation space, namely, when the IPFS node resource in the current data sealing stage is not fully utilized, the tasks are distributed to the IPFS node, so that the maximum utilization of the IPFS node resource is realized in a staged mode, and the utilization rate of the IPFS node resource is improved.
Wherein, the step of allocating tasks to the target IPFS node according to the current resource occupation space and the resource occupation threshold includes:
step S31, if the current resource occupation space is detected to be smaller than the resource occupation limit value, a task is distributed to the target IPFS node;
step S32, if it is detected that the current resource occupation space is not less than the resource occupation threshold, no task is allocated to the target IPFS node, and step S10 is executed in a return manner: and acquiring label information of the target IPFS node.
As an example, steps S31 to S32 include: detecting whether the current resource occupation space is smaller than the resource occupation limit value; if the current resource occupation space is detected to be smaller than the resource occupation limit value, a task is distributed to the target IPFS node according to the current resource occupation space and the resource occupation limit value; if the current resource occupation space is detected not to be smaller than the resource occupation limit value, tasks are not allocated to the target IPFS node, and the step S10 is executed in a return mode: and acquiring label information of the target IPFS node. According to the method and the device, the task is distributed to the IPFS node by judging whether the resource occupation space of the IPFS node in the current data sealing stage reaches the maximum resource occupation space which can be achieved in the current stage, when the resource occupation space is not achieved, the task is distributed to the IPFS node, and when the resource occupation space is achieved, the judgment of the next data sealing stage is entered, so that the IPFS node resource is utilized to the maximum extent, waste of the IPFS node resource is reduced, and the utilization rate of the IPFS node resource is improved.
Wherein if the current resource occupation space is detected to be smaller than the resource occupation limit value, the step of allocating tasks to the target IPFS node includes:
step S311, obtaining a pre-allocated space corresponding to the task;
in the embodiment of the present application, it should be noted that, the pre-allocation refers to a task to be allocated to an IPFS node, and the pre-allocation space refers to a resource space that needs to be occupied by the pre-allocated task.
Step S312, determining the residual resource space corresponding to the current data sealing stage according to the current resource occupation space and the resource occupation limit value;
in the embodiment of the present application, it should be noted that the remaining resource space refers to a remaining, occupiable, but unoccupied resource space of the target IPFS node in the current data sealing stage.
Step S313, allocating a task to the target IPFS node according to the remaining resource space and the pre-occupied space.
As an example, step S311 to step S313 include: and obtaining a pre-allocated space corresponding to the task, calculating the difference between the current resource occupation space and the resource occupation limit value, determining a residual resource space corresponding to the current data sealing stage, and allocating the task to the target IPFS node according to the residual resource space and the pre-allocated space. For example, assuming that the remaining resource space is 10, the existing resource space required to be occupied by the task 1 is 2, the resource space required to be occupied by the task 2 is 5, and the resource space required to be occupied by the task 3 is 3, the task 1, the task 2, and the task 3 may be allocated to the IPFS node, so as to achieve maximum utilization of resources of the IPFS node.
As an example, the tag information may further include a current task number of the target IPFS node, and if resource spaces occupied by tasks of the IPFS nodes in the target IPFS node are consistent, the task may be allocated by the task number, and specifically, the current task number of the target IPFS node is obtained, where the target IPFS node refers to the currently used IPFS node; and distributing tasks to the target IPFS node according to the current task number and a task number limit value corresponding to the target IPFS node, wherein the task number limit value is the maximum task number which can be accepted by the target IPFS node.
Optionally, the task number limit value is the maximum task number that can be accepted by the target IPFS node, where the task number limit value is determined by the IPFS node itself, optionally, when determining the task number limit value, the maximum number of tasks that can be accepted by the IPFS node may be obtained by testing the number of cache tasks that can be executed by the internal process of the IPFS node, and counting the number of cache tasks that can be executed by each internal process.
As an example, the step of allocating tasks to the target IPFS node according to the current task number and the task number threshold corresponding to the target IPFS node includes: judging whether the current task number is smaller than the task number limit value or not; if the current task number is smaller than the task number limit value, assigning tasks to the target IPFS node; if the current task number is not smaller than the task number threshold value, not distributing tasks to the target IPFS node, and returning to the execution step: the current task number of the target IPFS node is obtained. For example, it may be assumed that the maximum number of tasks that can be accepted by the IPFS node a is 8, and it is currently detected that the IPFS node a accepts only 5 tasks, and 5<8 is seen, so that 3 tasks need to be reassigned to the IPFS node a so that the tasks accepted by the IPFS node a reach the maximum value of 8.
As an example, the step of obtaining the current task number of the target IPFS node includes: obtaining hash identifiers corresponding to all IPFS nodes by traversing all the IPFS nodes, wherein the hash identifiers refer to fixed IPFS node identifiers corresponding to the IPFS nodes; and based on the starting state of each hash mark, responding to a task number acquisition command, and acquiring the current task number of the target IPFS node, wherein the starting state comprises an on state and an off state.
As an example, the step of obtaining, based on the enabled state of each hash identifier, the current task number of the target IPFS node in response to a task number obtaining command includes: detecting the starting state of the hash mark, and if the starting state of the hash mark is detected to be an opening state, responding to a task number acquisition command to acquire the current task number of the target IPFS node; and if the starting state of the hash mark is detected to be the closing state, invalidating the task number acquisition command, and continuously monitoring whether the starting state of the hash mark is the opening state.
Compared with the prior art that the node resource utilization rate of the IPFS node is improved by improving the performances of a host CPU and a graphics card GPU of the IPFS node, the task allocation method comprises the steps that firstly, tag information of a target IPFS node is obtained, wherein the tag information comprises a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage; searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage; and distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value. According to the method and the device, the data sealing stages where the IPFS node used currently is located are monitored in real time, the resource utilization condition of the IPFS node in each stage is analyzed, tasks are distributed in stages, and therefore the maximum resource occupation space of the IPFS node in each stage is guaranteed, the maximum utilization of the IPFS node resources is achieved, the technical defect that the resource space required to be utilized in each data sealing stage in the prior art is different is overcome, if the resource utilization rate of one of a host CPU and a graphics card GPU reaches the maximum value, it is judged that the IPFS node resources are fully utilized, the utilization of the other resource is stopped, namely, the resources of one party are fully utilized, the utilization rate of the other party is not fully utilized, and the utilization rate of the host CPU and the graphics card GPU is not in direct proportion is overcome, so that the utilization rate of the IPFS node resources is improved.
Example two
Further, referring to fig. 2, in another embodiment of the present application, the same or similar content as that of the first embodiment may be referred to the description above, and will not be repeated. On this basis, the step of acquiring the label information of the target IPFS node includes:
step S11, obtaining hash identifiers corresponding to all IPFS nodes, wherein the hash identifiers refer to fixed IPFS node identifiers corresponding to all IPFS nodes;
in this embodiment of the present application, it should be noted that the hash identifier refers to a fixed IPFS node identifier corresponding to each IPFS node, where the hash identifier is generated by using a hash function when the IPFS node is started, and the hash function refers to a value capable of converting an arbitrary input value into a fixed length to output, where the output value is a hash value.
Step S12, determining a target IPFS node currently used according to the starting state of each hash mark, wherein the starting state comprises an opening state and a closing state;
in this embodiment of the present application, it should be noted that the enabling state includes an on state and an off state, where the on state refers to that the hash identifier is enabled, and the off state refers to that the hash identifier is not enabled.
And step S13, responding to a label information acquisition command to acquire the label information of the target IPFS node.
The determination of the tag information of the IPFS node needs to be performed firstly, the determination of the IPFS node needs to be performed by providing the IPFS node identification, the IPFS node identification changes when the computer is restarted, the IPFS node identification corresponding to the IPFS node in the current startup is different from the IPFS node identification corresponding to the IPFS node in the next startup, and therefore the next IPFS node determination needs to be performed again, and the acquisition efficiency of the IPFS node tag information is low.
As an example, steps S11 to S13 include: obtaining hash identifiers corresponding to all IPFS nodes, wherein the hash identifiers are fixed IPFS node identifiers corresponding to all IPFS nodes; acquiring an enabling state of each hash mark, wherein the enabling state comprises an opening state and a closing state; judging whether the IPFS node corresponding to the hash mark is a currently used target IPFS node or not according to the starting state of the hash mark; if the starting state of the hash mark is detected to be the starting state, the hash mark is started, and a target IPFS node corresponding to the hash mark is determined; responding to a tag information obtaining command to obtain tag information of the target IPFS node; if the hash identification is detected to be in the closed state, the hash identification is not started, and the step S11 is executed: and obtaining hash identifiers corresponding to the IPFS nodes.
As an example, the step of determining, according to the enabling state of the hash identifier, whether the IPFS node corresponding to the hash identifier is the currently used target IPFS node further includes: determining the use state of the IPFS node corresponding to the hash mark according to the start-up state of the hash mark, if the start-up state of the hash mark is the on state, using the IPFS node corresponding to the hash mark, if the start-up state of the hash mark is the off state, not using the IPFS node corresponding to the hash mark, and returning to execute the step S11: and obtaining hash identifiers corresponding to the IPFS nodes.
Wherein, the step of determining the currently used target IPFS node according to the enabling state of each hash identifier includes:
step S121, if it is detected that the enabling state of the hash identifier is an on state, the IPFS node corresponding to the hash identifier is the target IPFS node currently used;
step S122, if it is detected that the enabled state of the hash identifier is the off state, the IPFS node corresponding to the hash identifier is not the target IPFS node currently used, and the step S11 is executed in a return manner: and obtaining hash identifiers corresponding to the IPFS nodes.
In this embodiment of the present application, it should be noted that, the enabling state of the hash identifier is an on state, which means that the IPFS node corresponding to the hash identifier is used, and the enabling state of the hash identifier is an off state, which means that the IPFS node corresponding to the hash identifier is not used.
As an example, step S121 to step S122 include: detecting an enabling state of the hash mark, wherein the enabling state comprises an opening state and a closing state; if the starting state of the hash mark is detected to be an opening state, the IPFS node corresponding to the hash mark is the target IPFS node currently used; if the starting state of the hash mark is detected to be the closing state, the IPFS node corresponding to the hash mark is not the target IPFS node used currently, and the step S11 is executed in a return mode: and acquiring the starting state of each hash mark. The method comprises the steps that a hash mark is started, namely an IPFS node corresponding to the hash mark is used, and the hash mark is started, namely the IPFS node corresponding to the hash mark is not used. According to the method and the device for monitoring the use condition of the IPFS node by monitoring the starting state of the hash mark, the hash mark is the fixed IPFS node mark corresponding to the IPFS node generated by the hash function, so that the use condition of each IPFS node can be accurately monitored, the currently used IPFS node can be accurately and rapidly obtained, namely, the IPFS node currently executing the task is obtained, and the efficiency of obtaining the IPFS node is improved.
The embodiment of the application provides a tag information acquisition method, namely, hash identifiers corresponding to all IPFS nodes are acquired, wherein the hash identifiers refer to fixed IPFS node identifiers corresponding to all IPFS nodes; determining a target IPFS node currently used according to the starting state of each hash mark, wherein the starting state comprises an opening state and a closing state; and responding to a tag information acquisition command, and acquiring tag information of the target IPFS node. According to the method and the device for monitoring the IPFS node, the IPFS node identification of the IPFS node is identified through the hash identification, so that a fixed IPFS node identification can be obtained, whether the IPFS node corresponding to the hash identification is used or not is judged through judging the starting state of the hash identification, the service condition of each IPFS node is accurately monitored and acquired, the accuracy of monitoring the IPFS node is guaranteed, the defect that in the prior art, when a computer is restarted, the IPFS node identification changes, the IPFS node identification corresponding to the IPFS node when the computer is started up this time is different from the IPFS node identification corresponding to the IPFS node when the computer is started up next time is overcome, and therefore the technical defect that the IPFS node identification needs to be acquired again when the IPFS node is determined next time is caused, and the acquisition efficiency of the IPFS node label information is improved.
Example III
Further, referring to fig. 3, in another embodiment of the present application, the same or similar content as that of the first embodiment may be referred to the description above, and will not be repeated. On the basis, the step of responding to the tag information obtaining command to obtain the tag information of the target IPFS node comprises the following steps:
step A10, acquiring response time of the tag information acquisition command;
in the embodiment of the present application, it should be noted that the response time refers to a time that elapses from pre-response to complete response of the tag information acquiring command.
And step A20, acquiring the label information of the target IPFS node according to the response time and a preset response time limit value.
In this embodiment of the present application, it should be noted that, the preset response time limit value refers to a maximum response time of the tag information obtaining command in a normal response state, for example, it may be assumed that the response time limit value is 5, if the response time of the tag information obtaining command is 4, and 4<5 is visible, the tag information obtaining command is a normal response, and the obtaining operation is normally executed; if the response time of the tag information acquiring command is 6, 6>5 can be seen, the tag information acquiring command is an abnormal response, and the acquiring operation cannot be performed.
As an example, steps a10 to a20 include: and acquiring a first time point corresponding to the pre-response of the tag information acquisition command and a second time point corresponding to the complete response of the tag information acquisition command, calculating a difference value between the first time point and the second time point, determining response time, and acquiring the tag information of the target IPFS node according to the response time and a preset response time limit value. According to the method and the device for obtaining the tag information, the response time of the tag information obtaining command is limited, the accuracy of tag information obtaining can be improved, the tag information of the IPFS node can be normally obtained only when the tag information obtaining command is in a normal response state, and further the efficiency of tag information obtaining is improved.
The step of obtaining the tag information of the target IPFS node according to the response time and a preset response time limit value includes:
step A21, judging whether the response time is smaller than the preset response time limit value;
step A22, if yes, acquiring the label information of the target IPFS node;
step A23, if not, generating an IPFS node log table, repairing the target IPFS node according to the IPFS node log table, and returning to execute step A10: and acquiring response time of the tag information acquisition command, wherein the IPFS node log table is used for recording problems encountered when the IPFS node runs.
As an example, steps a21 to a23 include: judging whether the response time is smaller than the preset response time limit value or not; if the response time is smaller than the preset response time limit value, acquiring label information of the target IPFS node; if the response time is not less than the preset response time limit value, an IPFS node log table is generated, an IPFS node adjustment list is generated according to the IPFS node log table, wherein the IPFS node adjustment list is used for recording the problem that the target IPFS node needs to be repaired, the target IPFS node is repaired according to the IPFS node adjustment list, and the step A10 is executed in a return mode: and acquiring response time of the tag information acquisition command, wherein the preset response time limit value refers to the maximum response time of the tag information acquisition command in a normal response state, and the IPFS node log table is used for recording problems encountered during operation of the IPFS node. According to the task allocation method, whether the tag information of the target IPFS node is normally acquired is determined by judging whether the response time of the tag information acquisition command is smaller than the maximum response time, and the task allocation method can be normally operated only after the tag information of the target IPFS node is normally acquired, so that the technical defect that if the response time of the tag information acquisition command is too long, the problem of a system is solved, and if the system continues to operate, the accuracy of task allocation cannot be guaranteed by the subsequent program operation is overcome, and the accuracy of task allocation is guaranteed.
Optionally, if the response time is not less than the preset response time limit value, the user can be reminded that the running of the current system has a problem through an alarm signal, an IPFS node log table for recording the problem encountered by the running time of the IPFS node is generated, and the generated IPFS node log table is sent to the user in a mail form to inform the user of the specific problem and the cause of the problem.
The embodiment of the application provides a tag information acquisition method, namely, response time of a tag information acquisition command is acquired; and acquiring the label information of the target IPFS node according to the response time and a preset response time limit value. According to the embodiment of the application, the response time of the tag information acquisition command is limited by presetting the response time limit value, so that the obtained tag information is ensured to be obtained under the condition that the IPFS node is in normal operation, and the accuracy of tag information acquisition is ensured while the tag information acquisition efficiency is improved.
Example IV
The embodiment of the application also provides a task allocation device, referring to fig. 4, the task allocation device includes:
the tag information obtaining module 10 is configured to obtain tag information of a target IPFS node, where the tag information includes a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
The resource occupation limit value obtaining module 20 is configured to search, based on the tag information, a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table, where the preset resource occupation table is used to characterize a mapping relationship between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to a maximum resource space that the target IPFS node can occupy in the current data sealing stage;
and a task allocation module 30, configured to allocate a task to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
Optionally, the task allocation module 30 further includes:
if the current resource occupation space is detected to be smaller than the resource occupation limit value, a task is distributed to the target IPFS node;
if the current resource occupation space is detected not to be smaller than the resource occupation limit value, not distributing tasks to the target IPFS node, and returning to the execution step: and acquiring label information of the target IPFS node.
Optionally, the task allocation module 30 further includes:
acquiring a pre-allocated space corresponding to a task;
determining the residual resource space corresponding to the current data sealing stage according to the current resource occupation space and the resource occupation limit value;
And distributing tasks to the target IPFS node according to the residual resource space and the pre-occupied space.
Optionally, the tag information acquiring module 10 further includes:
obtaining hash identifiers corresponding to all IPFS nodes, wherein the hash identifiers are fixed IPFS node identifiers corresponding to all IPFS nodes;
determining a target IPFS node currently used according to the starting state of each hash mark, wherein the starting state comprises an opening state and a closing state;
and responding to a tag information acquisition command, and acquiring tag information of the target IPFS node.
Optionally, the tag information acquiring module 10 further includes:
if the starting state of the hash mark is detected to be an opening state, the IPFS node corresponding to the hash mark is the target IPFS node currently used;
if the starting state of the hash mark is detected to be the closing state, the IPFS node corresponding to the hash mark is not the target IPFS node used currently, and the execution steps are returned: and obtaining hash identifiers corresponding to the IPFS nodes.
Optionally, the tag information acquiring module 10 further includes:
acquiring response time of the tag information acquisition command;
And acquiring the label information of the target IPFS node according to the response time and a preset response time limit value.
Optionally, the tag information acquiring module 10 further includes:
judging whether the response time is smaller than the preset response time limit value or not;
if yes, acquiring the label information of the target IPFS node;
if not, generating an IPFS node log table, repairing the target IPFS node according to the IPFS node log table, and returning to the execution step: and acquiring response time of the tag information acquisition command, wherein the IPFS node log table is used for recording problems encountered when the IPFS node runs.
The task allocation device provided by the application adopts the task allocation method in the embodiment, and solves the technical problem of low utilization rate of IPFS node resources. Compared with the prior art, the embodiment of the application provides
Advantageous effects of the task allocation device provided are the same as advantageous effects 5 of the task allocation method provided in the above embodiment, and other technical features in the task allocation device are the same as those disclosed in the method of the above embodiment
Also, the description is omitted here.
Example IV
An embodiment of the present application provides an electronic device, including: at least one processor; 0 and a memory communicatively coupled to the at least one processor; wherein the memory stores at least one data that can be used to store
Instructions executed by one processor are executed by at least one processor to enable the at least one processor to perform the task allocation method of the first embodiment.
Reference is now made to FIG. 5, which illustrates a structural illustration of an electronic device suitable for use in practicing embodiments of the present disclosure
Intent. Electronic devices in embodiments of the present disclosure may include, but are not limited to, devices such as mobile phones, notebook 5 computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (personal digital assistants)
Portable multimedia player), a mobile terminal such as a car-mounted terminal (e.g., car navigation terminal), and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 5 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
As shown in fig. 5, the electronic device may include a processing means (e.g., a central processing unit, a graphic processing unit 0, etc.), which may be loaded in accordance with a program stored in a Read Only Memory (ROM) or from a storage means
To a program in Random Access Memory (RAM) to perform various appropriate actions and processes. In the RAM, various programs and data required for the operation of the electronic device are also stored. The processing device, ROM and RAM are connected to each other via a bus. An input/output (I/O) interface is also connected to the bus.
In general, the following systems may be connected to the I/O interface: input devices including, for example, touch screens, touch pads, keyboards, 5 mice, image sensors, microphones, accelerometers, gyroscopes, etc.; including, for example, liquids
Output devices for crystal displays (LCDs), speakers, vibrators, etc.; storage devices including, for example, magnetic tape, hard disk, etc.; a communication device. The communication means may allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. Although the figures illustrate electronic devices having various systems, it should be
It is to be understood that not necessarily all illustrated systems may be required to be implemented or provided. More or fewer systems may alternatively be implemented or provided.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via a communication device, or installed from a storage device, or installed from ROM. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by a processing device.
The electronic equipment provided by the application adopts the task allocation method in the first embodiment or the second embodiment, so that the technical problem of low utilization rate of IPFS node resources is solved. Compared with the prior art, the electronic device provided in the embodiment of the present application has the same beneficial effects as the task allocation method provided in the first embodiment, and other technical features in the electronic device are the same as the features disclosed in the method of the first embodiment, which are not described in detail herein.
It should be understood that portions of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof. In the description of the above embodiments, particular features, structures, materials, or characteristics may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Example five
The present embodiment provides a computer-readable storage medium having computer-readable program instructions stored thereon for performing the method of task allocation in the first embodiment described above.
The computer readable storage medium provided by the embodiments of the present application may be, for example, a usb disk, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In this embodiment, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, or device. Program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
The above-described computer-readable storage medium may be contained in an electronic device; or may exist alone without being assembled into an electronic device.
The computer-readable storage medium carries one or more programs that, when executed by an electronic device, cause the electronic device to: acquiring label information of a target IPFS node, wherein the label information comprises a current data sealing stage in which the target IPFS node is positioned and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage; searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage; and distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present disclosure may be implemented in software or hardware. Wherein the name of the module does not constitute a limitation of the unit itself in some cases.
The computer readable storage medium provided by the application is stored with the computer readable program instructions for executing the task allocation method, and the technical problem of low utilization rate of IPFS node resources is solved. Compared with the prior art, the beneficial effects of the computer readable storage medium provided in the embodiment of the present application are the same as those of the task allocation method provided in the above embodiment, and are not described herein.
Example six
The present application also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of a task allocation method as described above.
The computer program product provided by the application solves the technical problem of low utilization rate of IPFS node resources. Compared with the prior art, the beneficial effects of the computer program product provided by the embodiment of the present application are the same as those of the task allocation method provided by the above embodiment, and are not described herein.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the claims, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application, or direct or indirect application in other related technical fields are included in the scope of the claims.

Claims (10)

1. A task allocation method, characterized in that the task allocation method comprises:
acquiring label information of a target IPFS node, wherein the label information comprises a current data sealing stage in which the target IPFS node is positioned and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space occupied by the target IPFS node in the current data sealing stage;
and distributing tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
2. The task allocation method of claim 1, wherein the step of allocating tasks to the target IPFS node based on the current resource occupancy space and the resource occupancy limit comprises:
if the current resource occupation space is detected to be smaller than the resource occupation limit value, a task is distributed to the target IPFS node;
If the current resource occupation space is detected not to be smaller than the resource occupation limit value, not distributing tasks to the target IPFS node, and returning to the execution step: and acquiring label information of the target IPFS node.
3. The task allocation method according to claim 2, wherein the step of allocating a task to the target IPFS node if it is detected that the current resource occupancy is less than the resource occupancy limit comprises:
acquiring a pre-allocated space corresponding to a task;
determining the residual resource space corresponding to the current data sealing stage according to the current resource occupation space and the resource occupation limit value;
and distributing tasks to the target IPFS node according to the residual resource space and the pre-occupied space.
4. The task allocation method according to claim 1, wherein the step of acquiring tag information of the target IPFS node includes:
obtaining hash identifiers corresponding to all IPFS nodes, wherein the hash identifiers are fixed IPFS node identifiers corresponding to all IPFS nodes;
determining a target IPFS node currently used according to the starting state of each hash mark, wherein the starting state comprises an opening state and a closing state;
And responding to a tag information acquisition command, and acquiring tag information of the target IPFS node.
5. The task allocation method of claim 4, wherein the step of determining the currently used target IPFS node according to the enabled state of each of the hash identifications comprises:
if the starting state of the hash mark is detected to be an opening state, the IPFS node corresponding to the hash mark is the target IPFS node currently used;
if the starting state of the hash mark is detected to be the closing state, the IPFS node corresponding to the hash mark is not the target IPFS node used currently, and the execution steps are returned: and obtaining hash identifiers corresponding to the IPFS nodes.
6. The task allocation method of claim 4, wherein the step of acquiring tag information of the target IPFS node in response to a tag information acquisition command comprises:
acquiring response time of the tag information acquisition command;
and acquiring the label information of the target IPFS node according to the response time and a preset response time limit value.
7. The task allocation method according to claim 6, wherein the step of acquiring tag information of the target IPFS node according to the response time and a preset response time limit value includes:
Judging whether the response time is smaller than the preset response time limit value or not;
if yes, acquiring the label information of the target IPFS node;
if not, generating an IPFS node log table, repairing the target IPFS node according to the IPFS node log table, and returning to the execution step: and acquiring response time of the tag information acquisition command, wherein the IPFS node log table is used for recording problems encountered when the IPFS node runs.
8. A task allocation device, characterized in that the task allocation device comprises:
the system comprises a tag information acquisition module, a target IPFS node and a target IPFS node, wherein the tag information acquisition module is used for acquiring tag information of the target IPFS node, and the tag information comprises a current data sealing stage where the target IPFS node is located and a current resource occupation space corresponding to the target IPFS node in the current data sealing stage;
the resource occupation limit value acquisition module is used for searching a resource occupation limit value corresponding to the current data sealing stage in a preset resource occupation table based on the label information, wherein the preset resource occupation table is used for representing the mapping relation between each data sealing stage and the resource occupation limit value, and the resource occupation limit value refers to the maximum resource space which can be occupied by the target IPFS node in the current data sealing stage;
And the task allocation module is used for allocating tasks to the target IPFS node according to the current resource occupation space and the resource occupation limit value.
9. An electronic device, the electronic device comprising:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the steps of the task allocation method of any one of claims 1 to 7.
10. A computer-readable storage medium, having stored thereon a program for implementing a task allocation method, the program for implementing the task allocation method being executed by a processor to implement the steps of the task allocation method according to any one of claims 1 to 7.
CN202211606833.3A 2022-12-13 2022-12-13 Task allocation method and device, electronic equipment and readable storage medium Active CN116225639B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211606833.3A CN116225639B (en) 2022-12-13 2022-12-13 Task allocation method and device, electronic equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211606833.3A CN116225639B (en) 2022-12-13 2022-12-13 Task allocation method and device, electronic equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN116225639A true CN116225639A (en) 2023-06-06
CN116225639B CN116225639B (en) 2023-10-27

Family

ID=86583207

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211606833.3A Active CN116225639B (en) 2022-12-13 2022-12-13 Task allocation method and device, electronic equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN116225639B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109213594A (en) * 2017-07-06 2019-01-15 阿里巴巴集团控股有限公司 Method, apparatus, equipment and the computer storage medium that resource is seized
CN109417564A (en) * 2016-07-22 2019-03-01 英特尔公司 Technology for load of being assigned the job based on the utilization of resources stage
US20190391382A1 (en) * 2016-06-10 2019-12-26 California Institute Of Technology Systems and methods for coded-aperture-based correction of aberration obtained from fourier ptychography
CN112954022A (en) * 2020-12-29 2021-06-11 广东电网有限责任公司电力科学研究院 Multi-concurrency real-time communication method and device based on intelligent substation
CN113448716A (en) * 2020-03-24 2021-09-28 中兴通讯股份有限公司 Resource adjusting method, computer equipment and storage medium
CN113504981A (en) * 2021-07-26 2021-10-15 浙江大华技术股份有限公司 Task scheduling method and device, storage medium and electronic equipment
CN113806045A (en) * 2021-09-12 2021-12-17 济南浪潮数据技术有限公司 Task allocation method, system, device and medium
CN114138468A (en) * 2021-11-15 2022-03-04 苏州浪潮智能科技有限公司 Self-adaptive distribution method and device for packaging task quantity and storage medium
CN114153581A (en) * 2021-11-29 2022-03-08 北京金山云网络技术有限公司 Data processing method, data processing device, computer equipment and storage medium

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190391382A1 (en) * 2016-06-10 2019-12-26 California Institute Of Technology Systems and methods for coded-aperture-based correction of aberration obtained from fourier ptychography
CN109417564A (en) * 2016-07-22 2019-03-01 英特尔公司 Technology for load of being assigned the job based on the utilization of resources stage
CN109213594A (en) * 2017-07-06 2019-01-15 阿里巴巴集团控股有限公司 Method, apparatus, equipment and the computer storage medium that resource is seized
CN113448716A (en) * 2020-03-24 2021-09-28 中兴通讯股份有限公司 Resource adjusting method, computer equipment and storage medium
CN112954022A (en) * 2020-12-29 2021-06-11 广东电网有限责任公司电力科学研究院 Multi-concurrency real-time communication method and device based on intelligent substation
CN113504981A (en) * 2021-07-26 2021-10-15 浙江大华技术股份有限公司 Task scheduling method and device, storage medium and electronic equipment
CN113806045A (en) * 2021-09-12 2021-12-17 济南浪潮数据技术有限公司 Task allocation method, system, device and medium
CN114138468A (en) * 2021-11-15 2022-03-04 苏州浪潮智能科技有限公司 Self-adaptive distribution method and device for packaging task quantity and storage medium
CN114153581A (en) * 2021-11-29 2022-03-08 北京金山云网络技术有限公司 Data processing method, data processing device, computer equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
币圈白晓生: "Filecoin封装以及P1/P2/C1C2解读", Retrieved from the Internet <URL:《https://baijiahao.baidu.com/s?id=1686056809836265778&wfr=spider&for=pc》> *

Also Published As

Publication number Publication date
CN116225639B (en) 2023-10-27

Similar Documents

Publication Publication Date Title
CN111198859B (en) Data processing method, device, electronic equipment and computer readable storage medium
CN110391938B (en) Method and apparatus for deploying services
CN111857720B (en) User interface state information generation method and device, electronic equipment and medium
CN109672722B (en) Data deployment method and device, computer storage medium and electronic equipment
CN111625422B (en) Thread monitoring method, thread monitoring device, electronic equipment and computer readable storage medium
CN111309228A (en) Multimedia processing method and device and electronic equipment
CN113553178A (en) Task processing method and device and electronic equipment
CN111290871A (en) Method and device for acquiring crash information of application program
CN110083529B (en) Automatic testing method, device, medium and electronic equipment
CN111258803A (en) Collapse positioning method and device and electronic equipment
CN109284108B (en) Unmanned vehicle data storage method and device, electronic equipment and storage medium
CN111626990B (en) Target detection frame processing method and device and electronic equipment
CN110674050B (en) Memory out-of-range detection method and device, electronic equipment and computer storage medium
CN111274104B (en) Data processing method, device, electronic equipment and computer readable storage medium
CN111198853B (en) Data processing method, device, electronic equipment and computer readable storage medium
CN111124627B (en) Method and device for determining call initiator of application program, terminal and storage medium
CN116225639B (en) Task allocation method and device, electronic equipment and readable storage medium
CN111177260A (en) Database remote copying method and device and electronic equipment
CN113886353B (en) Data configuration recommendation method and device for hierarchical storage management software and storage medium
CN111241368B (en) Data processing method, device, medium and equipment
CN111625326B (en) Task pipeline execution method and device and electronic equipment
CN111309367B (en) Method, device, medium and electronic equipment for managing service discovery
CN112364268A (en) Resource acquisition method and device, electronic equipment and storage medium
CN112148497A (en) Disk resource management method and device and electronic equipment
CN111026571B (en) Processor down-conversion processing method and device and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant