CN115794342A - Method and device for estimating remaining time of pipeline task and electronic equipment - Google Patents
Method and device for estimating remaining time of pipeline task and electronic equipment Download PDFInfo
- Publication number
- CN115794342A CN115794342A CN202211466585.7A CN202211466585A CN115794342A CN 115794342 A CN115794342 A CN 115794342A CN 202211466585 A CN202211466585 A CN 202211466585A CN 115794342 A CN115794342 A CN 115794342A
- Authority
- CN
- China
- Prior art keywords
- task
- time
- queue
- target
- remaining 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
Links
Images
Classifications
-
- 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
Abstract
The embodiment of the application provides a method and a device for estimating the remaining time of a pipeline task and electronic equipment, and relates to the technical field of computers. The method comprises the following steps: in the process of executing the target task based on the pipeline model, acquiring the quantity of subtasks in each queue at the target moment; acquiring the task processing speed of a processor group corresponding to each queue, wherein the task processing speed is used for indicating the time required by one processor group to process one subtask; and calculating to obtain the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed. In this way, the remaining time of a task processed using the pipeline model can be estimated.
Description
Technical Field
The application relates to the technical field of computers, in particular to a method and a device for estimating remaining time of a pipeline task and electronic equipment.
Background
At present, more tasks are processed based on a pipeline model. As shown in fig. 1, the pipeline model is composed of a Task generator (Task), N processor groups (Process) and their corresponding N queues (Queue) and a result collection Database (Database). Task can split a Task into many sub-tasks at smaller levels, which are processed sequentially by any one of the processors in each processor group and finally placed into Database. There are of course some subtasks, which may be ended earlier and put into Database directly according to the processing result of the previous processor. When all subtasks of a task enter Database, the task is considered complete. There is currently no way to estimate the time remaining for a task to be processed using a pipeline model.
Disclosure of Invention
The embodiment of the application provides a method and a device for estimating the residual time of a pipeline task, an electronic device and a readable storage medium, which can estimate the residual time of the task processed by using a pipeline model.
The embodiment of the application can be realized as follows:
in a first aspect, an embodiment of the present application provides a method for estimating a remaining time of a pipeline task, where the method includes:
in the process of executing the target task based on the pipeline model, acquiring the number of subtasks in each queue at the target moment;
acquiring the task processing speed of the processor group corresponding to each queue, wherein the task processing speed is used for indicating the time required by one processor group to process one subtask;
and calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed.
In a second aspect, an embodiment of the present application provides a device for estimating remaining time of a pipeline task, where the device includes:
the quantity obtaining module is used for obtaining the quantity of the subtasks in each queue at the target moment in the process of executing the target task based on the pipeline model;
a speed obtaining module, configured to obtain a task processing speed of a processor group corresponding to each queue, where the task processing speed is used to indicate time required for processing one sub-task by one processor group;
and the processing module is used for calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a processor and a memory, where the memory stores machine executable instructions that can be executed by the processor, and the processor can execute the machine executable instructions to implement the pipeline task remaining time estimation method described in the foregoing embodiment.
In a fourth aspect, the present application provides a readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for estimating remaining time of pipeline task according to the foregoing embodiments.
According to the method, the device, the electronic equipment and the readable storage medium for estimating the remaining time of the pipeline task, the number of the subtasks in each queue at a target moment is obtained in the process of executing the target task based on the pipeline model, the task processing speed of the processor group corresponding to each queue is obtained, and the task processing speed is used for representing the time required by one processor group to process one subtask; and calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed. In this way, the remaining time of a task processed using the pipeline model can be estimated.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a schematic diagram of a pipeline model;
fig. 2 is a block diagram of an electronic device according to an embodiment of the present disclosure;
FIG. 3 is a schematic flowchart of a method for estimating remaining time of pipeline task according to an embodiment of the present disclosure;
FIG. 4 is a flowchart illustrating the sub-steps included in step S120 of FIG. 3;
FIG. 5 is a flowchart illustrating the sub-steps included in step S130 of FIG. 3;
fig. 6 is a block diagram illustrating a pipelined task remaining time estimation apparatus according to an embodiment of the present disclosure.
Icon: 100-an electronic device; 110-a memory; 120-a processor; 130-a communication unit; 200-pipeline task remaining time estimation means; 210-a quantity acquisition module; 220-a speed acquisition module; 230-processing module.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
It is noted that relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of additional like elements in a process, method, article, or apparatus that comprises the element.
As shown in fig. 1, the pipeline model consists of a Task generator (Task), N processor groups (Process) and their corresponding N queues (Queue) and a result collection Database (Database). The Task can be split into many sub-tasks of smaller level, and these sub-tasks are processed by any processor in each processor group in sequence and finally put into Database. There are, of course, some subtasks, which may be finished in advance according to the processing result of the previous processor, and are directly put into the Database. When all the subtasks of a task enter the Database, the task is considered to be completed.
Wherein, each processor group comprises a plurality of same processors for improving the processing effect of the task. The processor is equivalent to a consumer of data, and is equivalent to a process when executed on a device, unlike a Central Processing Unit (CPU). The processor in one processor group monitors one task queue at the same time, obtains the subtasks in the task queue and processes the subtasks, and then puts the result into the next-level queue (namely the queue corresponding to the next-level processor group), or directly stores the result into the Database according to the task execution state.
For example, assuming that Process1 in FIG. 1 has 10 instances, it can consume 10 subtasks in Queue1 at the same time. The order relationship between different processors. For example, a sub-task must first be processed by any one instance of the processor Process1 before being circulated to Queue2 for the instance of Process2 to take processing. Of course, it is also possible that after a certain instance of the Process1 finishes processing the sub-task, the processed result is directly sent to the database.
The task processing of the pipeline model is not linear and is not performed linearly. The processing time and the result of each subtask are different due to the influence of various external internal environments during the task processing. For example, when some subtasks are executed, data needs to be acquired from an external network, and the influence of the network environment can cause different time consumption for data acquisition, thereby causing different processing time of the subtasks; if some subtasks cannot acquire the extranet data, the processing result does not meet the condition of pushing the next-level queue, and the processing result is directly stored in the database. Even the same subtask may have different processing times and processing results at different times. And thus the task completion time cannot be known.
In view of the foregoing, embodiments of the present application provide a method and an apparatus for estimating remaining time of pipeline task, an electronic device, and a readable storage medium, which can estimate the remaining time of a task processed by using a pipeline model, and the accuracy of the estimated remaining time is higher and higher as the task is executed.
Some embodiments of the present application will be described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Referring to fig. 2, fig. 2 is a block diagram of an electronic device 100 according to an embodiment of the present disclosure. The electronic device 100 may be, but is not limited to, a computer, a server, etc. The electronic device 100 may include a memory 110, a processor 120, and a communication unit 130. The elements of the memory 110, the processor 120 and the communication unit 130 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines.
The memory 110 is used to store programs or data. The Memory 110 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.
The processor 120 is used to read/write data or programs stored in the memory 110 and perform corresponding functions. For example, the memory 110 stores the pipeline task remaining time estimation apparatus 200, and the pipeline task remaining time estimation apparatus 200 includes at least one software functional module which can be stored in the memory 110 in the form of software or firmware (firmware). The processor 120 executes various functional applications and data processing by running software programs and modules stored in the memory 110, such as the pipeline task remaining time estimation apparatus 200 in the embodiment of the present application, that is, implements the pipeline task remaining time estimation method in the embodiment of the present application.
The communication unit 130 is used to establish a communication connection between the electronic apparatus 100 and another communication terminal through a network, and to transceive data through the network.
It should be understood that the structure shown in fig. 2 is only a schematic structural diagram of the electronic device 100, and the electronic device 100 may also include more or fewer components than shown in fig. 2, or have a different configuration than shown in fig. 2. The components shown in fig. 2 may be implemented in hardware, software, or a combination thereof.
Referring to fig. 3, fig. 3 is a flowchart illustrating a method for estimating remaining time of pipeline task according to an embodiment of the present application. The method may be applied to the electronic device 100 described above. The following describes a specific flow of the pipeline task remaining time estimation method in detail. In this embodiment, the method may include steps S110 to S130.
Step S110, in the process of executing the target task based on the pipeline model, the number of subtasks in each queue at the target moment is obtained.
In this embodiment, the target task is a task that needs to analyze the remaining time of the target task, and the target task is processed based on the pipeline model. The target time is the time required to estimate the remaining time, namely the target time is the starting point of the remaining time, and the estimated task completion time is the end point of the remaining time. Typically, the target time is a current time at which the estimation of the remaining time is required.
As can be seen from the foregoing description, one processor group corresponds to one queue, and the queue stores the sub-tasks that need to be processed by the processors in the corresponding processor group. And when the residual time estimation is needed, acquiring the number of the subtasks in each queue at the target moment. It can be understood that, at this time, the subtasks into which the target task is split have all been pushed to the first-level Queue1. And the number of the subtasks in each queue at the target time is the remaining task amount of the queue at the target time.
Step S120, obtaining the task processing speed of the processor group corresponding to each queue.
Step S130, calculating the remaining time of the target task at the target moment according to the sub-task quantity and the task processing speed corresponding to each queue.
Wherein the task processing speed is used to represent the time required for a processor group to process a sub-task. Step S120 and step S110 may be executed simultaneously, or one step may be executed first and the other step is executed later, and the specific execution order may be determined by combining actual requirements. Under the condition of obtaining the subtask data and the task processing speed of each queue, the remaining time of the target task can be obtained through analysis. In this way, the remaining time of a task processed using the pipeline model can be estimated.
Referring to fig. 4, fig. 4 is a flowchart illustrating sub-steps included in step S120 in fig. 3. In the present embodiment, step S120 may include substeps S121 through substep S123.
And a substep S121, obtaining processing durations corresponding to the preset number of subtasks processed by each processor in the processor group before the target time.
In this embodiment, for each processor, a processing time duration corresponding to each of the preset number of sub-tasks that each processor has already processed and completed at the target time may be obtained. The smaller the preset number is, the more the current processing efficiency can be reflected; the smaller the preset number is, the more stable the obtained data is, but the earlier emergency situation cannot be responded to in time. The specific value of the preset number may be determined in combination with actual requirements. Optionally, the processing time duration corresponding to each of the plurality of subtasks closest to the target time may be selected for calculating the task processing speed.
And a substep S122, calculating the task processing speed of the processor group according to the preset number of processing time lengths corresponding to each processor.
In the case where the preset number of processing time periods processed by each processor in the processor group is obtained, the mode thereof may be selected as the initial speed of the processor group. Or, taking an average value of the preset number of processing time durations processed by the processors as the initial speed. It is to be understood that the above description is by way of example only and may be specifically determined in connection with actual requirements, and that no specific determination is made herein.
In the case where the initial speed is obtained, the initial speed may be directly used as the task processing speed of the processor group. Or adjusting the initial speed according to a preset adjustment rule set in advance, and taking an adjustment result as the task processing speed of the processor group. The preset adjustment rule may be determined in combination with actual requirements. For example, an adjustment ratio may be set, and the product of the initial speed and the adjustment ratio may be used as the task processing speed.
It should be noted that the preset number used for obtaining the task processing speed at different times may be the same or different, and may be determined specifically by combining actual requirements. For example, when the task processing speed is obtained at time 1, the number input by the user is taken as the preset number; and when the task processing speed is obtained at the moment 2, taking the number newly input by the user as the preset number. The same numerical value may be used as the preset number each time the task processing speed is obtained.
Referring to fig. 5, fig. 5 is a flowchart illustrating sub-steps included in step S130 in fig. 3. In the present embodiment, step S130 may include substeps S131 through substep S133.
And a substep S131, calculating to obtain a first time length corresponding to each queue according to the number of subtasks corresponding to the queue and the task processing speed.
And a substep S132, calculating a second time length according to the number of processors in the processor group corresponding to the queue and the first time length.
And a substep S133 of determining the remaining time of the target task according to the calculated second durations.
In this embodiment, for the queue corresponding to each processor group, a product of the number of the subtasks of the queue and the corresponding task processing speed may be obtained through calculation, so as to obtain the first duration corresponding to the queue. Then, the number of processors in the processor group corresponding to the queue at the first time length of the queue can be calculated, and the result is used as the second time length corresponding to the queue. The second duration corresponding to the queue may represent a time required to process the subtasks in the queue.
Under the condition of obtaining the second time length corresponding to each queue, how to obtain the remaining time of the target task based on the second time length corresponding to each queue can be determined by combining actual requirements. As a possible implementation manner, the maximum second time length in the calculated second time lengths is used as the remaining time of the target task.
According to the embodiment of the application, the residual estimated time is obtained by multiplying the historical processing speed by the residual subtask amount. The estimation accuracy at the beginning of this approach is poor, but it becomes higher and higher as the task is executed. Therefore, the residual running time of a certain task can be accurately estimated.
The pipeline task remaining time estimation method is illustrated in the following with reference to fig. 1.
If all subtasks split by the target task are already pushed to the first-level Queue1, then at any time t, the remaining subtask amount of Queue1 is recorded as q1 (i.e., the number of subtasks in tQueue1 is q 1), the remaining subtask amount of Queue2 is q2, and so on, the remaining subtask amounts of the queues are obtained. Each process records the average processing speed of the nearest n job of the processors included in the process, such as the average processing speed of process1 is denoted as v1, the average processing speed of process2 is denoted as v2, and so on.
Wherein, the calculation formula of the average processing speed v of one process is as follows: (the total time consumption/n of the latest n job of each processor)/the number of processors in the process can be adjusted to a certain extent, and the smaller the value of n is, the more the current processing efficiency can be reflected, but the fluctuation is larger; the larger the value of n, the more stable the data obtained, but the failure to respond to the previous burst situation in time.
Then at time t, the remaining task completion time is noted as ft, with ft = max (q 1 v 1/n) 1 ,q2*v2/n 2 ,…,qn*vn/n n ). Wherein n is 1 Indicates the number of processors, n, included in Process1 2 Indicates the number of processors, n, included in process2 n Representing the number of processors that the process n includes.
In order to execute the corresponding steps in the above embodiment and various possible manners, an implementation manner of the pipeline task remaining time estimation apparatus 200 is given below, and optionally, the pipeline task remaining time estimation apparatus 200 may adopt the device structure of the electronic device 100 shown in fig. 2. Further, referring to fig. 6, fig. 6 is a block diagram illustrating a pipeline task remaining time estimation apparatus 200 according to an embodiment of the present disclosure. It should be noted that the basic principle and the resulting technical effects of the pipeline task remaining time estimation apparatus 200 provided in the present embodiment are the same as those of the above embodiments, and for the sake of brief description, reference may be made to corresponding contents in the above embodiments for parts that are not mentioned in the present embodiment. The pipeline task remaining time estimation apparatus 200 may include: a number obtaining module 210, a speed obtaining module 220, and a processing module 230.
The quantity obtaining module 210 is configured to obtain the quantity of the subtasks in each queue at the target time in the process of executing the target task based on the pipeline model.
The speed obtaining module 220 is configured to obtain a task processing speed of a processor group corresponding to each queue. Wherein the task processing speed is used to represent the time required for a processor group to process a sub-task.
The processing module 230 is configured to calculate, according to the number of the subtasks and the task processing speed corresponding to each queue, remaining time of the target task at the target time.
Optionally, in this embodiment, the speed obtaining module 220 is specifically configured to: acquiring processing time lengths corresponding to the preset number of sub-tasks processed by the processors in the processor group before the target time; and calculating the task processing speed of the processor group according to the preset number of processing time lengths corresponding to the processors.
Optionally, in this embodiment, the processing module 230 is specifically configured to: aiming at each queue, calculating to obtain a first time length corresponding to the queue according to the number of the subtasks corresponding to the queue and the task processing speed; calculating to obtain a second time length according to the number of processors in the processor group corresponding to the queue and the first time length; and determining the remaining time of the target task according to the calculated second time length.
Optionally, in this embodiment, the processing module 230 is specifically configured to: and taking the maximum second time length in the calculated second time lengths as the remaining time of the target task.
Alternatively, the modules may be stored in the memory 110 shown in fig. 2 in the form of software or Firmware (Firmware) or be fixed in an Operating System (OS) of the electronic device 100, and may be executed by the processor 120 in fig. 2. Meanwhile, data, codes of programs, and the like required to execute the above-described modules may be stored in the memory 110.
The embodiment of the application also provides a readable storage medium, wherein a computer program is stored on the readable storage medium, and when the computer program is executed by a processor, the method for estimating the residual time of the pipeline task is realized.
To sum up, the embodiment of the present application provides a method, an apparatus, an electronic device, and a readable storage medium for estimating remaining time of a pipeline task, where in a process of executing a target task based on a pipeline model, the number of subtasks in each queue at a target time is obtained, and a task processing speed of a processor group corresponding to each queue is obtained, where the task processing speed is used to indicate a time required for one processor group to process one subtask; and calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed. In this way, the remaining time of a task processed using the pipeline model can be estimated.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, 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 that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
The foregoing is illustrative of only alternative embodiments of the present application and is not intended to limit the present application, which may be modified or varied by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A method for estimating remaining time of pipeline task, the method comprising:
in the process of executing the target task based on the pipeline model, acquiring the number of subtasks in each queue at the target moment;
acquiring the task processing speed of the processor group corresponding to each queue, wherein the task processing speed is used for indicating the time required by one processor group to process one subtask;
and calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed.
2. The method according to claim 1, wherein the calculating the remaining time of the target task according to the number of subtasks and the task processing speed corresponding to each of the queues comprises:
aiming at each queue, calculating to obtain a first time length corresponding to the queue according to the number of subtasks corresponding to the queue and the task processing speed;
calculating to obtain a second time length according to the number of processors in the processor group corresponding to the queue and the first time length;
and determining the remaining time of the target task according to the calculated second time length.
3. The method of claim 2, wherein determining the remaining time for the target task based on the calculated second time durations comprises:
and taking the maximum second time length in the calculated second time lengths as the remaining time of the target task.
4. The method according to any one of claims 1 to 3, wherein the obtaining the task processing speed of the processor group corresponding to each queue comprises:
acquiring processing time lengths corresponding to the preset number of sub-tasks processed by each processor in the processor group before the target time;
and calculating the task processing speed of the processor group according to the preset number of processing time lengths corresponding to the processors.
5. A pipelined task remaining time estimation apparatus, the apparatus comprising:
the quantity obtaining module is used for obtaining the quantity of the subtasks in each queue at the target moment in the process of executing the target task based on the pipeline model;
a speed obtaining module, configured to obtain a task processing speed of a processor group corresponding to each queue, where the task processing speed is used to indicate time required for processing one sub-task by one processor group;
and the processing module is used for calculating the remaining time of the target task at the target moment according to the number of the subtasks corresponding to each queue and the task processing speed.
6. The apparatus according to claim 5, wherein the processing module is specifically configured to:
aiming at each queue, calculating to obtain a first time length corresponding to the queue according to the number of subtasks corresponding to the queue and the task processing speed;
calculating to obtain a second time length according to the number of processors in the processor group corresponding to the queue and the first time length;
and determining the remaining time of the target task according to the calculated second time length.
7. The apparatus of claim 6, wherein the processing module is specifically configured to:
and taking the maximum second time length in the calculated second time lengths as the remaining time of the target task.
8. The apparatus according to any one of claims 5 to 7, wherein the speed obtaining module is specifically configured to:
acquiring processing time lengths corresponding to the preset number of sub-tasks processed by the processors in the processor group before the target time;
and calculating the task processing speed of the processor group according to the preset number of processing time lengths corresponding to the processors.
9. An electronic device comprising a processor and a memory, the memory storing machine executable instructions executable by the processor, the processor being configured to execute the machine executable instructions to implement the method for estimating remaining time of pipeline task as claimed in any one of claims 1 to 4.
10. A readable storage medium on which a computer program is stored, the computer program, when executed by a processor, implementing the pipelined task remaining time estimation method of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211466585.7A CN115794342A (en) | 2022-11-22 | 2022-11-22 | Method and device for estimating remaining time of pipeline task and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211466585.7A CN115794342A (en) | 2022-11-22 | 2022-11-22 | Method and device for estimating remaining time of pipeline task and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115794342A true CN115794342A (en) | 2023-03-14 |
Family
ID=85440061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211466585.7A Pending CN115794342A (en) | 2022-11-22 | 2022-11-22 | Method and device for estimating remaining time of pipeline task and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115794342A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116795434A (en) * | 2023-08-21 | 2023-09-22 | 云账户技术(天津)有限公司 | Pipelined task processing method and device, electronic equipment and storage medium |
| CN117076092A (en) * | 2023-10-13 | 2023-11-17 | 成都登临科技有限公司 | Multi-dimensional data task processing method and device, electronic equipment and storage medium |
-
2022
- 2022-11-22 CN CN202211466585.7A patent/CN115794342A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116795434A (en) * | 2023-08-21 | 2023-09-22 | 云账户技术(天津)有限公司 | Pipelined task processing method and device, electronic equipment and storage medium |
| CN116795434B (en) * | 2023-08-21 | 2023-11-14 | 云账户技术(天津)有限公司 | Pipelined task processing method and device, electronic equipment and storage medium |
| CN117076092A (en) * | 2023-10-13 | 2023-11-17 | 成都登临科技有限公司 | Multi-dimensional data task processing method and device, electronic equipment and storage medium |
| CN117076092B (en) * | 2023-10-13 | 2024-01-19 | 成都登临科技有限公司 | Multi-dimensional data task processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115794342A (en) | Method and device for estimating remaining time of pipeline task and electronic equipment | |
| Dinda | Online prediction of the running time of tasks | |
| US20060010101A1 (en) | System, method and program product for forecasting the demand on computer resources | |
| US20120317069A1 (en) | Throughput sustaining support system, device, method, and program | |
| CN111695877A (en) | Computer-implemented project resource management method, system, device and readable medium | |
| CN112685187B (en) | Cloud game resource scheduling method and device | |
| EP1495417A1 (en) | System, and method for resource usage estimation | |
| CN113360270B (en) | Data cleaning task processing method and device | |
| US11966775B2 (en) | Cloud native adaptive job scheduler framework for dynamic workloads | |
| CN111680085A (en) | Data processing task analysis method and device, electronic equipment and readable storage medium | |
| CN111752822A (en) | Containerization pressure measurement scheduling method, computer equipment and readable storage medium | |
| JP3828112B2 (en) | Scheduling method and system for controlling execution of processing | |
| Haussmann et al. | Cost-efficient parallel processing of irregularly structured problems in cloud computing environments | |
| US7512519B2 (en) | Run-time characterization of on-demand analytical model accuracy | |
| US6202190B1 (en) | Process for determining the start- up time of a data processing system | |
| CN111913805B (en) | CPU utilization rate calculation method and device | |
| CN110674214A (en) | Big data synchronization method and device, computer equipment and storage medium | |
| CN111666535A (en) | Method and device for determining user activity duration, electronic equipment and storage medium | |
| US20120317575A1 (en) | Apportioning summarized metrics based on unsummarized metrics in a computing system | |
| CN100451962C (en) | Adaptive control of loading a program in a disk-based operating system | |
| CN116684306B (en) | Fault prediction method, device, equipment and readable storage medium | |
| CN113411390B (en) | Scheduling method and device of content distribution network and electronic equipment | |
| CN116974853A (en) | Equipment information processing method and device | |
| CN115309609A (en) | Method, device and medium for acquiring utilization rate of CPU (Central processing Unit) of cloud platform | |
| CN117539617A (en) | Task intelligent distribution method and device based on crowd-sourced heterogeneous system |
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 |