CN116483785A - File transmission scheduling method, device, equipment and computer readable storage medium - Google Patents
File transmission scheduling method, device, equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN116483785A CN116483785A CN202310438995.9A CN202310438995A CN116483785A CN 116483785 A CN116483785 A CN 116483785A CN 202310438995 A CN202310438995 A CN 202310438995A CN 116483785 A CN116483785 A CN 116483785A
- Authority
- CN
- China
- Prior art keywords
- time period
- time
- tasks
- file transmission
- total
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 136
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000012546 transfer Methods 0.000 claims description 159
- 238000004364 calculation method Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 11
- 230000003111 delayed effect Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000000977 initiatory effect Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
-
- 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 disclosure provides a file transmission scheduling method, a file transmission scheduling device, file transmission scheduling equipment and a computer readable storage medium. The file transmission scheduling method comprises the following steps: calculating a time slice according to the maximum connection number of the file transmission server and a preset time period; determining total time consumption of all file transmission tasks in a target time period with the same length as a preset time period; determining a relationship between total time consumption and time slices; according to the determination result of the relation between the total time consumption and the time slices, all file transmission tasks in the target time period are scheduled, invalid access to the file transmission server can be reduced through calculation of the time slices and scheduling of the file transmission tasks, unnecessary retries caused by limitation of the connection number of the file transmission server are avoided or reduced, and therefore the use efficiency of connection resources of the file transmission server is increased, and user experience is improved.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a file transmission scheduling method, a file transmission scheduling device, file transmission scheduling equipment and a computer readable storage medium.
Background
With the development of computer technology, there is an increasing need for files to be exchanged between different objects. For example, a party provides a file transfer server to which the party and other related parties have access rights. One party temporarily places the file on a file transfer server and then the other party accesses the file transfer server to obtain the file. Since each party shares one file transfer server and the connection resources of the file transfer server are limited, each party may not be connected to the file transfer server due to the limitation of connection number resources. In general, each party can ensure that the file is obtained normally through a retry mechanism.
One scheme of the related art is a fixed time access scheme. The scheme refers to the downloading or uploading of the file by accessing the file transmission server at a fixed time through the triggering time of the downloading (uploading) of the file. For example, starting at 7 a.m., and ending at 19 a.m., each hour triggers a file download or upload task.
Another solution of the related art is an automatic retry solution after a task failure. The scheme refers to that after file downloading or uploading is triggered, if the task fails, retry is carried out within a configured fixed time interval and retry times.
However, both the fixed time access scheme and the automatic retry after task failure scheme actually increase the number of accesses to the file transfer server. This increases the failure probability of other file transfers in an intangible way with limited server resources and severely impacts the user experience.
Disclosure of Invention
In view of this, a first aspect of the present disclosure provides a file transmission scheduling method, including:
calculating a time slice according to the maximum connection number of the file transmission server and a preset time period;
determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period;
determining a relationship between the total elapsed time and the time slice;
scheduling all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the determining the relationship between the total elapsed time and the time slice comprises: the total elapsed time is compared to the time slice.
A second aspect of the present disclosure provides a file transmission scheduling apparatus, including:
the computing module is configured to compute a time slice according to the maximum connection number of the file transmission server and a preset time period;
a first determining module configured to determine a total time consumption of all file transfer tasks within a target time period having the same length as the preset time period;
a second determination module configured to determine a relationship between the total elapsed time and the time slice;
the scheduling module is configured to schedule all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the second determination module is configured to compare the total elapsed time to the time slice.
A third aspect of the present disclosure provides an electronic device comprising a memory and a processor; wherein the memory is for storing one or more computer instructions, wherein the one or more computer instructions are executed by the processor to perform the steps of:
calculating a time slice according to the maximum connection number of the file transmission server and a preset time period;
determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period;
determining a relationship between the total elapsed time and the time slice;
scheduling all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the determining the relationship between the total elapsed time and the time slice comprises: the total elapsed time is compared to the time slice.
A fourth aspect of the present disclosure provides a computer readable storage medium having stored thereon computer instructions which, when executed by a processor, implement a method as described in the first aspect.
In the embodiment of the disclosure, the time slice is calculated according to the maximum connection number of the file transmission server and a preset time period; determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period; determining a relationship between the total elapsed time and the time slice; and scheduling all file transmission tasks in the target time period according to the determination result of the relation between the total consumption time and the time slices, and reducing invalid access to the file transmission server by calculating the time slices and scheduling the file transmission tasks, so as to avoid or reduce unnecessary retries caused by the limitation of the connection number of the file transmission server, thereby increasing the use efficiency of the connection resources of the file transmission server and improving user experience.
These and other aspects of the disclosure will be more readily apparent from the following description of the embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the related art, a brief description will be given below of the drawings required for the exemplary embodiments or the related technical descriptions, and it is apparent that the drawings in the following description are some exemplary embodiments of the present disclosure, and other drawings may be obtained according to the drawings without inventive effort to those of ordinary skill in the art.
FIG. 1 illustrates a flow chart of a file transfer scheduling method according to an embodiment of the present disclosure;
FIG. 2 shows a flowchart of an example of steps for scheduling file transfer tasks in one example of a file transfer scheduling method according to an embodiment of the present disclosure;
fig. 3 shows a flowchart of an example of step S104 of a file transmission scheduling method according to an embodiment of the present disclosure;
FIG. 4 shows a block diagram of a file transfer scheduling apparatus according to another embodiment of the present disclosure;
fig. 5 shows a schematic diagram of an application scenario example of a file transfer scheduling method according to an embodiment of the present disclosure;
FIG. 6 shows a block diagram of an electronic device according to an embodiment of the present disclosure;
fig. 7 is a schematic diagram of a computer system suitable for use in implementing a file transfer scheduling method according to an embodiment of the present disclosure.
Detailed Description
In order that those skilled in the art will better understand the present disclosure, a technical solution in exemplary embodiments of the present disclosure will be clearly and completely described in the following with reference to the accompanying drawings in exemplary embodiments of the present disclosure.
In some of the flows described in the specification and claims of this disclosure and in the foregoing figures, a number of operations are included that occur in a particular order, but it should be understood that the operations may be performed in other than the order in which they occur or in parallel, that the order of operations such as 101, 102, etc. is merely for distinguishing between the various operations, and that the order of execution does not itself represent any order of execution. In addition, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first" and "second" herein are used to distinguish different messages, devices, modules, etc., and do not represent a sequence, and are not limited to the "first" and the "second" being different types.
Technical solutions in exemplary embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in exemplary embodiments of the present disclosure, and it is apparent that the described exemplary embodiments are only some embodiments of the present disclosure, not all embodiments. Based on the embodiments in this disclosure, all other embodiments that a person of ordinary skill in the art would obtain without making any inventive effort are within the scope of the disclosure.
Fig. 1 illustrates a flowchart of a file transfer scheduling method according to an embodiment of the present disclosure. The method may include steps S101, S102, S103 and S104.
In step S101, a time slice is calculated according to the maximum connection number of the file transfer server and a preset time period.
In step S102, the total time consumption of all file transfer tasks within a target period of time having the same length as the preset period of time is determined.
In step S103, a relationship between the total time consumption and the time slice is determined.
In step S104, all file transfer tasks within the target time period are scheduled according to the determination result of the relationship between the total time consumption and the time slices.
In one embodiment of the present disclosure, the time slice may be a maximum total task execution duration within a preset time period, i.e., a total service time within the preset time period. In one embodiment, when the preset time period is T and the maximum connection number of the file transfer server is N, the time slice of the file transfer server is n×t. For example, when the preset period is 5 minutes and the maximum connection number of the file transfer server is 6, the time slice is 6×5×60 (seconds) =1800 seconds. Those skilled in the art will appreciate that the units of time slices are seconds only examples, and that in practice time slices may take various units of milliseconds, minutes, etc.
In one embodiment of the present disclosure, determining the total time consumption of all file transfer tasks within a target time period having the same length as a preset time period refers to adding the time consumption of each file transfer task within the target time period. In one embodiment, the total elapsed time of all file transfer tasks within the target time periodWhere m is the number of all file transfer tasks in the target time period, and f (i) is the time consumption of the ith file transfer task.
In one embodiment of the present disclosure, determining the relationship between the total consumption time and the time slice refers to comparing the total consumption time of the time slice and all file transfer tasks in the target time period, and the scheduling of all file transfer tasks in the target time period may be performed according to the relationship between the total consumption time and the total consumption time of all file transfer tasks in the target time period, that is, the comparison result. The scheduling of the file transmission task refers to scheduling whether the transmission task of all files in the target period is executed, execution time, and the like.
In the embodiment of the disclosure, the time slice is calculated according to the maximum connection number of the file transmission server and a preset time period; determining total time consumption of all file transmission tasks in a target time period with the same length as a preset time period; determining a relationship between total time consumption and time slices; according to the determination result of the relation between the total time consumption and the time slices, all file transmission tasks in the target time period are scheduled, invalid access to the file transmission server can be reduced through calculation of the time slices and scheduling of the file transmission tasks, unnecessary retries caused by limitation of the connection number of the file transmission server are avoided or reduced, and therefore the use efficiency of connection resources of the file transmission server is increased, and user experience is improved.
In the following, how to schedule all file transfer tasks within a target time period is described in terms of embodiments of different relationships between the total elapsed time and the time slices.
First, how scheduling is performed in the case where the total time consumption is greater than the time slice is explained.
In one embodiment of the present disclosure, step S104 includes: and according to the determination result that the total time consumption is greater than the time slice, scheduling the file transmission task with the highest priority and the sum of the time consumption being less than or equal to the time slice in all the file transmission tasks in the target time period to be executed in the target time period, and delaying the rest of the file transmission tasks in all the file transmission tasks in the target time period to be executed in the time period after the target time period.
In one embodiment, when the total consumption of all file transfer tasks within the target time period is greater than the time slice of the file transfer server, i.e., F > n×t, the total service time of the file transfer server within the target time period does not satisfy the time required for all (e.g., m) file transfer tasks currently. At this time, the task may be transmitted to a time period after the target time period by delaying a part of the low priority. That is, since the time slices corresponding to the target time period cannot satisfy the execution of all the file transfer tasks within the target time period, the file transfer tasks that can be executed within the time slices corresponding to the target time period continue to be executed within the target time period, and the remaining file transfer tasks within the target time period are scheduled to be executed within the time slices corresponding to the time periods after the target time period, for example, the time slices corresponding to the next time period or time periods after the target time period. In some cases, if the total file transfer tasks within the target time period are excessive, a time slice corresponding to a plurality of time periods after the target time period may be required to complete the external file transfer tasks. Therefore, the requirement of the service time of the file transmission task of the file transmission server in the target time period is reduced, and the transmission task in the time slice corresponding to the target time period can be ensured not to be limited by the connection number of the file transmission server.
Fig. 2 shows a flowchart of an example of steps of scheduling a file transfer task in one example of a file transfer scheduling method according to an embodiment of the present disclosure. Fig. 2 shows an example of a step of scheduling a file transfer task in one embodiment of step S104 in fig. 1.
In the embodiment as shown in fig. 2, according to the result of the determination that the total time consumption is greater than the time slice, the file transfer tasks having the highest priority and the sum of the time consumption being less than or equal to the time slice among all the file transfer tasks within the target time period are scheduled to be executed within the target time period, and the remaining file transfer tasks among all the file transfer tasks within the target time period are delayed to be executed within the time period after the target time period, including steps S201 and S202.
In step S201, the relationship between the number of file transfer tasks and the maximum connection number of the time slices, in which the sum of the time-consuming times and the priority of the highest among all file transfer tasks within the target time period is determined to be less than or equal to.
In step S202, according to the determination result that the sum of the highest priority and time consumption among all the file transmission tasks in the target period is less than or equal to the number of file transmission tasks of the time slice being greater than the maximum connection number, the file transmission task of which the sum of the highest priority and time consumption among all the file transmission tasks in the target period is less than or equal to the number of file transmission tasks of the time slice being equal to the maximum connection number and the highest priority is scheduled to be executed in advance, and the remaining file transmission tasks other than the file transmission task executed in advance among all the file transmission tasks in the target period are scheduled to be executed in later.
In one embodiment of the present disclosure, the priority of file transfer tasks may be determined according to various manners. In one embodiment of the present disclosure, the priority of the file transfer tasks is determined based on the time limit (or timeliness) of the file transfer tasks. For example, the priority may be determined according to a preset priority order. In another embodiment, the priority of the file transfer tasks may also be adjusted.
In one example, in an embodiment where priorities are determined based on timeliness of file transfer tasks, real-time file transfer tasks may be set to highest priority, file transfer tasks that need to be completed within a short fixed time (e.g., within 2 hours) may be set to medium priority, and file transfer tasks that are completed within a longer fixed time (e.g., within 24 hours) may be set to low priority. It will be appreciated by those skilled in the art that the manner in which the priority of the file transfer task is set is merely an example, and that more priorities may be set for the file transfer task, or that the priority of the file transfer task may be set according to different conditions. In one embodiment of the present disclosure, the closer the time limit of a file transfer task is to the deadline priority of the file transfer task.
In one embodiment of the present disclosure, the priority of a file transfer task performed within a time period delayed to a target time period is raised compared to the priority of the file transfer task in the target time period. In one example, the priority of all file transfer tasks may be dynamically adjusted. For example, if a file transfer task within a target time period cannot be completed within a time slice corresponding to the target time period, it may be degraded (delayed) to the next time slice execution. Then, in the next time slice, the priority of the file transfer task that cannot be completed in the time slice corresponding to the target time slice is raised. And so on, the closer the time limit is to the file transfer task, the higher the priority of the file transfer task is promoted.
In one embodiment of the present disclosure, if the total time consumption of all file transfer tasks to be performed in the target period is greater than the time slice, it is necessary to split all file transfer tasks in the target period, and only file transfer tasks whose total time consumption does not exceed the time slice are performed in the time slice corresponding to the target period. In this case, the file transfer task with the highest priority is executed first, and at the same time, due to the limitation of the maximum connection number of the file transfer server, at most only the file transfer task with the number not exceeding the maximum connection number can be executed at the same time. Further, the remaining file transfer tasks other than the previously executed file transfer task among all the file transfer tasks within the target period are scheduled to be executed later, that is, within a time slice corresponding to a period after the target period. In this case, even if all the file transfer tasks cannot be executed in the target period due to various reasons, the file transfer tasks can be executed in the subsequent period in accordance with the priority of the file transfer tasks. Therefore, unnecessary retries caused by the limitation of the connection number of the file transmission server can be avoided or reduced, the use efficiency of the connection resources of the file transmission server is increased, and the user experience is improved.
Fig. 3 shows a flowchart of an example of step S104 of a file transmission scheduling method according to an embodiment of the present disclosure. As shown in fig. 3, step S104 includes steps S301 and S302.
In step S301, a relationship between the maximum connection number and the total number of file transfer tasks in the target time period is determined according to the determination result that the total time consumption is less than or equal to the time slice.
In step S302, according to the determination result that the number of all file transfer tasks in the target period is greater than the maximum connection number, the file transfer task with the highest priority and the number equal to the maximum connection number in all file transfer tasks in the target period is scheduled to be executed in advance, and the remaining file transfer tasks in all file transfer tasks in the target period are scheduled to be executed in later.
In one embodiment of the present disclosure, when the total consumption of all file transfer tasks within the target period is less than or equal to the time slice, i.e., f+.n.t., it may be considered that all file transfer tasks may be completed within the time slice. In this case, it is necessary to confirm the total number of file transfer tasks and the maximum number of connections within the target period. When the number of all file transfer tasks in the target period is greater than the maximum connection number, that is, m > N, it is necessary to execute N file transfer tasks with high priority among the m file transfer tasks first. And when the file transmission tasks in the N file transmission tasks with high priority are completed, initiating the other m-N file transmission tasks successively. That is, the file transfer tasks having the highest priority and the number equal to the maximum connection number among all the file transfer tasks in the target period are scheduled to be executed in advance, and the remaining file transfer tasks among all the file transfer tasks in the target period are scheduled to be executed in the later. Therefore, unnecessary retries caused by the limitation of the connection number of the file transmission server can be avoided or reduced, the use efficiency of the connection resources of the file transmission server is increased, and the user experience is improved.
In one embodiment of the present disclosure, step S104 includes: when all the file transfer tasks in the target time period are not completed in the target time period, the file transfer tasks which are not completed in the target time period are delayed to be executed in a time period after the target time period.
In one embodiment of the present disclosure, all file transfer tasks within the target time period may not be completed in the target time period for various reasons, for example, because the total file transfer tasks within the target time period are too large, because the file transfer rate of the server is changed, and so on. As long as it appears that all of the file transfer tasks within the target period are not completed within the target period, the incomplete tasks may be delayed to be executed within a period after the target period, that is, delayed to be completed within a time slice corresponding to the period after the target period. Therefore, unnecessary retries caused by the limitation of the connection number of the file transmission server can be avoided or reduced, the use efficiency of the connection resources of the file transmission server is increased, and the user experience is improved.
In one embodiment of the present disclosure, when the total consumption of all file transfer tasks within the target period is less than or equal to the time slice, i.e., f+.n.t., it may be considered that all file transfer tasks may be completed within the time slice. In this case, step S104 includes: and executing all file transmission tasks in the target time period according to the determination result that the number of all file transmission tasks in the target time period is smaller than or equal to the maximum connection number.
In one embodiment of the present disclosure, when the total number of file transfer tasks in the target period is less than or equal to the maximum connection number, that is, m+.n, the maximum connection number and the service time of the file transfer server are sufficient for the file transfer tasks to be used in the time slice corresponding to the target period, and thus, all m file transfer tasks can be directly performed.
In one embodiment of the present disclosure, step S102 may include: and determining the total time consumption of all file transmission tasks in the target time period with the same length as the preset time period according to the transmitted file size and time consumption in the historical file transmission tasks.
In one embodiment of the present disclosure, the total consumption time of all file transfer tasks in the target time period may be determined according to the transferred file size and the time-consuming history record in the file transfer tasks, so that the time consumption of all file transfer tasks in the target time period may be predicted more accurately. In another embodiment of the present disclosure, the time consumption of all file transfer tasks within a target time period may be predicted according to a preset transfer rate value of the file transfer server. Those skilled in the art will appreciate that various manners of predicting the time elapsed for all file transfer tasks within a target time period may be employed, as desired.
Fig. 5 shows a schematic diagram of an application scenario example of a file transfer scheduling method according to an embodiment of the present disclosure.
As shown in fig. 5, 5 minutes is taken as the preset time period. And acquiring the transmission task with the target time period being within the current 5 minutes. The time slices are calculated according to the maximum connection number of the file transfer server and a preset time period (5 minutes). The transmission time of the next file is predicted according to the result (file size + time consumption) of the historical transmission task. It is determined whether the total expected time of file transfer is greater than the maximum service time of sftp (secure file transfer protocol), i.e. the time slice. When the total predicted time consumption of file transfer is greater than the maximum service time of sftp, the execution of the high-priority transfer task is guaranteed, and the low-priority task is scheduled to the next time slice, and the priority is increased. As shown, the file transfer task that was not completed for the last time slice is performed within the time slice corresponding to the next time slice of the target time slice. Thus, the transmission task within 5 minutes + the task left over by the last time slice can be extracted at the next time slice.
In one embodiment, as shown in FIG. 5, when the total predicted time consumption for file transfer is less than or equal to the maximum service time for sftp, a determination is made as to whether the number of file transfer tasks is greater than the maximum number of connections for sftp. When the number of file transmission tasks is larger than the maximum connection number of sftp, initiating the file transmission tasks with the maximum connection number of sftp; and after the transmission task is successful, the following task is initiated. And directly initiating the file transmission task when the number of the file transmission tasks is smaller than or equal to the maximum connection number of sftp.
In the application scenario of the file transfer scheduling method shown in fig. 5, the scheduling task and the file transfer time-consuming statistical task are always in the process of execution.
Fig. 4 shows a block diagram of a file transfer scheduling apparatus according to another embodiment of the present disclosure. The apparatus may include a calculation module 401, a first determination module 402, a second determination module 403, and a scheduling module 404.
The calculation module 401 is configured to calculate a time slice according to the maximum connection number of the file transfer server and a preset time period.
The first determining module 402 is configured to determine a total time consumption of all file transfer tasks within a target time period having the same length as the preset time period.
The second determination module 403 is configured to determine a relationship between the total elapsed time and the time slice.
The scheduling module 404 is configured to schedule all file transfer tasks within the target time period according to a determination result of the relation between the total elapsed time and the time slices.
The internal functions and structures of the text content identifying means are described above, and in one possible design, the structure of the text content identifying means may be implemented as a text content identifying device, as shown in fig. 6, the processing device 600 may include a processor 601 and a memory 602.
The memory 602 is configured to store a program for supporting the text content identification means to perform the text content identification method of any of the above embodiments, and the processor 601 is configured to execute the program stored in the memory 602.
The memory 602 is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor 601 to perform the steps of:
calculating a time slice according to the maximum connection number of the file transmission server and a preset time period;
determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period;
determining a relationship between the total elapsed time and the time slice;
and scheduling all file transmission tasks in the target time period according to the determination result of the relation between the total consumed time and the time slices.
In one embodiment of the present disclosure, the scheduling all file transfer tasks in the target time period according to the determination result of the relationship between the total elapsed time and the time slice includes:
and according to the determination result that the total consumption time is greater than the time slice, scheduling the file transmission tasks with highest priority and time consumption sum less than or equal to the time slice in all the file transmission tasks in the target time period to be executed in the target time period, and delaying the rest of the file transmission tasks in all the file transmission tasks in the target time period to be executed in a time period after the target time period.
In one embodiment of the present disclosure, the scheduling, according to the determination result that the total time consumption is greater than the time slice, the file transfer task having the highest priority and the sum of time consumption being less than or equal to the time slice among all the file transfer tasks in the target time period to be executed in the target time period, and delaying the remaining file transfer tasks among all the file transfer tasks in the target time period to be executed in a time period after the target time period includes:
determining the relation between the number of file transmission tasks of the time slice and the maximum connection number, wherein the sum of the highest priority and time consumption in all the file transmission tasks in the target time period is smaller than or equal to the maximum connection number;
according to the determination result that the sum of the highest priority and the time consumption in all the file transmission tasks in the target time period is smaller than or equal to the determination result that the number of the file transmission tasks of the time slice is larger than the maximum connection number, the file transmission tasks of which the sum of the highest priority and the time consumption in all the file transmission tasks in the target time period is smaller than or equal to the number of the file transmission tasks of the time slice, which are equal to the maximum connection number and the highest priority, are scheduled to be executed in advance, and the rest file transmission tasks except the file transmission tasks executed in advance in all the file transmission tasks in the target time period are scheduled to be executed in later.
In one embodiment of the present disclosure, the scheduling all file transfer tasks in the target time period according to the determination result of the relationship between the total elapsed time and the time slice includes:
determining the relation between all file transmission task numbers and the maximum connection number in the target time period according to the determination result that the total time consumption is smaller than or equal to the time slice;
and according to a determination result that the number of all file transmission tasks in the target time period is greater than the maximum connection number, scheduling the file transmission tasks with the highest priority, which are equal to the maximum connection number, in all file transmission tasks in the target time period as the previous execution, and scheduling the rest file transmission tasks in all file transmission tasks in the target time period as the subsequent execution.
In one embodiment of the present disclosure, the scheduling all file transfer tasks in the target time period according to the determination result of the relationship between the total elapsed time and the time slice includes:
and when all the file transmission tasks in the target time period are not completed in the target time period, delaying the file transmission tasks which are not completed in the target time period to be executed in a time period after the target time period.
In one embodiment of the present disclosure, the scheduling all file transfer tasks in the target time period according to the determination result of the relationship between the total elapsed time and the time slice includes:
and executing all file transmission tasks in the target time period according to the determination result that the number of all file transmission tasks in the target time period is smaller than or equal to the maximum connection number.
In one embodiment of the present disclosure, the determining the total consumption of all the file transfer tasks within the target time period with the same length as the preset time period includes:
and determining the total time consumption of all file transmission tasks in the target time period with the same length as the preset time period according to the transmitted file size and time consumption in the historical file transmission tasks.
In one embodiment of the present disclosure, the priority of the file transfer task is determined based on a time limit of the file transfer task.
In one embodiment of the present disclosure, the priority of a file transfer task performed within a time period delayed to the target time period is raised compared to the priority of the file transfer task in the target time period.
In one embodiment of the present disclosure, the closer the time limit of the file transfer task is to the deadline priority of the file transfer task.
The processor 601 is configured to perform all or part of the steps of the methods described above.
The text content identification device can also comprise a communication interface in the structure for the text content identification device to communicate with other devices or communication networks.
The exemplary embodiments of the present disclosure also provide a computer storage medium for storing computer software instructions for use by the text content identification apparatus, which contains a program for executing the text content identification method according to any of the above embodiments.
Fig. 7 is a schematic diagram of a computer system suitable for use in implementing a text content identification method according to an embodiment of the present disclosure.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU) 701, which can execute various processes in the embodiment shown in fig. 1 described above in accordance with a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data required for the operation of the system 700 are also stored. The CPU701, ROM702, and RAM703 are connected to each other through a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input section 706 including a keyboard, a mouse, and the like; an output portion 707 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 708 including a hard disk or the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. The drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read therefrom is mounted into the storage section 708 as necessary.
In particular, the method described above with reference to fig. 1 may be implemented as a computer software program according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the data processing method of fig. 1. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 709, and/or installed from the removable medium 711.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, and/or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present disclosure may be implemented by software, or may be implemented by hardware. The units or modules described may also be provided in a processor, the names of which in some cases do not constitute a limitation of the unit or module itself.
As another aspect, the present disclosure also provides a computer-readable storage medium, which may be a computer-readable storage medium included in the apparatus described in the above embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention referred to in this disclosure is not limited to the specific combination of features described above, but encompasses other embodiments in which any combination of features described above or their equivalents is contemplated without departing from the inventive concepts described. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).
Claims (14)
1. A file transfer scheduling method, comprising:
calculating a time slice according to the maximum connection number of the file transmission server and a preset time period;
determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period;
determining a relationship between the total elapsed time and the time slice;
scheduling all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the determining the relationship between the total elapsed time and the time slice comprises: the total elapsed time is compared to the time slice.
2. The method according to claim 1, wherein the calculating the time slice according to the maximum connection number of the file transfer server and the preset time period includes:
and multiplying the maximum connection number by the preset time period to calculate the time slice.
3. The method according to claim 1, wherein determining the total consumption of all file transfer tasks within a target time period having the same length as the preset time period comprises:
and adding the time consumption of each file transmission task in the target time period to obtain the total time consumption.
4. The method according to claim 1, wherein determining the total consumption of all file transfer tasks within a target time period having the same length as the preset time period comprises:
and determining the total time consumption of all file transmission tasks in the target time period with the same length as the preset time period according to the transmitted file size and time consumption in the historical file transmission tasks.
5. The method according to claim 1, wherein determining the total consumption of all file transfer tasks within a target time period having the same length as the preset time period comprises:
and predicting the time consumption of all file transmission tasks in the target time period according to the preset transmission rate value of the file transmission server to obtain the total time consumption.
6. The method according to claim 1, wherein the scheduling all file transfer tasks within the target time period according to the determination result of the relation between the total elapsed time and the time slice comprises:
and when all the file transmission tasks in the target time period are not completed in the target time period, delaying the file transmission tasks which are not completed in the target time period to be executed in a time period after the target time period.
7. A file transfer scheduling apparatus, comprising:
the computing module is configured to compute a time slice according to the maximum connection number of the file transmission server and a preset time period;
a first determining module configured to determine a total time consumption of all file transfer tasks within a target time period having the same length as the preset time period;
a second determination module configured to determine a relationship between the total elapsed time and the time slice;
the scheduling module is configured to schedule all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the second determination module is configured to compare the total elapsed time to the time slice.
8. An electronic device comprising a memory and a processor; wherein the memory is for storing one or more computer instructions, wherein the one or more computer instructions are executed by the processor to perform the steps of:
calculating a time slice according to the maximum connection number of the file transmission server and a preset time period;
determining total time consumption of all file transmission tasks in a target time period with the same length as the preset time period;
determining a relationship between the total elapsed time and the time slice;
scheduling all file transmission tasks in the target time period according to a determination result of the relation between the total consumed time and the time slices;
the determining the relationship between the total elapsed time and the time slice comprises: the total elapsed time is compared to the time slice.
9. The electronic device of claim 8, wherein the calculating the time slice based on the maximum number of connections of the file transfer server and the preset time period comprises:
and multiplying the maximum connection number by the preset time period to calculate the time slice.
10. The electronic device of claim 8, wherein determining a total consumption of all file transfer tasks within a target time period having a same length as the preset time period comprises:
and adding the time consumption of each file transmission task in the target time period to obtain the total time consumption.
11. The electronic device of claim 8, wherein determining a total consumption of all file transfer tasks within a target time period having a same length as the preset time period comprises:
and determining the total time consumption of all file transmission tasks in the target time period with the same length as the preset time period according to the transmitted file size and time consumption in the historical file transmission tasks.
12. The electronic device of claim 8, wherein determining a total consumption of all file transfer tasks within a target time period having a same length as the preset time period comprises:
and predicting the time consumption of all file transmission tasks in the target time period according to the preset transmission rate value of the file transmission server to obtain the total time consumption.
13. The electronic device of claim 8, wherein the scheduling all file transfer tasks within the target time period according to the determination of the relationship between the total elapsed time and the time slice comprises:
and when all the file transmission tasks in the target time period are not completed in the target time period, delaying the file transmission tasks which are not completed in the target time period to be executed in a time period after the target time period.
14. A computer readable storage medium having stored thereon computer instructions which, when executed by a processor, implement the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310438995.9A CN116483785A (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811548759.8A CN110008187B (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
| CN202310438995.9A CN116483785A (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811548759.8A Division CN110008187B (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116483785A true CN116483785A (en) | 2023-07-25 |
Family
ID=67165162
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310438995.9A Pending CN116483785A (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
| CN201811548759.8A Active CN110008187B (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811548759.8A Active CN110008187B (en) | 2018-12-18 | 2018-12-18 | File transmission scheduling method, device, equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN116483785A (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110990323B (en) * | 2019-10-17 | 2023-09-15 | 尧芯微半导体(重庆)有限公司 | Optimized XHCI scheduling method |
| CN114371811A (en) * | 2020-10-15 | 2022-04-19 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer program product for storage management |
| CN117421098A (en) * | 2022-07-11 | 2024-01-19 | 中科寒武纪科技股份有限公司 | Method, apparatus, board card and computer readable storage medium for task scheduling |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1237767C (en) * | 2004-07-09 | 2006-01-18 | 清华大学 | A resource access shared scheduling and controlling method and apparatus |
| US8185899B2 (en) * | 2007-03-07 | 2012-05-22 | International Business Machines Corporation | Prediction based priority scheduling |
| CN103517343A (en) * | 2012-06-20 | 2014-01-15 | 上海无线通信研究中心 | Resource pre-scheduling method for device-to-device (D2D) communication system working under industrial scientific media (ISM) frequency bands |
| CN104980399B (en) * | 2014-04-08 | 2020-04-21 | 腾讯科技（深圳）有限公司 | File transmission method, client and proxy server |
| CN104680432A (en) * | 2015-03-24 | 2015-06-03 | 国家电网公司 | Method and device for determining service bearing condition of dispatching speciality |
| CN105450769A (en) * | 2015-12-10 | 2016-03-30 | 浪潮通用软件有限公司 | File transmission method and device |
| CN105912401B (en) * | 2016-04-08 | 2019-03-12 | 中国银行股份有限公司 | A kind of distributed data batch processing system and method |
| CN107357642B (en) * | 2017-06-27 | 2020-01-10 | 北京奇艺世纪科技有限公司 | Calculation task adjusting method and device |
-
2018
- 2018-12-18 CN CN202310438995.9A patent/CN116483785A/en active Pending
- 2018-12-18 CN CN201811548759.8A patent/CN110008187B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110008187A (en) | 2019-07-12 |
| CN110008187B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11934868B2 (en) | Systems and methods for scheduling tasks | |
| CN110008187B (en) | File transmission scheduling method, device, equipment and computer readable storage medium | |
| CN111950988B (en) | Distributed workflow scheduling method and device, storage medium and electronic equipment | |
| WO2019056695A1 (en) | Task scheduling method and apparatus, terminal device, and computer readable storage medium | |
| US20200159565A1 (en) | Predicting transaction outcome based on artifacts in a transaction processing environment | |
| CN109634989B (en) | HIVE task execution engine selection method and system | |
| US10514949B1 (en) | Efficient data processing in a serverless environment | |
| CN109428926B (en) | Method and device for scheduling task nodes | |
| CN110113176B (en) | Information synchronization method and device for configuration server | |
| CN113742057A (en) | Task execution method and device | |
| CN113760982A (en) | Data processing method and device | |
| CN117056054A (en) | Interrupt control method, interrupt controller, computer device, and storage medium | |
| CN110912949B (en) | Method and device for submitting sites | |
| US9300561B2 (en) | Business intelligence-infused smart retransmission processing | |
| US10915361B1 (en) | Dynamic capacity buffers | |
| CN115525411A (en) | Method, device, electronic equipment and computer readable medium for processing service request | |
| CN114064403A (en) | Task delay analysis processing method and device | |
| CN114265692A (en) | Service scheduling method, device, equipment and storage medium | |
| CN112685156A (en) | Task execution method and device, electronic equipment and computer readable medium | |
| CN113791876A (en) | System, method and apparatus for processing tasks | |
| CN113760494A (en) | Task scheduling method and device | |
| CN111901423B (en) | Asynchronous task scheduling method and device based on automatic frequency conversion | |
| CN117319312B (en) | Data flow control method and device | |
| CN111179097B (en) | Method, device, electronic equipment and storage medium for modifying warranty | |
| CN114186845A (en) | Method and device for executing index calculation task at fixed time |
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 |