CN111831420B - Method for task scheduling, related device and computer program product - Google Patents
Method for task scheduling, related device and computer program product Download PDFInfo
- Publication number
- CN111831420B CN111831420B CN202010697771.6A CN202010697771A CN111831420B CN 111831420 B CN111831420 B CN 111831420B CN 202010697771 A CN202010697771 A CN 202010697771A CN 111831420 B CN111831420 B CN 111831420B
- Authority
- CN
- China
- Prior art keywords
- task
- executed
- execution
- request
- request information
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- 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 application discloses a method, a device, electronic equipment and a computer readable storage medium for task scheduling, and relates to the technical fields of computers, cloud computing, task scheduling, algorithms and task queue processing. The specific implementation scheme is as follows: at least one type of task request information to be executed is obtained, tasks to be executed in a standard format are generated according to the task request information, a plurality of task to be executed generating task execution queues are obtained in response to the fact that the current scene meets the preset trigger condition, and the tasks to be executed in the task execution queues are sequentially sent to corresponding execution subjects. The scheme provides a method for task scheduling, which can unify task request information of different categories so as to adapt to different operation requests and save operation resources.
Description
Technical Field
The whole disclosure relates to the technical field of computers, in particular to the technical fields of cloud computing, task scheduling, algorithm and task queue processing.
Background
In the example life cycle of the cloud product, in order to achieve various different purposes, various tasks exist to assist in completing a plurality of transactions, such as order execution tasks, automatic fee renewal tasks, virtual machine deletion tasks, etc., according to specific situations corresponding to the purposes.
When executing the task, it is necessary to schedule appropriate resources according to the type of task, and select a processing policy corresponding to the type of task to execute the task.
Disclosure of Invention
The application provides a method, a device, electronic equipment and a storage medium for task scheduling.
In a first aspect, embodiments of the present application provide a method for task scheduling, including: acquiring at least one type of task request information to be executed, and generating a task to be executed in a standard format according to the task request information; responding to the current scene meeting the preset trigger condition, and obtaining a plurality of task to be executed to generate a task execution queue; and sequentially sending the tasks to be executed in the task execution queue to the corresponding execution main bodies.
In a second aspect, embodiments of the present application provide an apparatus for task scheduling, including: the system comprises a request information acquisition unit, a task execution unit and a task execution unit, wherein the request information acquisition unit is configured to acquire at least one type of task request information to be executed, and generate a task to be executed in a standard format according to the task request information; the execution queue generating unit is configured to respond to the fact that the current scene meets a preset trigger condition and acquire a plurality of task execution queues for generating tasks to be executed; the task sending unit is configured to send the tasks to be executed in the task execution queue to the corresponding execution main bodies in sequence.
In a third aspect, embodiments of the present application provide an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method for task scheduling as described in any one of the implementations of the first aspect.
In a fourth aspect, embodiments of the present application provide a non-transitory computer-readable storage medium storing computer instructions comprising: the computer instructions are for causing the computer to perform a method for task scheduling as described in any of the implementations of the first aspect.
In a fifth aspect, embodiments of the present application provide a computer program product comprising a computer program which, when executed by a processor, is capable of implementing a method for task scheduling as described in any of the implementations of the first aspect.
According to the method for task scheduling in the embodiment of the application, at least one type of task request information to be executed is obtained, corresponding tasks to be executed are generated according to the task request information, a plurality of task to be executed are obtained to generate task execution queues in response to the fact that the current scene meets the preset trigger condition, the tasks to be executed in the task execution queues are sequentially sent to corresponding execution bodies, and the task request information of different types can be unified to adapt to different operation requests, so that operation resources are saved.
It should be understood that the description of this section is not intended to identify key or critical features of the embodiments of the application or to delineate the scope of the application. Other features of the present application will become apparent from the description that follows.
Drawings
The drawings are for better understanding of the present solution and do not constitute a limitation of the present application. Wherein:
FIG. 1 an exemplary system architecture in which the present application may be applied;
FIG. 2 is a flow chart of one embodiment of a method for task scheduling according to the present application;
FIG. 3 is a schematic illustration of one application scenario of a method for task scheduling according to the present application;
FIG. 4 is a schematic structural diagram of one embodiment of an apparatus for task scheduling according to the present application;
fig. 5 is a block diagram of an electronic device suitable for use in implementing the method for task scheduling of embodiments of the present application.
Detailed Description
Exemplary embodiments of the present application are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present application to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
FIG. 1 illustrates an exemplary system architecture 100 to which embodiments of the methods, apparatus, electronic devices, and computer-readable storage media for task scheduling of the present application may be applied.
As shown in fig. 1, a system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or transmit task request information or the like. Various cloud client applications, such as a cloud play class application, a cloud storage class application, a cloud development class application, and the like, may be installed on the terminal devices 101, 102, 103.
The terminal devices 101, 102, 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various electronic devices with display screens, including but not limited to smartphones, tablets, laptop and desktop computers, and the like. When the terminal devices 101, 102, 103 are software, they can be installed in the above-listed electronic devices. Which may be implemented as multiple software or software modules (e.g., to implement a service for task scheduling), or as a single software or software module. The present invention is not particularly limited herein.
The server 105 may be a server that provides various services, for example, through the network 104, generates tasks to be executed in a standard format according to the acquired request information, and generates task execution queues according to the current scenario meeting a preset trigger condition, and sequentially sends the tasks to be executed in the task execution queues to corresponding execution subjects.
It should be noted that, the method for task scheduling provided in the embodiments described later is generally performed by the server 105, and accordingly, the device for task scheduling is generally disposed in the server 105.
It should be noted that the task to be executed may be stored locally on the server 105, or may be stored in the terminal devices 101, 102, 103 in a scattered manner according to all possible special requirements in the practical application scenario, where the terminal devices 101, 102, 103 may be original or backup, which is not limited herein specifically. When the terminal devices 101, 102, 103 are virtual machines running on the server 105, the exemplary system architecture 100 may also not include the terminal devices 101, 102, 103 and the network 104.
It should be further noted that an application for task scheduling may be installed in the terminal devices 101, 102, 103, and the terminal devices 101, 102, 103 may also complete acquiring task request information, generate a task to be executed in a standard format according to the acquired request information, respond to a preset trigger condition met by a current scene, acquire a plurality of task to be executed to generate task execution queues, and sequentially send the task to be executed in the task execution queues to a corresponding execution body. At this time, the method for task scheduling may also be performed by the terminal apparatuses 101, 102, 103, and correspondingly, the means for task scheduling may also be provided in the terminal apparatuses 101, 102, 103. At this point, the exemplary system architecture 100 may also not include the server 105 and the network 104.
The server 105 may be hardware or software. When the server 105 is hardware, it may be implemented as a distributed server cluster formed by a plurality of servers, or as a single server. When the server is software, it may be implemented as a plurality of software or software modules (e.g., to provide push information services), or as a single software or software module. The present invention is not particularly limited herein.
It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to FIG. 2, one embodiment of a process 200 for task scheduling in accordance with the present application is shown. The method for task scheduling comprises the following steps:
step 201, obtaining at least one type of task request information to be executed, and generating a task to be executed in a standard format according to the task request information.
In this embodiment, the execution body (e.g., the server 105 or the terminal devices 101, 102, 103 shown in fig. 1) for task scheduling may acquire task request information from a local or non-local man-machine interaction device (e.g., the terminal devices 101, 102, 103 shown in fig. 1).
Specifically, at least one type of task request information to be executed can be obtained according to the use property of the product, and tasks to be executed in a standard format are correspondingly generated according to the task request information to be executed, so that an execution main body of task scheduling can uniformly process the tasks to be executed, which are obtained according to the task request information of different types, by using the same strategy.
The task to be executed in the standard format refers to a type of task which can be regarded as the same type by the execution subject, or the execution subject can process the same type of task simultaneously by using the same or same type of strategy, and the execution subject of the task scheduling method can monitor the effectiveness of the task to be executed according to the content and the running condition of the task to be executed in the standard format.
It should be understood that, after generating the task to be executed in the standard format, a category label of the corresponding task request information may be added to the task to be executed, so as to realize the distinction of the task to be executed.
It should be understood that, when the executing subject has a save condition (for example, a storage device with a save function is provided in the local area of the executing subject), the generated task to be executed may be saved in the local area of the executing subject, or may be saved in a pre-built database, or may be saved in another independent storage medium independent of the executing subject, which is not limited in this application.
Taking order type task request information, automatic renewal type task request information and timing type task request information as examples, the task request information belongs to tasks with retry properties when being executed, but uniform scheduling cannot be performed due to different retry strategies.
The order task request information refers to request information related to use of order information, generally refers to a request of a user for purchasing, managing and counting a specific commodity, and a common scene is that a buyer sends an order to a seller through a cloud system to make shopping or a warehouse manager realizes logistics management according to a commodity entering order and a commodity discharging order.
The automatic renewal task request information refers to the task request of automatically renewing and paying the fee when the service period expires, and the more common generation scenario is that in the payment authorization process, the two parties automatically pay when the agreed authorization expires after negotiating, so that the automatic renewal task request is sent out when the authorization period interface.
The timing task request information refers to task requests for automatically executing corresponding tasks when a preset time point or interval time meets a preset time interval, and a more common scenario is to execute the corresponding tasks when the rule is met according to a preset time calculation rule, for example, the task is formulated to pay electricity fee 10 per month, and the request information for paying the electricity fee is sent when the time condition reaches 10 per month.
It can be seen that although the policy of the retrieval is not necessarily the same due to the change of the data and the different properties of the task, the task request information is essentially repeated retrieval of the task, and the classified retrieval causes the waste of operation resources.
Step 202, obtaining a plurality of task to be executed to generate a task execution queue in response to the current scene meeting a preset trigger condition.
Specifically, the current scenario may set a corresponding application scenario according to different task purposes and cloud platform purposes, or according to actual needs of a user, and when the scenario is satisfied, the execution main body executes a task queue generating operation for acquiring a task to be executed.
The task queue may arrange a plurality of tasks to be executed according to a predetermined rule, for example, an acquisition time rule, an urgency rule, a task category priority rule, and the like.
For example, the generation time of the first task to be executed is 00:35, and the generation time of the second task to be executed is 00:40, the generation time of the task III to be executed is 00:38, and the time for acquiring the task operation to be executed is 01:00, after the three tasks to be executed are acquired, arranging a plurality of tasks to be executed in sequence from far to near according to the execution time of the task operation to be executed, which is equivalent to arranging the tasks to be executed in sequence according to the time when the tasks to be executed are generated, wherein the sequence of the tasks to be executed in the generated queue is the first task to be executed, the third task to be executed and the second task to be executed.
In some optional implementations of embodiments of the present application, the current scenario includes at least: the time of last acquiring task request information at the current time interval, the number of tasks to be executed in a task execution queue, the proportion of one type of task in the task execution queue or the preset proportion.
Specifically, the application scenario may determine by referring to the time of last obtaining task request information at the current time interval, the number of tasks to be executed in the task execution queue, and the proportion of tasks in the task execution queue or the information of a preset proportion, and by this triggering manner, the cycle operation of the execution main body may be set according to the actual requirement of the user, so as to improve the running efficiency.
And 203, sequentially sending the tasks to be executed in the task execution queue to the corresponding execution main bodies.
Specifically, after the task execution queue is generated, the execution main body of task scheduling can sequentially extract the tasks to be executed from the task execution queue, and send the tasks to the corresponding execution main body according to the content of the tasks to be executed, so as to complete task scheduling.
The task scheduling execution main body determines what task request information the task to be executed generates according to the content or the marking condition of the task, judges the purpose of the task to be executed, finds the execution main body for executing the task to be executed through the service discovery function, obtains the address information of the execution main body, and then performs communication connection with the execution main body based on a hypertext transfer protocol (Hyper Text Transfer Protocol, abbreviated as HTTP) to perform the sending work of the task to be executed.
According to the method for task scheduling, at least one type of task request information to be executed is taken, corresponding tasks to be executed are generated according to the task request information, a plurality of task to be executed generating task execution queues are obtained in response to the fact that a current scene meets a preset trigger condition, and the tasks to be executed in the task execution queues are sequentially sent to corresponding execution bodies. By the method for task scheduling, task request information of different categories can be unified to adapt to different operation requests, and operation resources are saved.
In some optional implementations of this embodiment, the method shown above further includes: and in response to determining that the currently executed task to be executed is generated according to the timing type task request information, updating the execution time in the task to be executed to the next execution time.
Specifically, based on the above expression, the timing request task usually has a continuous execution relationship in the execution process, for example, after the time interval determined is used as a condition for executing the task to be executed corresponding to the timing request information last time, the task to be executed corresponding to the timing request information is executed again after the time interval determined is passed, so after the task to be executed corresponding to the timing request information is executed last time, the time for executing the task to be executed next time can be determined based on the time point at which the task to be executed last time and the time interval determined, so as to update the execution time in the task to be executed next time, thereby avoiding repeatedly acquiring the timing request information and wasting operation resources.
In some optional implementations of the present embodiment, obtaining a plurality of task execution queues for tasks to be executed in response to the current scenario meeting a preset trigger condition includes: and responding to the current scene meeting the preset trigger condition, acquiring a plurality of task execution queues generated by the task to be executed, and extracting the task execution queues generated by the task to be executed from a task list generated according to the task to be executed.
Specifically, after the task to be executed is generated, the execution main body of task scheduling can generate a corresponding task list according to the task to be executed so as to collect the task to be executed, know the specific condition of the currently existing task to be executed, facilitate the subsequent extraction of the task to be executed from the task list to generate a task execution queue, and improve the overall flow efficiency.
In some optional implementations of this embodiment, sending the task to be executed to the corresponding execution body according to the task execution queue further includes: and responding to the failure of determining to send the execution task to the corresponding execution subject, and sending out a failure alarm.
Specifically, it may be determined whether the execution body of task scheduling successfully transmits the task to be executed to the corresponding execution body, for example, when the execution body fails to transmit the task to be executed to the corresponding execution body, a failure alarm signal is sent, or a communication connection between the execution body of task scheduling and the corresponding execution body may be interacted, after the transmission is completed, the corresponding execution body sends a response signal to feed back the transmission condition to the execution body of task scheduling, so as to determine whether the execution body of task scheduling successfully transmits the task to the corresponding execution body.
When the execution main body of task scheduling is judged to not successfully send the task to be executed to the corresponding execution main body, an alarm signal is sent to prompt, so that the execution main body of task scheduling or a user can make a related strategy according to the result in time.
In some optional implementations of this embodiment, further comprising: in response to detecting the manual intervention request, executing an operation corresponding to the manual intervention request; wherein the manual intervention request comprises: at least one of an alarm receiver request, a feedback task operation record request, a feedback task information request, a feedback task statistical data request and a task execution sequence adjustment request is adjusted.
Specifically, when the human intervention request signal is detected, the signal is responded and the operation requested in the signal is analyzed, for example, the operation requested in the signal can at least comprise one of the following requests: the alarm receiver requests are adjusted to realize feedback of task execution failure results to different supervisory personnel, the task operation record requests are fed back to realize feedback of operation conditions, a user can conveniently know operation processes, the task information requests are fed back to realize feedback of task request information, the user can conveniently know the types and the amounts of task request information corresponding to tasks to be executed, the task statistics data requests are fed back, the user can conveniently obtain the number of task execution conditions, the task execution sequence requests are adjusted, and the execution sequence of the tasks to be executed is adjusted and planned according to different requirements.
Based on the method, the execution main body of task scheduling can realize corresponding operation according to the request analysis result, meet the manual corresponding requirement, expand the functions in a manual interaction mode, feed back the task scheduling condition and improve the applicability.
Further, to deepen understanding, the present application further provides an implementation scheme under another specific situation in combination with a specific application scenario, as shown in fig. 3, in the actual application scenario, an execution main body a for executing the task scheduling method acquires an order task request B, an automatic renewal task request C and a timing task request D from other main bodies A1.
The execution main body A acquires an order task request B, an automatic renewal task request C and a timing task request D, generates tasks E1, E2 and E3 to be executed in a standard format according to recorded contents, and sends E1, E2 and E3 and a task list G generated according to E1, E2 and E3 to a database F for storage.
And in response to the time interval of last acquiring the task to be executed from the current time distance is 5 seconds, acquiring the tasks to be executed E1, E2 and E3 from the database F according to the task list G, determining the time sequence of the tasks to be executed in the task queue according to the time sequence of acquiring the task request information B, C, D, and generating a task execution queue H, wherein the task sequence in the task execution queue H is E1, E2 and E3.
The execution body a is communicatively connected with execution bodies L1, L2, L3 that can be used to execute the tasks E1, E2, E3 to be executed, by the HTTP protocol after finding out the communication addresses of L1, L2, L3.
According to the order in the task execution queue H, the tasks E1, E2, E3 are sent to the corresponding execution bodies L1, L2, L3, respectively.
And receiving feedback of the execution bodies L2 and L3 within a preset time, and judging that the scheduling of the tasks L2 and L3 to be executed is completed and the scheduling of the task E1 to be executed fails.
And in response to determining that the task E1 to be executed fails to be scheduled, sending an alarm signal to a pre-designated alarm receiver A.
The executing body A responds to the manual intervention request sent by the first, analyzes the manual intervention request, obtains an analysis result that the request change alarm receiver is second, requests to feed back task operation records and requests to feed back information of the task E1 to be executed to the first.
The executing body responds to the request information in the manual intervention request, changes the alarm receiving person B, and feeds back the task running record and the information of the task E1 to be executed to the first person.
As can be clearly seen from the method for task scheduling shown in the specific application scenario, the execution main body of the task scheduling method acquires three different types of task request information to be executed, generates corresponding tasks to be executed, acquires a plurality of task to be executed to generate task execution queues when the current scenario meets a preset trigger condition, and sequentially sends the tasks to be executed in the task execution queues to the corresponding execution main body. The task request information of different categories can be unified to adapt to different operation requests, and operation resources are saved.
With further reference to fig. 4, as an implementation of the method shown in the foregoing figures, the present application provides an embodiment of an apparatus for task scheduling, where the embodiment of the apparatus corresponds to the embodiment of the method shown in fig. 2, and the apparatus may be specifically applied to various electronic devices.
As shown in fig. 4, the task scheduling device 400 for the present embodiment may include: a request information obtaining unit 401 configured to obtain at least one type of task request information to be executed, and generate a task to be executed in a standard format according to the task request information; an execution queue generating unit 402 configured to obtain a plurality of task execution queues generated by the task to be executed in response to the current scene meeting a preset trigger condition; the task sending unit 403 is configured to send the tasks to be executed in the task execution queue to the corresponding execution body in sequence.
In the present embodiment, the task scheduling device 400 is used for: the specific processes of the request information obtaining unit 401, the execution queue generating unit 402, and the task sending unit 403 and the technical effects thereof may refer to the relevant descriptions of steps 201 to 203 in the corresponding embodiment of fig. 2, and are not repeated herein.
In some optional implementations of this embodiment, the category of the request information in the request information obtaining unit 401 includes at least one of the following: order type task request information, automatic renewal type task request information, and timing type task request information.
In some optional implementations of this embodiment, the apparatus shown above further includes: and a task information updating unit configured to update the execution time in the task to be executed to the next execution time in response to determining that the task to be executed currently is generated according to the timing-type task request information.
In some optional implementations of this embodiment, the current scenario in the execution queue generating unit 402 includes at least: the time of last acquiring the task request information at the current time interval, the number of tasks to be executed in the task execution queue, the proportion of one type of task in the task execution queue or the preset proportion.
In some optional implementations of the present embodiment, the execution queue generating unit 402 is further configured to: and responding to the current scene meeting the preset trigger condition, acquiring a plurality of task execution queues for generating tasks to be executed, and extracting the task execution queues for generating the tasks to be executed from a task list generated according to the tasks to be executed.
In some optional implementations of this embodiment, the apparatus shown above further includes: and the alarm subunit is configured to send out a failure alarm in response to determining that the execution task fails to be sent to the corresponding execution subject.
In some optional implementations of this embodiment, the apparatus shown above further includes: a manual intervention response unit 404 configured to perform an operation corresponding to the manual intervention request in response to detecting the manual intervention request; wherein the manual intervention request comprises: at least one of an alarm receiver request, a feedback task operation record request, a feedback task information request, a feedback task statistical data request and a task execution sequence adjustment request is adjusted.
The present embodiment exists as an apparatus embodiment corresponding to the above method embodiment, and the same references are made to the description of the above method embodiment, which is not repeated. By the device for task scheduling, task request information of different categories can be unified to adapt to different operation requests, and operation resources are saved.
According to embodiments of the present application, an electronic device and a readable storage medium are also provided.
As shown in fig. 5, is a block diagram of an electronic device for a method of task scheduling according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the application described and/or claimed herein.
As shown in fig. 5, the electronic device includes: one or more processors 501, memory 502, and interfaces for connecting components, including high-speed interfaces and low-speed interfaces. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions executing within the electronic device, including instructions stored in or on memory to display graphical information of the GUI on an external input/output device, such as a display device coupled to the interface. In other embodiments, multiple processors and/or multiple buses may be used, if desired, along with multiple memories and multiple memories. Also, multiple electronic devices may be connected, each providing a portion of the necessary operations (e.g., as a server array, a set of blade servers, or a multiprocessor system). One processor 501 is illustrated in fig. 5.
Memory 502 is a non-transitory computer readable storage medium provided herein. The memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method for task scheduling provided herein. The non-transitory computer readable storage medium of the present application stores computer instructions for causing a computer to perform the method for task scheduling provided herein.
The memory 502 is a non-transitory computer readable storage medium, and may be used to store a non-transitory software program, a non-transitory computer executable program, and modules, such as program instructions/modules (e.g., the request information acquiring unit 401, the execution queue generating unit 402, and the task transmitting unit 403 shown in fig. 4) corresponding to the method for task scheduling in the embodiment of the present application. The processor 501 executes various functional applications of the server and data processing, i.e., implements the method for task scheduling in the above-described method embodiments, by running non-transitory software programs, instructions, and modules stored in the memory 502.
Memory 502 may include a storage program area that may store an operating system, at least one application program required for functionality, and a storage data area; the storage data area may store data created from the use of the electronic device pushing the information, etc. In addition, memory 502 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory 502 may optionally include memory located remotely from the processor 501, which may be connected to the information pushing electronic device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The electronic device for the method of task scheduling may further include: an input device 503 and an output device 504. The processor 501, memory 502, input devices 503 and output devices 504 may be connected by a bus or otherwise, for example in fig. 5.
The input device 503 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic device for task scheduling, such as a touch screen, a keypad, a mouse, a trackpad, a touchpad, a pointer stick, one or more mouse buttons, a trackball, a joystick, and the like. The output devices 504 may include a display device, auxiliary lighting devices (e.g., LEDs), and haptic feedback devices (e.g., vibration motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device may be a touch screen.
Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASIC (application specific integrated circuit), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be a special or general purpose programmable processor, operable to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.
These computing programs (also referred to as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented in a high-level procedural and/or object-oriented programming language, and/or in assembly/machine language. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present application may be performed in parallel, sequentially, or in a different order, provided that the desired results of the technical solutions disclosed in the present application can be achieved, and are not limited herein.
The above embodiments do not limit the scope of the application. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present application are intended to be included within the scope of the present application.
Claims (8)
1. A method for task scheduling, comprising:
obtaining at least one type of task request information to be executed, and generating a standard format task to be executed according to the task request information, wherein the type of the task request information at least comprises one of the following: the method comprises the steps of requesting task information by an order form, automatically renewing the task request information and timing task request information, wherein the tasks to be executed in a standard format comprise tasks which are regarded as the same type and tasks which are processed simultaneously by using the same or the same type of strategies;
responding to the current scene meeting a preset trigger condition, obtaining a plurality of tasks to be executed to generate task execution queues, wherein the current scene at least comprises: the time of last obtaining the task request information at the current time interval, the number of tasks to be executed in the task execution queue, the proportion of one type of task in the task execution queue or the preset proportion;
sequentially sending the tasks to be executed in the task execution queue to a corresponding execution main body;
in response to determining that the currently executed task to be executed is generated according to timing task request information, updating the execution time in the task to be executed to the next execution time;
the step of responding to the current scene meeting the preset trigger condition to obtain a plurality of tasks to be executed to generate task execution queues, comprises the following steps: and responding to the current scene meeting a preset trigger condition, acquiring a plurality of task execution queues generated by the task to be executed, and extracting the task execution queues generated by the task to be executed from a task list generated according to the task to be executed.
2. The method of claim 1, wherein sending the task to be executed to a corresponding execution body in accordance with the task execution queue further comprises:
and responding to the failure of determining to send the execution task to the corresponding execution subject, and sending out a failure alarm.
3. The method of any of claims 1-2, further comprising:
in response to detecting the manual intervention request, executing an operation corresponding to the manual intervention request; wherein the manual intervention request comprises: at least one of an alarm receiver request, a feedback task operation record request, a feedback task information request, a feedback task statistical data request and a task execution sequence adjustment request is adjusted.
4. An apparatus for task scheduling, comprising:
the system comprises a request information acquisition unit, a storage unit and a storage unit, wherein the request information acquisition unit is configured to acquire at least one type of task request information to be executed, and generate a standard format task to be executed according to the task request information, and the type of the task request information at least comprises one of the following: the method comprises the steps of requesting task information by an order form, automatically renewing the task request information and timing task request information, wherein the tasks to be executed in a standard format comprise tasks which are regarded as the same type and tasks which are processed simultaneously by using the same or the same type of strategies;
the execution queue generating unit is configured to obtain a plurality of task execution queues for generating tasks to be executed in response to the fact that a current scene meets a preset trigger condition, and the current scene at least comprises: the time of last obtaining the task request information at the current time interval, the number of tasks to be executed in the task execution queue, the proportion of one type of task in the task execution queue or the preset proportion;
the task sending unit is configured to send the tasks to be executed in the task execution queue to the corresponding execution main bodies in sequence;
a task information updating unit configured to update execution time in the task to be executed to next execution time in response to determining that the task to be executed currently is generated according to timing-type task request information;
the execution queue generating unit is further configured to: and responding to the current scene meeting a preset trigger condition, acquiring a plurality of task execution queues generated by the task to be executed, and extracting the task execution queues generated by the task to be executed from a task list generated according to the task to be executed.
5. The apparatus of claim 4, wherein the task transmitting unit further comprises:
and the alarm subunit is configured to send out a failure alarm in response to determining that the execution task fails to be sent to the corresponding execution subject.
6. The apparatus of any of claims 4-5, further comprising:
a manual intervention response unit configured to perform an operation corresponding to the manual intervention request in response to detecting the manual intervention request; wherein the manual intervention request comprises: at least one of an alarm receiver request, a feedback task operation record request, a feedback task information request, a feedback task statistical data request and a task execution sequence adjustment request is adjusted.
7. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein, the liquid crystal display device comprises a liquid crystal display device,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-3.
8. A non-transitory computer-readable storage medium storing computer instructions comprising: the computer instructions for causing the computer to perform the method of any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010697771.6A CN111831420B (en) | 2020-07-20 | 2020-07-20 | Method for task scheduling, related device and computer program product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010697771.6A CN111831420B (en) | 2020-07-20 | 2020-07-20 | Method for task scheduling, related device and computer program product |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111831420A CN111831420A (en) | 2020-10-27 |
| CN111831420B true CN111831420B (en) | 2023-08-08 |
Family
ID=72924144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010697771.6A Active CN111831420B (en) | 2020-07-20 | 2020-07-20 | Method for task scheduling, related device and computer program product |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111831420B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112367205B (en) * | 2020-11-12 | 2023-04-18 | 深圳前海微众银行股份有限公司 | Processing method and scheduling system for HTTP scheduling request |
| CN112486648A (en) * | 2020-11-30 | 2021-03-12 | 北京百度网讯科技有限公司 | Task scheduling method, device, system, electronic equipment and storage medium |
| CN112561326A (en) * | 2020-12-15 | 2021-03-26 | 青岛海尔科技有限公司 | Task execution method and device, storage medium and electronic device |
| CN112905314A (en) * | 2021-01-27 | 2021-06-04 | 北京百度网讯科技有限公司 | Asynchronous processing method and device, electronic equipment, storage medium and road side equipment |
| CN112836987B (en) * | 2021-03-01 | 2022-12-09 | 拉扎斯网络科技（上海）有限公司 | Freight note scheduling method and device, computer storage medium and electronic equipment |
| CN113342665B (en) * | 2021-06-17 | 2023-10-20 | 北京百度网讯科技有限公司 | Task allocation method and device, electronic equipment and computer readable medium |
| CN113407329B (en) * | 2021-07-15 | 2024-01-30 | 北京百度网讯科技有限公司 | Task execution method, device, equipment and storage medium |
| CN113835859B (en) * | 2021-09-24 | 2023-12-26 | 成都质数斯达克科技有限公司 | Task scheduling method, device, equipment and readable storage medium |
| CN113867916A (en) * | 2021-09-28 | 2021-12-31 | 北京百度网讯科技有限公司 | Task processing method and device and electronic equipment |
| CN113806058A (en) * | 2021-10-09 | 2021-12-17 | 京东科技控股股份有限公司 | Task management method and device, storage medium and electronic equipment |
| CN113986497B (en) * | 2021-10-27 | 2022-11-22 | 北京百度网讯科技有限公司 | Queue scheduling method, device and system based on multi-tenant technology |
| CN114185612B (en) * | 2021-11-30 | 2023-08-08 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for updating data |
| CN114757278B (en) * | 2022-04-15 | 2022-12-16 | 北京科杰科技有限公司 | Invalid task processing method and device, computer equipment and storage medium |
| CN115080205B (en) * | 2022-05-27 | 2023-07-25 | 北京百度网讯科技有限公司 | Task execution method, device, electronic equipment and readable storage medium |
| CN117041497A (en) * | 2022-09-09 | 2023-11-10 | 北京百度网讯科技有限公司 | Video processing method, device, electronic equipment and storage medium |
| CN115756798A (en) * | 2022-11-25 | 2023-03-07 | 中电金信软件有限公司 | Task scheduling method and device, electronic equipment and computer readable storage medium |
| CN115756800B (en) * | 2022-11-28 | 2024-04-09 | 中电金信软件有限公司 | Task scheduling method and task scheduling device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106126354A (en) * | 2016-06-21 | 2016-11-16 | 中国建设银行股份有限公司 | A kind of asynchronous batch processing method and system |
| WO2018072687A1 (en) * | 2016-10-19 | 2018-04-26 | 华为技术有限公司 | Resource scheduling method and apparatus, and filtered scheduler |
| CN108958922A (en) * | 2017-05-17 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Method and apparatus for executing task |
| CN109743390A (en) * | 2019-01-04 | 2019-05-10 | 深圳壹账通智能科技有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| WO2019237593A1 (en) * | 2018-06-13 | 2019-12-19 | 平安科技（深圳）有限公司 | Task processing method and apparatus, and computer device and storage medium |
| EP3598302A1 (en) * | 2018-07-20 | 2020-01-22 | Fujitsu Limited | Method and apparatus for managing effectiveness of information processing task |
| CN111158888A (en) * | 2019-12-31 | 2020-05-15 | 北京明略软件系统有限公司 | Multi-task scheduling method and device |
| CN111221638A (en) * | 2020-01-03 | 2020-06-02 | 北京字节跳动网络技术有限公司 | Scheduling processing method, device, equipment and medium for concurrent tasks |
-
2020
- 2020-07-20 CN CN202010697771.6A patent/CN111831420B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106126354A (en) * | 2016-06-21 | 2016-11-16 | 中国建设银行股份有限公司 | A kind of asynchronous batch processing method and system |
| WO2018072687A1 (en) * | 2016-10-19 | 2018-04-26 | 华为技术有限公司 | Resource scheduling method and apparatus, and filtered scheduler |
| CN108958922A (en) * | 2017-05-17 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Method and apparatus for executing task |
| WO2019237593A1 (en) * | 2018-06-13 | 2019-12-19 | 平安科技（深圳）有限公司 | Task processing method and apparatus, and computer device and storage medium |
| EP3598302A1 (en) * | 2018-07-20 | 2020-01-22 | Fujitsu Limited | Method and apparatus for managing effectiveness of information processing task |
| CN109743390A (en) * | 2019-01-04 | 2019-05-10 | 深圳壹账通智能科技有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| CN111158888A (en) * | 2019-12-31 | 2020-05-15 | 北京明略软件系统有限公司 | Multi-task scheduling method and device |
| CN111221638A (en) * | 2020-01-03 | 2020-06-02 | 北京字节跳动网络技术有限公司 | Scheduling processing method, device, equipment and medium for concurrent tasks |
Non-Patent Citations (1)
| Title |
|---|
| R. Venkatesan等.Scheduling framework for queuing and advanced reservation using TBRA in grid computing environments: Trust based resource agent.2011 IEEE 3rd International Conference on Communication Software and Networks.2011,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111831420A (en) | 2020-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111831420B (en) | Method for task scheduling, related device and computer program product | |
| EP3304315B1 (en) | Automatic anomaly detection and resolution system | |
| US20200028760A1 (en) | Automated service-oriented performance management | |
| CN107729139B (en) | Method and device for concurrently acquiring resources | |
| US9961017B2 (en) | Demand policy-based resource management and allocation system | |
| CN110083455B (en) | Graph calculation processing method, graph calculation processing device, graph calculation processing medium and electronic equipment | |
| US11876817B2 (en) | Modeling queue-based message-oriented middleware relationships in a security system | |
| US10732964B2 (en) | Systems and methods for updating multi-tier cloud-based application stacks | |
| US8538793B2 (en) | System and method for managing real-time batch workflows | |
| US11818152B2 (en) | Modeling topic-based message-oriented middleware within a security system | |
| WO2019200984A1 (en) | Life cycle management method for distributed application, managers, device and medium | |
| US9015731B2 (en) | Event handling system and method | |
| US20220179711A1 (en) | Method For Platform-Based Scheduling Of Job Flow | |
| WO2016022925A2 (en) | Policy based resource management and allocation system | |
| CN112491617A (en) | Link tracking method, device, electronic equipment and medium | |
| CN111586177B (en) | Cluster session loss prevention method and system | |
| CN101495978B (en) | Reduction of message flow between bus-connected consumers and producers | |
| US10191844B2 (en) | Automatic garbage collection thrashing monitoring | |
| CN114846490A (en) | Quantifying use of robot process automation related resources | |
| CN111782341B (en) | Method and device for managing clusters | |
| CN113760638A (en) | Log service method and device based on kubernets cluster | |
| CN111597026B (en) | Method and device for acquiring information | |
| CN112099933B (en) | Task operation and query method and device, electronic equipment and storage medium | |
| CN111338882A (en) | Data monitoring method, device, medium and electronic equipment | |
| US20230185472A1 (en) | Dynamic system workload placement in cloud infrastructures |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |