CN112114971A - Task allocation method, device and equipment - Google Patents

Task allocation method, device and equipment Download PDF

Info

Publication number
CN112114971A
CN112114971A CN202011044681.3A CN202011044681A CN112114971A CN 112114971 A CN112114971 A CN 112114971A CN 202011044681 A CN202011044681 A CN 202011044681A CN 112114971 A CN112114971 A CN 112114971A
Authority
CN
China
Prior art keywords
task
processed
tasks
queue
processing time
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.)
Pending
Application number
CN202011044681.3A
Other languages
Chinese (zh)
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.)
China Construction Bank Corp
Original Assignee
China Construction Bank Corp
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 China Construction Bank Corp filed Critical China Construction Bank Corp
Priority to CN202011044681.3A priority Critical patent/CN112114971A/en
Publication of CN112114971A publication Critical patent/CN112114971A/en
Pending legal-status Critical Current

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/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
    • 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/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/54—Indexing scheme relating to G06F9/54
    • G06F2209/548—Queue

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The embodiment of the specification provides a task allocation method, a task allocation device and task allocation equipment. The method comprises the following steps: under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed; judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; if not, determining whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit; and under the condition that the task processing time is less than the task processing time limit, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment. The method determines whether to distribute the task to the distributed node equipment according to the actual task processing condition of each distributed node equipment, fully utilizes the processing capacity of each distributed node equipment, improves the utilization rate of the equipment and accelerates the task processing progress.

Description

Task allocation method, device and equipment
Technical Field
The embodiment of the specification relates to the technical field of computers, in particular to a task allocation method, a task allocation device and task allocation equipment.
Background
The distributed technology is based on a communication network, and a large computing task is divided into a plurality of subtasks and then distributed to each processing node in a distributed system for execution. Because each subtask is executed on each processing node simultaneously, the processing efficiency of the tasks is greatly improved. Based on the above characteristics, the distributed technology has been rapidly developed and utilized on a large scale in recent years.
In practical applications, in order to ensure that each processing node can be fully utilized, a central node in a distributed system generally allocates tasks to each processing node in sequence. Each processing node generally receives tasks in a queue form and sequentially processes the tasks in the queue in a serial processing mode. However, since the resources occupied by the processing tasks of the nodes and the processing capabilities of the nodes are different, when the number of the distributed tasks is large, the number of the tasks received by a part of the processing nodes may exceed the processing capabilities of the processing nodes, so that the tasks cannot be processed in time, and the processing efficiency of the tasks is reduced. Therefore, a technical solution with high task processing efficiency based on a distributed system is needed.
Disclosure of Invention
An object of the embodiments of the present specification is to provide a task allocation method, device and apparatus, so as to solve a problem how to improve task processing efficiency based on distributed node devices.
To solve the foregoing technical problem, an embodiment of the present specification provides a task allocation method, including:
under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed;
judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
if not, determining whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit;
and under the condition that the task processing time is less than the task processing time limit, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
An embodiment of this specification further provides a task allocation apparatus, including:
the task information acquisition module is used for acquiring the number of tasks to be processed and the information of the tasks to be processed corresponding to the task queue to be processed under the condition of receiving a task processing request sent by the central node device;
the task quantity judging module is used for judging whether the quantity of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
the task processing time determining module is used for determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is not equal to the limited length of the queue;
and the task receiving information feedback module is used for feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment when the task processing time is not more than the task processing time limit.
The embodiment of the present specification further provides a distributed node device, including a memory and a processor; the memory to store computer program instructions; the processor to execute the computer program instructions to implement the steps of: under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed; judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; if not, determining whether the task processing time corresponding to the to-be-processed task information is greater than the task processing time limit; and if not, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
In order to solve the above technical problem, an embodiment of the present specification further provides a task allocation method, including:
selecting distributed node equipment based on a task allocation sequence;
sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue or not, and determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is not equal to the limited length of the queue; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit;
and distributing tasks to the distributed node equipment.
An embodiment of this specification further provides a task allocation apparatus, including:
the distributed node equipment selection module is used for selecting distributed node equipment based on the task allocation sequence;
a task processing request sending module, configured to send a task processing request to the distributed node device, so that the distributed node device obtains the number of to-be-processed tasks and information of the to-be-processed tasks corresponding to the to-be-processed task queue, determines whether the number of the to-be-processed tasks is equal to the queue limit length, and determines whether task processing time corresponding to the to-be-processed task information is greater than task processing time limit when the number of the to-be-processed tasks is not equal to the queue limit length; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
the task receiving information receiving module is used for receiving the task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit;
and the task distribution module is used for distributing tasks to the distributed node equipment.
The embodiment of the present specification further provides a task allocation device, including a memory and a processor; the memory to store computer program instructions; the processor to execute the computer program instructions to implement the steps of: selecting distributed node equipment based on a task allocation sequence; sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue or not, and determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is not equal to the limited length of the queue; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit; and distributing tasks to the distributed node equipment.
As can be seen from the technical solutions provided by the embodiments of the present specification, when allocating tasks to distributed node devices, if the number of to-be-processed tasks of the distributed node devices is equal to the queue limit length of the to-be-processed task queue, the embodiments of the present specification may still determine, through the to-be-processed task information of the distributed node devices, whether the distributed node devices can continue to process the tasks, and allocate corresponding tasks to the distributed node devices when the tasks can continue to be processed. Therefore, the method determines whether to allocate the task to the distributed node equipment according to the actual task processing condition of each distributed node equipment, makes full use of the processing capacity of each distributed node equipment, improves the utilization rate of the equipment, and accelerates the task processing progress.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the specification, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a block diagram of a task allocation system according to an embodiment of the present disclosure;
FIG. 2 is a flowchart of a task allocation method according to an embodiment of the present disclosure;
FIG. 3 is a flowchart of a task allocation method according to an embodiment of the present disclosure;
FIG. 4 is a flowchart of a task allocation method according to an embodiment of the present disclosure;
FIG. 5 is a flowchart of a task allocation method according to an embodiment of the present disclosure;
FIG. 6 is a block diagram of a task assigning apparatus according to an embodiment of the present disclosure;
FIG. 7 is a block diagram of a task assigning apparatus according to an embodiment of the present disclosure;
fig. 8 is a structural diagram of a distributed node device according to an embodiment of the present disclosure;
fig. 9 is a structural diagram of a central node device according to an embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification without any creative effort shall fall within the protection scope of the present specification.
In order to better understand the inventive concept of the present application, a task allocation system of the embodiment of the present specification is first introduced. As shown in FIG. 1, the task distribution system 100 includes a central node device 110 and a plurality of distributed node devices.
The central node device 110 may communicate with various distributed node devices and assign pending tasks to the distributed node devices.
The task that the central node device 110 allocates to each distributed node device may be a task generated by the central node device 110, or a task that is sent by another server or a user terminal and received by the central node device 110. Accordingly, the central node device 110 may also be configured with a communication protocol with a plurality of external devices. In a case where the central node device 110 and each distributed node device together form a distributed system, each device in the distributed system may have a capability of communicating with an external device and acquiring a task, and then the received task is uniformly distributed through the central node device 110. In practical applications, the obtaining manner of the to-be-processed task is not limited to the above example, and is not described herein again.
The central node device 110 may be connected to a plurality of distributed node devices. As an example in fig. 1, five distributed node devices, namely, distributed node device 121, distributed node device 122, distributed node device 123, distributed node device 124, and distributed node device 125, are included. In practical application, the number of the distributed node devices is not limited, and may be any number greater than or equal to two.
The distributed node equipment has the capacity of processing tasks. The processed task may be, for example, completing a certain calculation task, or obtaining a processing result corresponding to a task to be processed based on internally set program logic, or the like. The specific processing task manner may be adjusted according to the actual application, and is not limited to the above example, and is not described herein again.
The distributed node equipment can adopt a single process to process the tasks, namely, after one task is processed, the next task is processed. The distributed node devices may also process tasks in a concurrent manner, i.e., multiple tasks are processed simultaneously over a period of time. In practical applications, the manner of processing the task by the distributed node device is not limited, and is not limited to the above example, which is not described herein again.
Since the speed of processing the task by the distributed node device may be less than the speed of distributing the task, the queue of the task to be processed may be correspondingly set by the distributed node device. The pending task queue may be configured to store an identifier corresponding to the pending task. The task queue to be processed has the attribute of the queue, namely 'first-in first-out', the task identifier firstly stored in the task queue to be processed is firstly taken out, and when the corresponding task identifier is taken out, the distributed node equipment starts to process the task to be processed corresponding to the task identifier. Correspondingly, after the task to be processed is distributed to the distributed node equipment, the distributed node equipment stores the identifier corresponding to the task to be processed to the tail of the task queue to be processed. And the distributed node equipment sequentially processes the tasks to be processed in the task queue to be processed.
Based on the task allocation system, a task allocation method according to an embodiment of the present specification is introduced. The execution main body of the task allocation method is the task allocation system. As shown in fig. 2, the task allocation method may include the following implementation steps.
S210: and the central node equipment selects the distributed node equipment based on the task allocation sequence.
The task allocation order may be an order in which the central node device allocates tasks in sequence. The task allocation order may be a loop, i.e. the allocation of tasks may be performed again in the task allocation order after the tasks are allocated in the task allocation order.
Correspondingly, when the tasks are distributed according to the task distribution sequence, the same number of tasks can be distributed to each distributed node device in each distribution process, so that the uniform distribution of the tasks is ensured.
The task allocation order may be a fixed task allocation order set in advance by the center node device. For example, based on the task allocation system in fig. 1, the task allocation sequence may be distributed node device 124, distributed node device 122, distributed node device 121, distributed node device 123, and distributed node device 125. In practical application, the task allocation sequence may be set according to specific situations, and is not described herein.
The central node device selects the distributed node device based on the task allocation sequence, which may be a next-ranked distributed node device in the current task allocation sequence in combination with the last selected distributed node device as the selected distributed node device.
S220: and the central node equipment sends a task processing request to the distributed node equipment.
After the central node device determines the distributed node devices, if an unassigned task currently exists, a task processing request may be sent to the distributed node devices.
The task processing request is used for requesting the distributed node equipment to process the unallocated task. Since it is not determined whether the distributed node device has the capability of processing the task, a task processing request may be sent to the distributed node device first, so that the distributed node device allocates the task to the device after determining that the task can be processed.
The task processing request is a request for requesting the distributed node equipment to process a task. After receiving the request, the distributed node device may determine whether to continue to receive the task to be processed, thereby determining whether the central node device needs to allocate the task to the distributed node device.
S230: the distributed node equipment acquires the number of the tasks to be processed and the information of the tasks to be processed corresponding to the task queue to be processed.
After the distributed node device obtains the task processing request, the number of the tasks to be processed and the information of the tasks to be processed in the corresponding task queue to be processed may be obtained first.
The number of the to-be-processed tasks may be the number of the to-be-processed task identifiers currently existing in the to-be-processed task queue, that is, the number of the tasks allocated to the distributed node device but not yet processed by the distributed node device.
The information of the to-be-processed task may be information corresponding to the to-be-processed task, and may be, for example, the number of tasks processed by the distributed node apparatus per unit time, which is determined based on the historical processing result, that is, the capability of the distributed node apparatus to process the tasks. The to-be-processed task information may also include a processing time limit of the to-be-processed task in the to-be-processed task queue, that is, the latest time required for processing the corresponding to-be-processed task. Whether the distributed node equipment can continue to receive and process the tasks can be determined through the task processing time limit, and therefore whether the tasks distributed by the central node equipment can be received can be determined.
In practical applications, the to-be-processed task information may also include other information that can be used to determine the processing capability of the distributed node device or determine whether the distributed node device can be used to receive a task, which is not limited to the above example and is not described herein again.
S240: and the distributed node equipment judges whether the number of the tasks to be processed is equal to the limited length of the queue.
After the distributed node device obtains the number of the tasks to be processed, it may first determine whether the number of the tasks to be processed is equal to the limited length of the queue.
The queue limit length is an upper limit of the number of tasks to be processed corresponding to the distributed processing device. Generally, when the number of the to-be-processed tasks in the to-be-processed task queue is equal to the limited length of the queue, the identifier of the new to-be-processed task may not be added to the to-be-processed task queue any more, that is, the new to-be-processed task of the distributed node device is not allocated any more.
By directly comparing the number of the tasks to be processed with the limited length of the queue, whether the distributed node equipment has the capacity of processing the tasks to be processed can be conveniently and quickly determined.
It should be noted that, in some embodiments, the queue definition lengths of different distributed node devices may be set to the same length initially according to requirements. The queue limit length in the initial state is often determined according to the requirement of processing tasks in practical application. Accordingly, the limited length of the queue may be adjusted according to the processing capabilities of different distributed node devices in the subsequent application process to adapt to the actual processing capabilities of different distributed node devices.
S250: if so, the distributed node equipment determines whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit.
And if the number of the tasks to be processed is equal to the limited length of the queue, new tasks cannot be continuously added into the queue of the tasks to be processed. However, in practical applications, the limited length of the queue may not accurately describe the processing capability of the distributed node device, and if it is determined whether to continue to allocate tasks to the distributed node device according to the limited length of the queue, a certain gap may exist between the limited length of the queue and the actual processing capability. Therefore, even if the number of the tasks to be processed is determined to be equal to the limited length of the queue, whether the task processing time corresponding to the information of the tasks to be processed is smaller than the task processing time limit can be determined again.
It should be noted that, when new tasks to be processed are added to the queue of tasks to be processed, the number of tasks to be processed and the number of limited lengths of the queue are required to be compared, and when the number of tasks to be processed is equal to the limited length of the queue, new tasks to be processed are not added to the queue of tasks to be processed, that is, the number of tasks to be processed in the queue of tasks to be processed is not greater than the limited length of the queue. Therefore, when the number of the to-be-processed tasks is not equal to the queue limit length, the number of the to-be-processed tasks is smaller than the queue limit length.
The task processing time limit may be processing time of the to-be-processed task in the to-be-processed task queue corresponding to the distributed node. The task processing time may be time consumed by the distributed node device to process the to-be-processed task in the to-be-processed task queue.
In some embodiments, the task processing time may be determined by determining task processing capacity of the distributed node device based on the task processing information, and then determining task processing time according to the task processing capacity and the number of tasks to be processed. Wherein the task processing capability may be a maximum number of tasks that the distributed node device can process in a unit time. The task processing capability may be determined based on a historical processing record of the distributed node device, thereby determining a time consumed by the distributed node device to process all tasks in the pending task queue.
In some embodiments, the task processing time may also be determined based on a minimum time for the distributed node device to process a task. For example, the minimum time consumed by the distributed node device for processing each task is obtained from the historical processing record of the distributed node device, and the time is used as the time reference for the distributed node device to process the tasks, so that the task processing time is determined based on the time and the number of the tasks to be processed.
In practical applications, the manner for determining the task processing time may be set according to practical situations, and is not limited to the above example, and is not described herein again.
In some embodiments, if the number of the to-be-processed tasks is equal to the limited length of the queue, it may be directly determined that a new to-be-processed task cannot be allocated to the distributed node device at present, and task rejection information may be directly fed back to the central node device, so that the central node device cancels the allocation of the task.
And after receiving the task rejection information, the central node equipment does not distribute new tasks to be processed to the distributed node equipment. Correspondingly, under the condition that the distributed node equipment cannot receive a new task to be processed, the central node can obtain the next distributed node equipment based on the task allocation sequence and send a task processing request to the distributed node equipment, so that the task allocation system sequentially completes the allocation of the tasks.
S260: if the number of the received tasks is smaller than the preset value, the distributed node equipment feeds back task receiving information to the central node equipment.
If the task processing time is less than the task processing time limit, it indicates that the distributed node device can completely complete the task in the current task queue to be processed within the predetermined time limit, that is, the distributed node device has the full capability of re-receiving a new task. Therefore, the task acceptance information can be fed back to the central node device.
The task acceptance information is used for indicating that the distributed node equipment can accept the corresponding task again. After receiving the task receiving information, the central node device may allocate the task to be allocated to the distributed node device.
In some embodiments, the queue limit length may be increased because the number of pending tasks defined by the queue limit length does not match the actual task processing time, i.e. the queue limit length may not accurately represent the processing capacity of the distributed node device. Specifically, the queue limit length may be increased by one. In practical application, the limited length of the queue may be increased by other amounts according to application requirements, which is not limited to this.
S270: and the central node equipment distributes tasks to the distributed node equipment.
After receiving the task acceptance information, the central node device may assign a corresponding task to the distributed node device. The specific task content may be set based on the requirement of the actual application, for example, the to-be-processed service may be directly sent to the distributed node device, so that the distributed node device processes the service and obtains a processing result, and then the processing result is fed back to the central node device or the user terminal device. The specific processes of allocating tasks and processing tasks may be set according to the actual application situation, and are not limited to the above example, and are not described herein again.
In practical application, besides the cases that the number of the tasks to be processed is not equal to the queue limit length and the task processing time is less than the task processing time limit in the above embodiments, cases that the number of the tasks to be processed is equal to the queue limit length or the task processing time is not less than the task processing time limit may also occur. Therefore, in order to more fully and specifically describe the above situation, another task allocation method according to an embodiment of the present disclosure is described below, where an execution subject of the method is the distributed node device. As shown in fig. 3, the task allocation method may include the following implementation steps.
S310: and under the condition of receiving a task processing request sent by the central node equipment, acquiring the number of tasks to be processed and the information of the tasks to be processed corresponding to the task queue to be processed.
For the description of this step, reference may be made to the descriptions in steps S210, S220, and S230, which are not described herein again.
S320: and judging whether the number of the tasks to be processed is equal to the limited length of the queue or not.
For the specific description of this step, reference may be made to the specific description in step S240, and details are not described here.
After the above determining process is performed, if the number of the to-be-processed tasks is equal to the limited length of the queue as a result of the determining, step S330 may be performed; if the number of pending tasks is not equal to the queue bound length, step S360 may be performed.
S330: and judging whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit.
For the detailed description of this step, reference may be made to the description of step S250, which is not described herein again.
After the above determination process is executed, if the determination result is that the task processing time is less than the task processing time limit, step S340 may be executed; if the determination result is that the task processing time is not less than the task processing time limit, step S350 may be executed.
S340: and feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
For the description of this step, reference may be made to the description in step S260, and details are not repeated here.
S350: and feeding back task rejection information to the central node equipment so that the central node equipment cancels the distribution of the tasks.
For the description of this step, reference may be made to the description in step S250, and details are not repeated here.
S360: and judging whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit.
If the number of the tasks to be processed is not equal to the limited length of the queue after the judgment process, the capacity of adding new tasks to be processed into the task queue to be processed is still provided. In this case, since the number of the tasks to be processed is smaller than the queue limit length, which indicates that the distributed node device still has the capability of processing the tasks, in some embodiments, the task acceptance information may be directly fed back to enable the central node device to allocate the corresponding tasks to the distributed node device.
However, correspondingly, the queue limit length may not be able to accurately evaluate the actual processing capability of the distributed node device, that is, when the number of the tasks to be processed in the task queue to be processed is smaller than the queue limit length, it may be further determined whether the corresponding task may be further allocated to the distributed node device.
Specifically, after it is determined that the number of the to-be-processed tasks is not equal to the limited length of the queue, it may still be determined again whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit, so as to determine whether the limited length of the current queue exceeds the processing capability of the distributed node device.
After the above determination process is performed, if the determination result is that the task processing time is less than the task processing time limit, step S370 may be performed; if the determination result is that the task processing time is not less than the task processing time limit, step S380 may be executed.
S370: and feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
If the task processing time is less than the task processing time limit, it indicates that the distributed node device is completely capable of processing the corresponding task at present, and no condition exists that the limited length of the current queue exceeds the processing capacity of the distributed node device, and task receiving information can be fed back to the central node device to obtain the task allocated by the central node device.
For a specific process of feeding back the task acceptance information to obtain the task allocated by the central node device, reference may be made to the descriptions in steps S260 and S270, which are not described herein again.
S380: and feeding back task rejection information to the central node equipment and reducing the limited length of the queue.
If the task processing time is not less than the task processing time limit, even if the number of tasks in the to-be-processed task queue is less than the queue limit length, the distributed node device processes the to-be-processed tasks and fully utilizes the performance of the device, and the currently set queue limit length exceeds the processing capacity of the distributed node device. Thus, task rejection information may be fed back to the central node apparatus to cause the central node apparatus to cancel the assignment of tasks. For specific descriptions of the task rejection information and the task assignment cancellation, reference may be made to the description in step S250, and details are not described here.
Accordingly, the queue bound length may also be reduced in the event that the queue bound length has exceeded the processing capacity of the distributed node device. Specifically, the queue limit length may be set to the current number of the tasks to be processed, so that the queue of the tasks to be processed conforms to the actual processing capacity of the distributed node device. In practical applications, the setting of the limited length of the queue may be adjusted based on requirements of practical applications, and is not limited to the above example, and is not described herein again.
Through the introduction of the embodiment of the task allocation method, it can be seen that, when allocating tasks to distributed node devices, if the number of to-be-processed tasks of the distributed node devices is equal to the queue limit length of the to-be-processed task queue, the method can still determine whether the distributed node devices can continue to process the tasks according to the to-be-processed task information of the distributed node devices, and allocate corresponding tasks to the distributed node devices when the tasks can continue to be processed. Therefore, the method determines whether to allocate the task to the distributed node equipment according to the actual task processing condition of each distributed node equipment, makes full use of the processing capacity of each distributed node equipment, improves the utilization rate of the equipment, and accelerates the task processing progress.
Based on the task allocation method corresponding to fig. 2, another task allocation method according to the embodiment of the present disclosure is described. The execution subject of the task allocation method is the distributed node equipment. As shown in fig. 4, the task allocation method may include the following implementation steps.
S410: and under the condition of receiving a task processing request sent by the central node equipment, acquiring the number of tasks to be processed and the information of the tasks to be processed corresponding to the task queue to be processed.
For the detailed description of this step, reference may be made to the descriptions in steps S210, S220, and S230, which are not described herein again.
S420: judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used to determine an upper limit on the number of tasks to be processed.
For the detailed description of this step, reference may be made to the description in step S240, which is not described herein again.
S430: and if not, determining whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit.
For the detailed description of this step, reference may be made to the description in step S250, and details are not repeated here.
S440: and under the condition that the task processing time is less than the task processing time limit, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
For the detailed description of this step, reference may be made to the descriptions in steps S260 and S270, and details are not repeated here.
Based on the task allocation method corresponding to fig. 2, another task allocation method according to the embodiment of the present disclosure is described. The execution subject of the task allocation method is the central node device. As shown in fig. 5, the task allocation method may include the following implementation steps.
S510: and selecting distributed node equipment based on the task allocation sequence.
For the detailed description of this step, reference may be made to the description in step S210, and details are not repeated here.
S520: sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue or not, and determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is not equal to the limited length of the queue; the queue limit length is used to determine an upper limit on the number of tasks to be processed.
For the detailed description of this step, reference may be made to the descriptions in steps S220, S230, S240, and S250, which are not described herein again.
S530: and receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the to-be-processed task information of the distributed node equipment is not more than the task processing time limit.
For the detailed description of this step, reference may be made to the description in step S260, and details are not described here.
S540: and distributing tasks to the distributed node equipment.
For the detailed description of this step, reference may be made to the description in step S270, and details are not repeated here.
A task allocation apparatus according to an embodiment of the present disclosure is introduced based on a task allocation method corresponding to fig. 4. The task allocation device is arranged on the distributed node equipment. As shown in fig. 6, the task assigning apparatus includes the following modules.
A task information obtaining module 610, configured to obtain the number of to-be-processed tasks and information of to-be-processed tasks corresponding to the to-be-processed task queue under the condition that a task processing request sent by the central node device is received;
a task number judging module 620, configured to judge whether the number of tasks to be processed is equal to the queue limit length; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
a task processing time determining module 630, configured to determine whether a task processing time corresponding to the to-be-processed task information is greater than a task processing time limit when the number of to-be-processed tasks is not equal to the queue limited length;
and a task acceptance information feedback module 640, configured to feed back task acceptance information to the central node device to obtain the task allocated by the central node device when the task processing time is not greater than the task processing time limit.
A task allocation apparatus according to an embodiment of the present disclosure is introduced based on the task allocation method corresponding to fig. 5. The task allocation device is arranged on the central node equipment. As shown in fig. 7, the task assigning apparatus includes the following modules.
A distributed node device selection module 710, configured to select a distributed node device based on a task allocation sequence;
a task processing request sending module 720, configured to send a task processing request to the distributed node device, so that the distributed node device obtains the number of to-be-processed tasks and the to-be-processed task information corresponding to the to-be-processed task queue, determines whether the number of to-be-processed tasks is equal to the queue limit length, and determines whether task processing time corresponding to the to-be-processed task information is greater than task processing time limit when the number of to-be-processed tasks is not equal to the queue limit length; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
a task acceptance information receiving module 730, configured to receive task acceptance information fed back by the distributed node device when task processing time corresponding to the to-be-processed task information of the distributed node device is not greater than a task processing time limit;
and a task allocation module 740, configured to allocate a task to the distributed node device.
Based on the task allocation method corresponding to fig. 4, an embodiment of the present specification provides a distributed node device. As shown in fig. 8, the distributed node device may include a memory and a processor.
In this embodiment, the memory may be implemented in any suitable manner. For example, the memory may be a read-only memory, a mechanical hard disk, a solid state disk, a U disk, or the like. The memory may be used to store computer program instructions.
In this embodiment, the processor may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or processor and a computer-readable medium that stores computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, an embedded microcontroller, and so forth. The processor may execute the computer program instructions to perform the steps of: under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed; judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; if not, determining whether the task processing time corresponding to the to-be-processed task information is greater than the task processing time limit; and if not, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
Based on the task allocation method corresponding to fig. 5, an embodiment of the present specification provides a central node device. As shown in fig. 9, the distributed node device may include a memory and a processor.
In this embodiment, the memory may be implemented in any suitable manner. For example, the memory may be a read-only memory, a mechanical hard disk, a solid state disk, a U disk, or the like. The memory may be used to store computer program instructions.
In this embodiment, the processor may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or processor and a computer-readable medium that stores computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, an embedded microcontroller, and so forth. The processor may execute the computer program instructions to perform the steps of: selecting distributed node equipment based on a task allocation sequence; sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue or not, and determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is not equal to the limited length of the queue; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit; and distributing tasks to the distributed node equipment.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
From the above description of the embodiments, it is clear to those skilled in the art that the present specification can be implemented by software plus the necessary first hardware platform. Based on such understanding, the technical solutions of the present specification may be essentially or partially implemented in the form of software products, which may be stored in a storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and include instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments of the present specification.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The description is operational with numerous first or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
While the specification has been described with examples, those skilled in the art will appreciate that there are numerous variations and permutations of the specification that do not depart from the spirit of the specification, and it is intended that the appended claims include such variations and modifications that do not depart from the spirit of the specification.

Claims (16)

1. A task allocation method, comprising:
under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed;
judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
if so, determining whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit;
and under the condition that the task processing time is less than the task processing time limit, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
2. The method of claim 1, wherein after determining whether the number of pending tasks exceeds the queue bound length, further comprising:
and if not, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
3. The method of claim 1, wherein before feeding back the task acceptance information to the central node device to obtain the task assigned by the central node device, the method further comprises:
increasing the queue bound length.
4. The method of claim 1, wherein said determining whether the number of pending tasks is equal to a queue bound length comprises:
and if so, feeding back task rejection information to the central node equipment so as to enable the central node equipment to cancel the distribution of the tasks.
5. The method of claim 1, wherein the determining whether the task processing time corresponding to the to-be-processed task information is greater than a task processing time limit comprises:
determining a task processing capability based on the task processing information;
determining task processing time according to the task processing capacity and the number of the tasks to be processed;
and judging whether the task processing time is greater than the task processing time limit.
6. The method of claim 1, wherein after determining whether the number of pending tasks is equal to a queue bound length, further comprising:
if not, determining whether the task processing time corresponding to the to-be-processed task information is less than the task processing time limit;
and if not, feeding back task rejection information to the central node equipment so as to enable the central node equipment to cancel the distribution of the tasks.
7. The method according to claim 6, wherein after determining whether the task processing time corresponding to the to-be-processed task information is greater than the task processing time limit, the method further comprises:
and adjusting the queue limit length corresponding to the queue of the tasks to be processed into the number of the tasks to be processed.
8. A task assigning apparatus, comprising:
the task information acquisition module is used for acquiring the number of tasks to be processed and the information of the tasks to be processed corresponding to the task queue to be processed under the condition of receiving a task processing request sent by the central node device;
the task quantity judging module is used for judging whether the quantity of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
the task processing time determining module is used for determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit or not when the number of the tasks to be processed is equal to the limited length of the queue;
and the task receiving information feedback module is used for feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment when the task processing time is not more than the task processing time limit.
9. A distributed node device comprising a memory and a processor;
the memory to store computer program instructions;
the processor to execute the computer program instructions to implement the steps of: under the condition of receiving a task processing request sent by central node equipment, acquiring the number of tasks to be processed and information of the tasks to be processed, wherein the number of the tasks to be processed corresponds to a task queue to be processed; judging whether the number of the tasks to be processed is equal to the limited length of the queue or not; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; if so, determining whether the task processing time corresponding to the to-be-processed task information is greater than the task processing time limit; and if not, feeding back task receiving information to the central node equipment to acquire the tasks distributed by the central node equipment.
10. A task allocation method, comprising:
selecting distributed node equipment based on a task allocation sequence;
sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue, and determining whether the task processing time corresponding to the information of the tasks to be processed is not less than the task processing time limit when the number of the tasks to be processed is equal to the limited length of the queue; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit;
and distributing tasks to the distributed node equipment.
11. The method of claim 10, wherein the task allocation order corresponds to at least two processing nodes; the at least two processing nodes have the same initial queue bound length.
12. The method of claim 10, wherein after sending the task processing request to the distributed node device, further comprising:
and receiving task rejection information fed back by the distributed node equipment under the condition that the task processing time corresponding to the to-be-processed task information of the distributed node equipment is not less than the task processing time limit.
13. The method of claim 10, wherein after sending the task processing request to the distributed node device, further comprising:
and receiving task rejection information fed back by the distributed node equipment under the condition that the number of the tasks to be processed of the distributed node equipment is equal to the limited length of the queue.
14. The method according to claim 12 or 13, wherein after receiving the task rejection information fed back by the distributed node device, the method further comprises:
and selecting other distributed node equipment to distribute tasks based on the task distribution sequence.
15. A task assigning apparatus, comprising:
the distributed node equipment selection module is used for selecting distributed node equipment based on the task allocation sequence;
a task processing request sending module, configured to send a task processing request to the distributed node device, so that the distributed node device obtains the number of to-be-processed tasks and the to-be-processed task information corresponding to the to-be-processed task queue, determines whether the number of to-be-processed tasks is equal to the queue limit length, and determines whether task processing time corresponding to the to-be-processed task information is greater than task processing time limit when the number of to-be-processed tasks is equal to the queue limit length; the queue limit length is used for determining the upper limit of the number of the tasks to be processed;
the task receiving information receiving module is used for receiving the task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit;
and the task distribution module is used for distributing tasks to the distributed node equipment.
16. A task allocation apparatus comprising a memory and a processor;
the memory to store computer program instructions;
the processor to execute the computer program instructions to implement the steps of: selecting distributed node equipment based on a task allocation sequence; sending a task processing request to the distributed node equipment so that the distributed node equipment obtains the number of tasks to be processed and the information of the tasks to be processed corresponding to the queue of the tasks to be processed, judging whether the number of the tasks to be processed is equal to the limited length of the queue, and determining whether the task processing time corresponding to the information of the tasks to be processed is greater than the task processing time limit when the number of the tasks to be processed is equal to the limited length of the queue; the queue limit length is used for determining the upper limit of the number of the tasks to be processed; receiving task receiving information fed back by the distributed node equipment under the condition that the task processing time corresponding to the task information to be processed of the distributed node equipment is not more than the task processing time limit; and distributing tasks to the distributed node equipment.
CN202011044681.3A 2020-09-28 2020-09-28 Task allocation method, device and equipment Pending CN112114971A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011044681.3A CN112114971A (en) 2020-09-28 2020-09-28 Task allocation method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011044681.3A CN112114971A (en) 2020-09-28 2020-09-28 Task allocation method, device and equipment

Publications (1)

Publication Number Publication Date
CN112114971A true CN112114971A (en) 2020-12-22

Family

ID=73797929

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011044681.3A Pending CN112114971A (en) 2020-09-28 2020-09-28 Task allocation method, device and equipment

Country Status (1)

Country Link
CN (1) CN112114971A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112817724A (en) * 2021-02-05 2021-05-18 苏州互方得信息科技有限公司 Task allocation method capable of dynamically arranging sequence

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080148280A1 (en) * 2006-12-13 2008-06-19 Stillwell Joseph W Apparatus, system, and method for autonomically managing multiple queues
CN101562565A (en) * 2009-05-25 2009-10-21 马福奎 Dynamic queue resource management strategy and virtual queuing method
JP2014197340A (en) * 2013-03-29 2014-10-16 富士ゼロックス株式会社 Distributed processing system and program
US20140331233A1 (en) * 2013-05-06 2014-11-06 Abbyy Infopoisk Llc Task distribution method and system
CN104731647A (en) * 2015-03-31 2015-06-24 北京奇艺世纪科技有限公司 Task processing method and system
CN105335219A (en) * 2014-07-08 2016-02-17 阿里巴巴集团控股有限公司 Distribution-based task scheduling method and system
US20160266930A1 (en) * 2015-03-11 2016-09-15 Accenture Global Services Limited Queuing tasks in a computer system
CN107315627A (en) * 2017-05-31 2017-11-03 北京京东尚科信息技术有限公司 A kind of method and apparatus of automatic configuration data warehouse parallel task queue
CN109101325A (en) * 2017-06-21 2018-12-28 杭州海康威视数字技术股份有限公司 A kind of method for scheduling task, device, system and electronic equipment
US20190108069A1 (en) * 2016-09-30 2019-04-11 Tencent Technology (Shenzhen) Company Limited Distributed resource allocation method, allocation node, and access node
CN109710407A (en) * 2018-12-21 2019-05-03 浪潮电子信息产业股份有限公司 Distributed system real-time task scheduling method, device, equipment and storage medium
CN110781145A (en) * 2019-10-25 2020-02-11 浪潮电子信息产业股份有限公司 File system task scheduling method, device, equipment and readable storage medium
CN111198767A (en) * 2020-01-07 2020-05-26 平安科技（深圳）有限公司 Big data resource processing method and device, terminal and storage medium

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080148280A1 (en) * 2006-12-13 2008-06-19 Stillwell Joseph W Apparatus, system, and method for autonomically managing multiple queues
CN101562565A (en) * 2009-05-25 2009-10-21 马福奎 Dynamic queue resource management strategy and virtual queuing method
JP2014197340A (en) * 2013-03-29 2014-10-16 富士ゼロックス株式会社 Distributed processing system and program
US20140331233A1 (en) * 2013-05-06 2014-11-06 Abbyy Infopoisk Llc Task distribution method and system
CN105335219A (en) * 2014-07-08 2016-02-17 阿里巴巴集团控股有限公司 Distribution-based task scheduling method and system
US20160266930A1 (en) * 2015-03-11 2016-09-15 Accenture Global Services Limited Queuing tasks in a computer system
CN104731647A (en) * 2015-03-31 2015-06-24 北京奇艺世纪科技有限公司 Task processing method and system
US20190108069A1 (en) * 2016-09-30 2019-04-11 Tencent Technology (Shenzhen) Company Limited Distributed resource allocation method, allocation node, and access node
CN107315627A (en) * 2017-05-31 2017-11-03 北京京东尚科信息技术有限公司 A kind of method and apparatus of automatic configuration data warehouse parallel task queue
CN109101325A (en) * 2017-06-21 2018-12-28 杭州海康威视数字技术股份有限公司 A kind of method for scheduling task, device, system and electronic equipment
CN109710407A (en) * 2018-12-21 2019-05-03 浪潮电子信息产业股份有限公司 Distributed system real-time task scheduling method, device, equipment and storage medium
CN110781145A (en) * 2019-10-25 2020-02-11 浪潮电子信息产业股份有限公司 File system task scheduling method, device, equipment and readable storage medium
CN111198767A (en) * 2020-01-07 2020-05-26 平安科技（深圳）有限公司 Big data resource processing method and device, terminal and storage medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112817724A (en) * 2021-02-05 2021-05-18 苏州互方得信息科技有限公司 Task allocation method capable of dynamically arranging sequence

Similar Documents

Publication Publication Date Title
CN105511954B (en) Message processing method and device
CN109697122B (en) Task processing method, device and computer storage medium
CN105183565A (en) Computer and service quality control method and device
CN107832143B (en) Method and device for processing physical machine resources
WO2017185285A1 (en) Method and device for assigning graphics processing unit task
CN116302617B (en) Method for sharing memory, communication method, embedded system and electronic equipment
WO2021159831A1 (en) Programming platform user code running method, platform, node, device and medium
CN109788325B (en) Video task allocation method and server
CN115167996A (en) Scheduling method and device, chip, electronic equipment and storage medium
CN114816738A (en) Method, device and equipment for determining calculation force node and computer readable storage medium
CN114155026A (en) Resource allocation method, device, server and storage medium
JP7506096B2 (en) Dynamic allocation of computing resources
CN115002046A (en) Message processing method, NUMA node, electronic device and storage medium
CN115237589A (en) SR-IOV-based virtualization method, device and equipment
CN103823712A (en) Data flow processing method and device for multi-CPU virtual machine system
CN112114971A (en) Task allocation method, device and equipment
CN107634978B (en) Resource scheduling method and device
CN114629960A (en) Resource scheduling method, device, system, device, medium, and program product
CN111857992B (en) Method and device for allocating linear resources in Radosgw module
CN113407357B (en) Method and device for inter-process data movement
CN107045452B (en) Virtual machine scheduling method and device
CN111858035A (en) FPGA equipment allocation method, device, equipment and storage medium
CN112486638A (en) Method, apparatus, device and storage medium for executing processing task
CN112099956A (en) Resource allocation method, device and equipment
CN114675954A (en) Task scheduling method and device

Legal Events

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