CN117076076A - Task processing method, device, computer equipment and storage medium - Google Patents

Task processing method, device, computer equipment and storage medium Download PDF

Info

Publication number
CN117076076A
CN117076076A CN202311049426.1A CN202311049426A CN117076076A CN 117076076 A CN117076076 A CN 117076076A CN 202311049426 A CN202311049426 A CN 202311049426A CN 117076076 A CN117076076 A CN 117076076A
Authority
CN
China
Prior art keywords
task
application
target
task execution
identifier
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311049426.1A
Other languages
Chinese (zh)
Inventor
刘迪
王晨
姚得时
杨斌
吴维志
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kingdee Deeking Cloud Computing Co ltd
Original Assignee
Kingdee Deeking Cloud Computing Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Kingdee Deeking Cloud Computing Co ltd filed Critical Kingdee Deeking Cloud Computing Co ltd
Priority to CN202311049426.1A priority Critical patent/CN117076076A/en
Publication of CN117076076A publication Critical patent/CN117076076A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5066Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The application relates to a task processing method, a task processing device and computer equipment. The method comprises the following steps: generating a corresponding application number in response to an application starting signal sent by a task execution application, sending the application number to the task execution application and obtaining a corresponding task scheduling demand parameter; requesting to call an application state detection interface of the task execution application, sending a state detection signal, receiving state data returned by the task execution application based on the state detection signal, and acquiring a task identifier of a task to be executed when the state data accords with preset usable state data; establishing a task association relationship between a task identifier and an application number based on the task scheduling demand parameters; and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to an application number in an association relation based on task scheduling requirement parameters and executes a task to be executed corresponding to the task identifier. By adopting the method, the task processing efficiency can be improved.

Description

Task processing method, device, computer equipment and storage medium
Technical Field
The present application relates to the field of computer technology, and in particular, to a task processing method, apparatus, computer device, storage medium, and computer program product.
Background
Currently, with the business development of internet companies and the like, multitasking, high concurrency scenarios have become very popular, and the complexity of a single task and the number of concurrent tasks have increased. To solve the problem that a single server cannot provide enough performance to handle a single complex, tasks may be performed by multiple execution machines deployed in a distributed manner. However, there is a problem of abnormal execution of a plurality of execution machines distributed, and a task center is required to redistribute and send tasks to other execution machines, resulting in a problem of low task processing efficiency.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a task processing method, apparatus, computer device, computer-readable storage medium, and computer program product that can improve task processing efficiency.
In a first aspect, the present application provides a task processing method. The method comprises the following steps:
responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
An application state detection interface of a task execution application is requested to be called, a state detection signal is sent to the application state detection interface, state data returned by the task execution application based on the state detection signal is received, and when the state data accords with preset usable state data, a task identifier of a task to be executed is obtained;
establishing a task association relationship between a task identifier and an application number based on the task scheduling demand parameters;
and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
In a second aspect, the application further provides a task processing device. The device comprises:
the numbering module is used for responding to an application starting signal sent by the task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
the state detection module is used for requesting to call an application state detection interface of the task execution application, sending a state detection signal to the application state detection interface, receiving state data returned by the task execution application based on the state detection signal, and acquiring a task identifier of a task to be executed when the state data accords with preset usable state data;
The association module is used for establishing a task association relation between the task identification and the application number based on the task scheduling demand parameters;
the execution module is used for acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor which when executing the computer program performs the steps of:
responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
an application state detection interface of a task execution application is requested to be called, a state detection signal is sent to the application state detection interface, state data returned by the task execution application based on the state detection signal is received, and when the state data accords with preset usable state data, a task identifier of a task to be executed is obtained;
Establishing a task association relationship between a task identifier and an application number based on the task scheduling demand parameters;
and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
In a fourth aspect, the present application also provides a computer-readable storage medium. The computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
an application state detection interface of a task execution application is requested to be called, a state detection signal is sent to the application state detection interface, state data returned by the task execution application based on the state detection signal is received, and when the state data accords with preset usable state data, a task identifier of a task to be executed is obtained;
Establishing a task association relationship between a task identifier and an application number based on the task scheduling demand parameters;
and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
In a fifth aspect, the present application also provides a computer program product. The computer program product comprises a computer program which, when executed by a processor, implements the steps of:
responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
an application state detection interface of a task execution application is requested to be called, a state detection signal is sent to the application state detection interface, state data returned by the task execution application based on the state detection signal is received, and when the state data accords with preset usable state data, a task identifier of a task to be executed is obtained;
Establishing a task association relationship between a task identifier and an application number based on the task scheduling demand parameters;
and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
According to the task processing method, the device, the computer equipment, the storage medium and the computer program product, the task scheduling requirement parameters corresponding to the task execution application are obtained by generating the application numbers corresponding to the task execution application, and the application state detection interface of the task execution application is called to carry out state detection, so that the task execution application in a usable state can be determined. And then acquiring the task identification, and establishing an association relation between the task identification and the application number according to the task scheduling demand parameter, so that the task to be executed can be allocated to the task execution application in a usable state according to a task scheduling mode represented by the task scheduling parameter corresponding to the task execution application, and the safety of task scheduling is ensured. Therefore, the task execution application automatically determines the task identification in the association relation according to the task scheduling parameters, and the task execution application does not need to wait for triggering the execution task, so that the task processing efficiency of the task execution application is improved.
Drawings
FIG. 1 is an application environment diagram of a task processing method in one embodiment;
FIG. 2 is a flow diagram of a task processing method in one embodiment;
FIG. 3 is a flow chart of task processing steps in one embodiment;
FIG. 4 is a flow diagram of task generation in one embodiment;
FIG. 5 is a flow diagram of task execution application registration in one embodiment;
FIG. 6 is a flow diagram of task scheduling in one embodiment;
FIG. 7 is a flow chart of task scheduling in another embodiment;
FIG. 8 is a block diagram of a task processing device in one embodiment;
FIG. 9 is an internal block diagram of a computer device in one embodiment;
fig. 10 is an internal structural view of a computer device in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The task processing method provided by the embodiment of the application can be applied to an application environment shown in figure 1. Wherein the terminal 102 communicates with the server 104 via a network. The data storage system may store data that the server 104 needs to process. The data storage system may be integrated on the server 104 or may be located on a cloud or other network server. The server 104 responds to an application starting signal sent by the task execution application, generates an application number corresponding to the task execution application, sends the application number to the task execution application 106, and obtains task scheduling requirement parameters sent by the task execution application 106 based on the application number; the server 104 may respond to the task scheduling instruction sent by the terminal 102, where the server 104 requests to call an application state detection interface of the task execution application, sends a state detection signal to the application state detection interface, receives state data returned by the task execution application based on the state detection signal, and when the state data accords with preset usable state data, obtains a task identifier of a task to be executed; the server 104 establishes a task association relationship between the task identification and the application number based on the task scheduling demand parameters; the server 104 obtains task completion information returned by the task execution application 106, wherein the task completion information is generated after the task execution application 106 determines a task identifier corresponding to the application number in an association relationship based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier. The task execution application refers to a device capable of performing task processing, such as a terminal device or a server device. The terminal 102 may be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and the like. The server 104 may be implemented as a stand-alone server or as a server cluster of multiple servers.
In one embodiment, as shown in fig. 2, a task processing method is provided, and the method is applied to the server in fig. 1 for illustration, it is to be understood that the method may also be applied to a terminal, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the steps of:
step 202, in response to an application start signal sent by the task execution application, an application number corresponding to the task execution application is generated, the application number is sent to the task execution application, and task scheduling requirement parameters sent by the task execution application based on the application number are obtained.
The task execution application refers to an application for performing task processing, and may be a device, a machine, an execution unit, or the like. The start signal is a signal that characterizes that the task execution application can begin processing tasks. The application number refers to the identity corresponding to the task execution application. The task scheduling requirement parameters refer to requirement information of task execution application on task scheduling, and include an association relation establishment mode, an association relation storage mode, a transmission mode of an association relation storage address and the like.
Specifically, the server in this embodiment is used as a scheduling center for managing task execution applications, and scheduling and task progress monitoring of tasks to be executed. After the task execution application is started, an application starting signal is sent to a server, the server is used as a dispatching center to receive the application starting signal sent by the task execution application, when the application starting signal detects that the application to be executed is started for the first time, an application number corresponding to the application to be executed is generated, the application number is sent to the application to be executed, so that the application to be executed stores the corresponding application number, then the server obtains task dispatching requirement parameters corresponding to the task execution application, and the task dispatching requirement parameters comprise an association relation establishment mode, an association relation storage mode, a sending mode of an association relation storage address and the like. The association relation establishment mode is such as encryption mode, mapping relation between application number and intermediate value, task execution sequence and the like. The task execution order may be to mark task numbers by task time or task duration, etc.
Step 204, requesting to call an application state detection interface of the task execution application, sending a state detection signal to the application state detection interface, receiving state data returned by the task execution application based on the state detection signal, and acquiring a task identifier of the task to be executed when the state data accords with preset usable state data.
The application state detection interface is an interface preset in the task execution application and used for receiving state detection signals. The status detection signal is used for indicating the task execution application to perform status self-checking. The state data refers to detection data returned after the task executes the application state self-check. The preset usable state data refers to data representing a usable state of the task execution application.
Specifically, a task management center is preset, and the task management center may be a task management server or a task management terminal. The user can input task information to the task management center through the terminal, and the task management center generates a task to be executed and a corresponding task identifier according to the task information. And then the task management center sends a task scheduling instruction to the server, the server responds to the task scheduling instruction to call an application state detection interface corresponding to the task execution application to perform state detection, sends a state detection signal to the application state detection interface and receives state data returned by the task execution application. When the server detects that the state data is consistent with the preset usable state data, the task execution application is determined to be a normal task execution application in a normal use state. The server can also call application state detection interfaces corresponding to the task execution applications to perform state detection, and the server determines normal task execution applications in the task execution applications according to state data returned by the task execution applications. And then the server acquires the task identification from the task management center, and acquires the task to be executed corresponding to the task identification to be cached locally.
Step 206, establishing a task association relationship between the task identification and the application number based on the task scheduling requirement parameter.
Specifically, the server acquires an application number corresponding to a task execution application in a usable state of the application, acquires task scheduling information corresponding to the task execution application, establishes an association relationship between a task identifier and the application number according to the task scheduling information, and indicates that a task to be executed corresponding to the task identifier is allocated to the task execution application corresponding to the application number for processing according to task scheduling requirements of the task execution application. For example, the association relation is encrypted according to an encryption mode preset by the task execution application, or task identifications associated with application numbers corresponding to the task execution application are ordered according to a task execution sequence preset by the task execution application. And then the server detects that the association relation is established and then generates a task execution instruction corresponding to the task execution application.
In one embodiment, the server obtains an application number of the task execution application in at least one normal use state through state detection, and obtains at least one task identification from the task management center. The server can randomly distribute each task identifier to the task execution application, or can circularly distribute each task identifier to the task execution application according to the sequence of application numbers, and establishes an association relationship between the task identifier and the corresponding application number according to the task scheduling demand parameters. The server can determine the task execution sequence between the association relations corresponding to the application numbers according to the allocation time of the task identification or the ordering requirement set in the task scheduling demand parameters.
Step 208, task completion information returned by the task execution application is obtained, wherein the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relation based on the task scheduling requirement parameter and the application number and executes a task to be executed corresponding to the task identifier.
Specifically, when the task execution application starts to prepare to execute a task, traversing the association relations between each task identifier and the application number in the server, determining the association relation corresponding to the application number from each association relation, analyzing the association relation by using the task scheduling requirement parameter to obtain the task identifier, and executing the task to be executed corresponding to the task identifier. After the task is executed, the task execution application generates task completion information, the task completion information is sent to the server, and the server marks the task completion information in the corresponding association relation after receiving the task completion information.
In one embodiment, the server may store the association relationship between the task identifier and the application number corresponding to the task execution application in the local storage space, or may store the association relationship in the external storage space. The server receives a task query request sent by a task execution application, acquires a corresponding association relation storage address according to an application number carried by the task query request, and sends the association relation storage address to the task execution application corresponding to the task query request. The task execution application acquires the association relation between the corresponding task identification and the application number according to the association relation storage address, analyzes the association relation by using the task scheduling demand parameter, and acquires the corresponding task identification of the task execution application. The task execution application executes the task to be executed corresponding to the task identifier, and after the task execution is completed, the task execution application sends task completion information to the server.
In the task processing method, the task processing device, the computer equipment, the storage medium and the computer program product, the task execution application in a usable state can be determined by generating the application number corresponding to the task execution application, acquiring the task scheduling requirement parameter corresponding to the task execution application, and calling the application state detection interface of the task execution application to perform state detection. And then acquiring the task identification, and establishing an association relation between the task identification and the application number according to the task scheduling demand parameter, so that the task to be executed can be allocated to the task execution application in a usable state according to a task scheduling mode represented by the task scheduling parameter corresponding to the task execution application, and the safety of task scheduling is ensured. Therefore, the task execution application automatically determines the task identification in the association relation according to the task scheduling parameters, and the task execution application does not need to wait for triggering the execution task, so that the task processing efficiency of the task execution application is improved.
In one embodiment, as shown in fig. 3, after obtaining the task completion information returned by the task execution application in step 208, the method further includes:
step 302, an application state detection interface corresponding to a task execution application is called at regular time to send a state detection signal, and current state data returned by the task execution application based on the state detection signal is received;
Step 304, deleting a historical association relationship between an application number corresponding to the task execution application and a target task identifier when the current state data does not accord with the preset usable state data;
step 306, obtaining a target application number and a target task scheduling requirement parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and a target task identifier based on the target task scheduling requirement parameter, so that the target task execution application executes a target task corresponding to the target task identifier according to the target association relationship.
The current state data refers to state data returned by the task execution application based on the state detection information sent at regular time. The target task identity refers to a task identity associated with a task execution application that has not yet been executed.
Specifically, the server calls an application state detection interface corresponding to the task execution application at regular time according to a preset time point, sends a state detection signal to the application state detection interface, and acquires current state data returned by the task execution application. When the server detects that the current state data is inconsistent with the preset usable state data, the task execution application is determined to be an abnormal task execution application in an abnormal use state. The server acquires the application number of the abnormal task execution application, searches the historical association relationship between the application number and the target task identifier, and then deletes the association relationship. The server may determine the target task execution application among the normal task execution applications in each normal use state, for example, randomly select the target task execution application, or select the target task execution application according to the task amount of the task execution application, or the like. And then the server acquires a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishes a target association relation between the target application number and a target task identifier according to the target task scheduling demand parameter, so that the target task execution application determines the target task identifier according to the target association relation and executes a target task corresponding to the target task identifier.
In a specific embodiment, a task table and an application table are preset in the server, the task table is used for storing each task identifier obtained from the task management center by the server, and the application table is used for storing an application number and an application state corresponding to each task execution application. The application state is an application state determined according to state data after the server detects the state of the task execution application at regular time, wherein the application state comprises a normal use state and an abnormal use state, and the server marks the application state corresponding to each task execution in an application table. And the server responds to a task scheduling instruction sent by the task management center, acquires a task identifier to be allocated and records the task identifier in a task table. And then the server acquires the application number of the task execution application in the normal use state from the application table, and the server can allocate each task to be executed to the task execution application according to a preset scheduling algorithm, such as a polling or random algorithm, and specifically can add the application number corresponding to the task identifier in the task table. The task execution application can search the task identifier corresponding to the application number through the task table and execute the corresponding task to be executed.
In this embodiment, when the abnormal state of the task execution application is detected, each task to be executed of the task execution application is allocated to other task execution applications, so that the connectivity of task circulation is ensured, and the task processing efficiency is improved.
In one embodiment, step 306, obtaining a target application number and a target task scheduling requirement parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling requirement parameter, includes:
acquiring server identifiers corresponding to the candidate task execution applications, and acquiring application performance parameters corresponding to the candidate task execution applications when the server identifiers corresponding to the candidate task execution applications are the same;
acquiring task execution demand time corresponding to a target task identifier, determining target application performance parameters in application performance parameters corresponding to each candidate task execution application based on the task execution demand time, and determining target task execution applications corresponding to the target application performance parameters;
and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and a target task identifier based on the target task scheduling demand parameter.
The candidate task execution application is a virtual device for task processing. The server identifier is an identifier of a task processing server, and the task processing server performs task processing through built-in virtual equipment. The application performance parameters are performance parameters that characterize task processing by candidate task execution applications.
Specifically, after deleting the historical association relationship between the application number corresponding to the task execution application and the target task identifier, the server acquires the task processing server identifier corresponding to each candidate task execution application. When the server detects that the task processing servers corresponding to the candidate task execution applications are identical in identification, the server indicates that the candidate task execution applications belong to virtual equipment in the same task processing server. And then the server acquires application performance parameters corresponding to each candidate task execution application. The application performance parameters can be represented by preset performance levels, and the higher the performance level is, the faster the task executes the application processing task. And the task execution demand duration range corresponding to each performance level is preset. The server obtains task execution demand time length corresponding to the target task identifier, and searches target application performance parameters corresponding to the task execution demand time length corresponding to the target task identifier in the task execution demand time length range corresponding to each performance level, and determines target task execution applications corresponding to the target application performance parameters. And then the server acquires a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishes a target association relationship between the target application number and the target task identifier based on the target task scheduling demand parameter.
In a specific embodiment, the server may determine the target task execution application from among the candidate task execution applications directly according to the performance parameters. The application performance parameters may be calculated from historical task execution time lengths of the respective candidate task execution applications using an execution application performance analysis algorithm.
Executing the application performance analysis algorithm includes: and acquiring historical tasks corresponding to each candidate task execution application in a historical time period (such as three days), and classifying the tasks according to task attributes of each historical task to obtain each task category. The task attribute may be a job (a rule generated by a task) attribute of a historical task, and the tasks generated by the same job are classified into one type. And then the server selects a target task class which can be the class with the largest task number, and determines each first candidate task execution application for executing the historical task corresponding to the target task class and each second candidate task execution application for executing the historical task corresponding to the non-target task class in each candidate task execution application.
The server respectively acquires the historical task duration corresponding to the historical tasks of each first candidate execution application execution target task category, and then respectively calculates the average time of the historical tasks of each first candidate execution application execution target task category. The server ranks the average time corresponding to each first candidate execution application, which may be from small to large, and obtains a priority queue of each first candidate execution application according to the ranking result, where the priority queue may also be a priority queue in which the server performs task scheduling on each first candidate task execution application. And then the server performs priority sorting according to the application numbers of the second candidate task execution applications, the priorities corresponding to the second candidate task execution applications are newly added in the priority queues of the first candidate execution applications, the priorities of the second candidate task execution applications are lower than the priorities of the first candidate task execution applications, and then the server obtains the target priority queues of the candidate task execution applications.
And then the server sets the number of the allocatable tasks corresponding to each candidate task execution application in the target priority queue. And the server determines the target task execution application according to the target priority queue and the allocable task allowance corresponding to each candidate task execution application.
And the server updates the target priority queue at regular time according to the historical task execution time length corresponding to each candidate task execution application.
In the embodiment, the target task execution application is determined according to the application performance parameter and the task execution demand time, so that the utilization rate of the task execution application performance is improved, the task with high complexity is prevented from being processed by the task execution application with low performance, and the idle condition of the task to be executed is further avoided, and the task processing efficiency is improved.
In one embodiment, step 306, obtaining a target application number and a target task scheduling requirement parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling requirement parameter, includes:
obtaining server identifications corresponding to the candidate task execution applications, and obtaining server performance parameters of the server identifications corresponding to the candidate task execution applications when the server identifications corresponding to the candidate task execution applications are different;
Determining a target server identifier in the server identifiers corresponding to the candidate task execution applications based on the server performance parameters, and determining a target task execution application corresponding to the target server identifier in the candidate task execution applications;
and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and a target task identifier based on the target task scheduling demand parameter.
The server performance parameter refers to a performance parameter of a task processing server performing task processing.
Specifically, the server acquires the task processing server identifiers corresponding to the candidate task execution applications, and when the server detects that the task processing server identifiers corresponding to the candidate task execution applications are different, the server indicates that the candidate task execution applications belong to virtual devices in the servers. And acquiring server performance parameters of the task processing server identifiers corresponding to the candidate task execution applications, wherein the server performance parameters can be obtained in advance according to hardware parameters of the task processing server. In general, the speed of task processing by a virtual device in a server with higher server performance parameters is higher than that of a virtual device in a server with lower server performance parameters.
The server determines a target server identifier in the server identifiers corresponding to the candidate task execution applications according to the server performance parameters, specifically, the target server identifier corresponding to the highest server performance parameter is selected, and the target task execution application corresponding to the target server identifier is determined in the candidate task execution applications. When the number of the corresponding target task execution applications is not less than two, determining a target task execution application according to the task quantity of each target task execution application, namely selecting one target task execution application with the minimum task quantity, acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relation between the target application number and the target task identification based on the target task scheduling demand parameter.
In the embodiment, the target task execution application is determined according to the server performance parameters, so that the high-performance processing task of the task execution application is realized, and the task processing efficiency is improved.
In one embodiment, the task processing method further includes:
acquiring task failure information returned by the task execution application based on the task identifier, deleting the association relationship between the task identifier and the application number corresponding to the task execution application, and updating the task execution times corresponding to the task identifier;
Detecting that the execution times of the tasks corresponding to the task identifiers exceeds a preset execution times threshold value, and recording abnormal task information corresponding to the task identifiers.
Specifically, the server receives task failure information returned after the task execution application executes the task corresponding to the task to be executed, deletes the association relationship between the application number corresponding to the task execution application and the task identifier, and updates the task execution times corresponding to the task identifier.
And when the execution times of the tasks do not exceed the preset execution times threshold, distributing the tasks to be executed corresponding to the task identifiers to other task execution applications for task processing. The server can search idle target task execution applications or randomly select target task execution applications from all task execution applications, obtain target application numbers and target task scheduling requirement parameters corresponding to the target task execution applications, and establish an association relationship between the task identification and the target application numbers according to the target task scheduling requirement parameters.
And when the execution times of the tasks exceed a preset execution times threshold, characterizing that the executed times of the tasks to be executed corresponding to the task identifiers exceed the maximum times and all the tasks are not executed, namely the tasks to be executed are abnormal tasks. The server acquires abnormal task information from the task execution application, wherein the abnormal task information comprises task execution failure information. The server records abnormal task information corresponding to the task identification.
In one embodiment, the task processing method further includes:
when the current time is detected to exceed the preset time and task completion information returned by the task execution application based on the task identifier is not received, a task overtime instruction is sent to the task execution application, so that the task execution application stops the task to be executed corresponding to the task identifier in response to the task overtime instruction;
when receiving task suspension information returned by a task execution application based on a task timeout instruction, deleting an association relationship between an application number corresponding to the task execution application and a task identifier corresponding to a task to be executed;
the method comprises the steps of obtaining a current application number and a current task scheduling demand parameter corresponding to a current task execution application, and establishing a current association relation between the current application number and a task identifier based on the current task scheduling demand parameter, so that the current task execution application executes a task to be executed corresponding to the task identifier according to the current association relation.
Specifically, the server detects that the current time exceeds the preset time and task completion information corresponding to a task identifier returned by the task execution application is not received yet, namely the server detects that the task execution application overturns a task to be executed, generates a task overtime instruction according to the task identifier and sends the task overtime instruction to the task execution application. And the task execution application responds to the task timeout instruction, suspends the corresponding task to be executed of the task identifier, and returns task suspension information to the server. And then the task execution application searches the next task to be executed from the task table or the local cache for processing.
When the server receives task suspension information returned by the execution application based on the task timeout instruction, deleting the association relation between the application number corresponding to the task execution application and the task identifier corresponding to the task to be executed, namely deleting the application number corresponding to the task identifier in the task table. And then the server determines the current task execution application from the candidate task execution applications, acquires the current application number and the current task scheduling requirement parameter corresponding to the current task execution application, and establishes the current association relationship between the current application number and the task identifier based on the current task scheduling requirement parameter so that the current task execution application executes the task to be executed corresponding to the task identifier according to the current association relationship.
In the embodiment, the task execution application is suspended to process the task by detecting the task execution timeout, the next task is executed, and the task is distributed to other task execution applications to be processed, so that the continuity of task circulation is ensured, and the task processing efficiency is improved.
In one embodiment, step 206, establishing an association between the task identifier and the application number based on the task scheduling requirement parameter includes:
Receiving a task scheduling instruction, wherein the task scheduling instruction carries a task scheduling time period;
and acquiring a task identifier in a task scheduling time period, acquiring an application number corresponding to the task execution application based on the application usable state, and establishing an association relationship between the task identifier and the application number.
Specifically, the server receives a task scheduling instruction sent by the task management center, where the task scheduling instruction carries a task scheduling time period, and the task scheduling time period refers to a time period for the task management center to acquire a task and may be a time period formed by initiation time of each task to be executed. The server acquires a task identifier in a task scheduling time period to perform task scheduling, acquires an application number and a task scheduling demand parameter of a task execution application in an application usable state, and establishes an association relationship between the task identifier and the application number based on the task scheduling demand parameter. When the server schedules the task to be executed in the task scheduling time period, the server does not receive the scheduling of the task to be executed of other initiation time.
In one embodiment, as shown in FIG. 4, a flow diagram of task generation is provided. After the Job information is filled in, the user executes an adding operation to send a request for adding the task to the task management center, the task management center writes the Job information data into a database for storage after checking the relevant Job information, and the database returns a writing result to the task management center (step 1-2 in fig. 4). The task management center circularly queries and reads the job information data in batches from the database, receives the job list returned by the database, generates tasks for the jobs which are successful in storing the database, writes the generated task information data into the database, and receives the task adding result returned by the database. The interface of the dispatch center application is then invoked to send a dispatch notification indicating that the dispatch center may perform task scheduling (steps 3-7 in fig. 4). After the task management center generates the task, the task management center asynchronously notifies the scheduling center, and the scheduling center starts task scheduling (as shown in steps 8-9 in fig. 4).
In one embodiment, as shown in FIG. 5, a flow diagram of task execution application registration is provided. After the task execution application is started, a registration request is automatically sent to the registration center. The registry generates an application number for the current task execution application and writes other information (e.g., IP of the execution application, registration time, etc.) to etcd (distributed key value store), which returns the writing result to the registry. The registry determines whether registration is complete based on the writing result returned by etcd, and then returns the registration result (including the application code assigned to the application) to the executing application (steps 1-4 in fig. 5). etcd detects that there are an add, update, delete execution application, asynchronously notifies the dispatch center, which updates the locally cached information of the task execution application (as in steps 5-6 of fig. 5). After registration is completed, executing an application requires regular reporting of its health status, such as status data, heartbeat detection, etc., to the registry. If the registry does not receive the report for multiple times, the registry notifies the scheduler to update the status of the executing application in etcd as unavailable, and the scheduler updates the locally cached information of the task executing application (as shown in steps 7-8 in fig. 5).
In one embodiment, as shown in FIG. 6, a flow diagram of task scheduling is provided. When the dispatching center is started, all available execution application information is acquired from the etcd and is stored locally, and only notification is acquired from the etcd for processing. After receiving the task scheduling notification from the task management center, the scheduling center judges whether the task scheduling state is currently being executed, if so, no operation is executed, the scheduling center directly returns, and waits for the scheduling center to finish the task scheduling state; otherwise, the schedulable tasks are asynchronously searched for in batches from the database, and a schedulable task list returned by the database is received (step 1-2 in fig. 6). And then the dispatching center acquires the available task execution application from the memory, executes task dispatching according to a dispatching algorithm to start execution dispatching operation (as shown in step 3-4 in fig. 6), updates task information to the database, indicates that the task dispatching is currently being executed, and then receives an updating result returned by the database. (as in steps 5-6 of fig. 6).
In another embodiment, as shown in fig. 7, a flow diagram of task scheduling is provided. The task execution application queries tasks of which the maximum execution times are not exceeded, the maximum execution time is not exceeded and the execution application codes are the codes of the current application (codes distributed during registration and stored in a local cache) in batches from the database, and acquires a task list returned by the database (step 1-2 in fig. 7). The task execution application executes the tasks one by one, adds 1 to the execution times of the tasks after the task is executed, and writes the current execution times, execution results, execution start time and execution end time of the tasks into the database (as shown in step 3-4 in fig. 7). If the execution fails, the task execution failure information is written into a database. And then inquiring whether the task to be executed exists from the task execution application database, if not, suspending for a period of time, acquiring the next batch of tasks and processing, otherwise, directly processing the next task.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a task processing device for realizing the task processing method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation of one or more embodiments of the task processing device provided below may refer to the limitation of the task processing method hereinabove, and will not be repeated herein.
In one embodiment, as shown in FIG. 8, there is provided a task processing device 800 comprising: a numbering module 802, a status detection module 804, an association module 806, and an execution module 808, wherein:
the numbering module 802 is configured to generate an application number corresponding to the task execution application in response to an application start signal sent by the task execution application, send the application number to the task execution application, and obtain a task scheduling requirement parameter sent by the task execution application based on the application number;
the state detection module 804 is configured to request to invoke an application state detection interface of the task execution application, send a state detection signal to the application state detection interface, receive state data returned by the task execution application based on the state detection signal, and obtain a task identifier of a task to be executed when the state data conforms to preset usable state data;
the association module 806 is configured to establish a task association relationship between the task identifier and the application number based on the task scheduling requirement parameter;
the execution module 808 is configured to obtain task completion information returned by the task execution application, where the task completion information is generated after the task execution application determines a task identifier corresponding to the application number in an association relationship based on the task scheduling requirement parameter and the application number, and executes a task to be executed corresponding to the task identifier.
In one embodiment, the task processing device 800 further includes:
the abnormal application unit is used for regularly calling an application state detection interface corresponding to the task execution application to send a state detection signal and receiving current state data returned by the task execution application based on the state detection signal; when the current state data is detected not to accord with the preset usable state data, deleting the historical association relationship between the application number corresponding to the task execution application and the target task identifier; and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling demand parameter so that the target task execution application executes a target task corresponding to the target task identifier according to the target association relationship.
In one embodiment, the task processing device 800 further includes:
the application performance determining unit is used for acquiring the server identifiers corresponding to the candidate task execution applications, and acquiring the application performance parameters corresponding to the candidate task execution applications when the server identifiers corresponding to the candidate task execution applications are the same; acquiring task execution demand time corresponding to a target task identifier, determining target application performance parameters in application performance parameters corresponding to each candidate task execution application based on the task execution demand time, and determining target task execution applications corresponding to the target application performance parameters; and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and a target task identifier based on the target task scheduling demand parameter.
In one embodiment, the task processing device 800 further includes:
the server performance determining unit is used for acquiring server identifications corresponding to the candidate task execution applications, and acquiring server performance parameters of the server identifications corresponding to the candidate task execution applications when the server identifications corresponding to the candidate task execution applications are different; determining a target server identifier in the server identifiers corresponding to the candidate task execution applications based on the server performance parameters, and determining a target task execution application corresponding to the target server identifier in the candidate task execution applications; and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and a target task identifier based on the target task scheduling demand parameter.
In one embodiment, the task processing device 800 further includes:
the execution times unit is used for acquiring task failure information returned by the task execution application based on the task identifier, deleting the association relationship between the task identifier and the application number corresponding to the task execution application, and updating the task execution times corresponding to the task identifier; and detecting that the execution times of the tasks corresponding to the task identifiers exceeds a preset execution times threshold value, and recording abnormal task information corresponding to the task identifiers.
In one embodiment, the task processing device 800 further includes:
the task overtime unit is used for sending a task overtime instruction to the task execution application when the current time exceeds the preset time and the task completion information returned by the task execution application based on the task identifier is not received, so that the task execution application can stop the task to be executed corresponding to the task identifier in response to the task overtime instruction; when receiving task suspension information returned by a task execution application based on a task timeout instruction, deleting an association relationship between an application number corresponding to the task execution application and a task identifier corresponding to a task to be executed; the method comprises the steps of obtaining a current application number and a current task scheduling demand parameter corresponding to a current task execution application, and establishing a current association relation between the current application number and a task identifier based on the current task scheduling demand parameter, so that the current task execution application executes a task to be executed corresponding to the task identifier according to the current association relation.
In one embodiment, the status detection module 804 includes:
the task acquisition unit is used for receiving a task scheduling instruction, wherein the task scheduling instruction carries a task scheduling time period; and acquiring a task identifier in a task scheduling time period, acquiring an application number and a task scheduling demand parameter corresponding to the task execution application based on the application usable state, and establishing an association relationship between the task identifier and the application number based on the task scheduling demand parameter.
The various modules in the task processing device described above may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a server, and the internal structure of which may be as shown in fig. 9. The computer device includes a processor, a memory, an Input/Output interface (I/O) and a communication interface. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface is connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer device is used for storing task data to be executed. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a task processing method.
In one embodiment, a computer device is provided, which may be a terminal, and an internal structure diagram thereof may be as shown in fig. 10. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a task processing method. The display unit of the computer equipment is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device, wherein the display screen can be a liquid crystal display screen or an electronic ink display screen, the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on a shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by persons skilled in the art that the structures shown in FIGS. 9-10 are block diagrams of the elements in association with aspects of the application and are not intended to limit the computer system to which the aspects of the application may be applied, and that a particular computer system may include more or less elements than those shown, or may be combined with certain elements, or may have different arrangements of elements.
In an embodiment, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.
In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.
In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.
It should be noted that, the user information (including but not limited to user equipment information, user personal information, etc.) and the data (including but not limited to data for analysis, stored data, presented data, etc.) related to the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data need to comply with the related laws and regulations and standards of the related country and region.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, or the like, but is not limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims (10)

1. A method of task processing, the method comprising:
responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
Requesting to call an application state detection interface of the task execution application, sending a state detection signal to the application state detection interface, receiving state data returned by the task execution application based on the state detection signal, and acquiring a task identifier of a task to be executed when the state data accords with preset usable state data;
establishing a task association relationship between the task identifier and the application number based on the task scheduling demand parameter;
and acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines the task identifier corresponding to the application number in the association relation based on the task scheduling demand parameter and the application number and executes the task to be executed corresponding to the task identifier.
2. The method of claim 1, further comprising, after the obtaining the task completion information returned by the task execution application:
the method comprises the steps of calling an application state detection interface corresponding to the task execution application at fixed time to send a state detection signal, and receiving current state data returned by the task execution application based on the state detection signal;
When the current state data is detected not to accord with the preset usable state data, deleting the association relation between the application number corresponding to the task execution application and the target task identifier;
acquiring a target application number and a target task scheduling demand parameter corresponding to a target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling demand parameter so that the target task execution application executes a target task corresponding to the target task identifier according to the target association relationship.
3. The method according to claim 2, wherein the obtaining the target application number and the target task scheduling requirement parameter corresponding to the target task execution application, and establishing the target association relationship between the target application number and the target task identifier based on the target task scheduling requirement parameter, includes:
acquiring server identifiers corresponding to all candidate task execution applications, and acquiring application performance parameters corresponding to all candidate task execution applications when the server identifiers corresponding to all candidate task execution applications are the same;
Acquiring task execution demand time length corresponding to the target task identifier, determining target application performance parameters in application performance parameters corresponding to each candidate task execution application based on the task execution demand time length, and determining target task execution applications corresponding to the target application performance parameters;
and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling demand parameter.
4. The method according to claim 2, wherein the obtaining the target application number and the target task scheduling requirement parameter corresponding to the target task execution application, and establishing the target association relationship between the target application number and the target task identifier based on the target task scheduling requirement parameter, includes:
obtaining server identifications corresponding to all candidate task execution applications, and obtaining server performance parameters of the server identifications corresponding to all candidate task execution applications when the server identifications corresponding to all candidate task execution applications are different;
Determining a target server identifier in server identifiers corresponding to the candidate task execution applications based on the server performance parameters, and determining a target task execution application corresponding to the target server identifier in the candidate task execution applications;
and acquiring a target application number and a target task scheduling demand parameter corresponding to the target task execution application, and establishing a target association relationship between the target application number and the target task identifier based on the target task scheduling demand parameter.
5. The method according to claim 1, characterized in that the method further comprises:
acquiring task failure information returned by the task execution application based on the task identifier, deleting the association relationship between the task identifier and the application number corresponding to the task execution application, and updating the task execution times corresponding to the task identifier;
detecting that the execution times of the tasks corresponding to the task identifiers exceeds a preset execution times threshold value, and recording abnormal task information corresponding to the task identifiers.
6. The method according to claim 1, characterized in that the method further comprises:
the task processing time of the task to be executed is detected to exceed the preset time, task completion information returned by the task execution application based on the task identifier is not received, a task overtime instruction is sent to the task execution application, and the task execution application stops the task to be executed corresponding to the task identifier in response to the task overtime instruction;
Receiving task suspension information returned by the task execution application based on the task timeout instruction, and deleting the association relationship between the application number corresponding to the task execution application and the task identifier corresponding to the task to be executed;
acquiring a current application number and a current task scheduling demand parameter corresponding to a current task execution application, and establishing a current association relation between the current application number and the task identifier based on the current task scheduling demand parameter so that the current task execution application executes a task to be executed corresponding to the task identifier according to the current association relation.
7. The method of claim 1, wherein the establishing an association between the task identifier and the application number based on the task scheduling requirement parameter comprises:
receiving a task scheduling instruction, wherein the task scheduling instruction carries a task scheduling time period;
and acquiring the task identifier in the task scheduling time period, acquiring an application number and a task scheduling demand parameter corresponding to the task execution application based on the application usable state, and establishing an association relationship between the task identifier and the application number based on the task scheduling demand parameter.
8. A task processing device, the device comprising:
the numbering module is used for responding to an application starting signal sent by a task execution application, generating an application number corresponding to the task execution application, sending the application number to the task execution application, and obtaining task scheduling requirement parameters sent by the task execution application based on the application number;
the state detection module is used for requesting to call an application state detection interface of the task execution application, sending a state detection signal to the application state detection interface, receiving state data returned by the task execution application based on the state detection signal, and acquiring a task identifier of a task to be executed when the state data accords with preset usable state data;
the association module is used for establishing a task association relation between the task identifier and the application number based on the task scheduling demand parameter;
the execution module is used for acquiring task completion information returned by the task execution application, wherein the task completion information is generated after the task execution application determines the task identifier corresponding to the application number in the association relation based on the task scheduling requirement parameter and the application number and executes the task to be executed corresponding to the task identifier.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
CN202311049426.1A 2023-08-18 2023-08-18 Task processing method, device, computer equipment and storage medium Pending CN117076076A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311049426.1A CN117076076A (en) 2023-08-18 2023-08-18 Task processing method, device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311049426.1A CN117076076A (en) 2023-08-18 2023-08-18 Task processing method, device, computer equipment and storage medium

Publications (1)

Publication Number Publication Date
CN117076076A true CN117076076A (en) 2023-11-17

Family

ID=88707492

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311049426.1A Pending CN117076076A (en) 2023-08-18 2023-08-18 Task processing method, device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN117076076A (en)

Similar Documents

Publication Publication Date Title
EP3221795B1 (en) Service addressing in distributed environment
US11405328B2 (en) Providing on-demand production of graph-based relationships in a cloud computing environment
CN111209090A (en) Method and assembly for creating virtual machine in cloud platform and server
CN113485830A (en) Micro-service automatic capacity expansion method for power grid monitoring system
CN108228432A (en) A kind of distributed link tracking, analysis method and server, global scheduler
CN115114359A (en) User data processing method and device
CN115118612A (en) Resource quota management method and device, computer equipment and storage medium
CN118051344A (en) Method and device for distributing hardware resources and hardware resource management system
CN114237892A (en) Key value data processing method and device, electronic equipment and storage medium
CN117435129A (en) Storage cluster expansion method and device, computer equipment and storage medium
CN112363980A (en) Data processing method and device for distributed system
CN117149382A (en) Virtual machine scheduling method, device, computer equipment and storage medium
CN117076076A (en) Task processing method, device, computer equipment and storage medium
US20230049322A1 (en) Information processing method, device, system, and computer-readable storage medium
CN111221858B (en) Data processing method, device and equipment
CN114721840B (en) Service information acquisition method, device, computer equipment and storage medium
CN117453759B (en) Service data processing method, device, computer equipment and storage medium
CN116737848A (en) Data association method, device, computer equipment and storage medium
CN116700969A (en) Task processing method, device, computer equipment and storage medium
CN117009104A (en) Asynchronous request processing method, device, computer equipment and storage medium
CN116881154A (en) Pressure testing method, pressure testing device, computer equipment and storage medium
CN113468252A (en) Data loading method and device, electronic equipment and computer readable storage medium
CN117035763A (en) Account resource recharging method, device, computer equipment and storage medium
CN116775284A (en) Task processing method, device, computer equipment and storage medium
CN117312653A (en) Service policy determination method, device, computer equipment and storage medium

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