CN115981810A - Task scheduling method, electronic device and storage medium in field of financial science and technology - Google Patents
Task scheduling method, electronic device and storage medium in field of financial science and technology Download PDFInfo
- Publication number
- CN115981810A CN115981810A CN202211615153.8A CN202211615153A CN115981810A CN 115981810 A CN115981810 A CN 115981810A CN 202211615153 A CN202211615153 A CN 202211615153A CN 115981810 A CN115981810 A CN 115981810A
- Authority
- CN
- China
- Prior art keywords
- task
- thread
- state
- execution
- execution thread
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a task scheduling method, electronic equipment and a storage medium in the field of financial science and technology, wherein the task scheduling optimization method comprises the following steps: the management thread pulls all tasks in an unprocessed state; after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state, and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing; and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished. According to the scheme, the management thread pulls the task, and the execution thread actively executes the task in the state to be processed, so that the resource utilization rate is improved.
Description
Technical Field
The present application relates to the field of cloud deployment, and in particular, to a task scheduling method, an electronic device, and a storage medium in the field of financial technology.
Background
Currently, an enterprise system generates a large amount of data every day, and a plurality of business personnel are required to process different business projects simultaneously so as to complete the same stage of task together. The scheduling scheme commonly used by the conventional computer is that the task to be executed is pulled by the administrator and then is allocated to each business person in the job one by one for execution, and the task is specified by the administrator. At this time, the tasks are different in size, the business personnel divided into a plurality of small tasks quickly complete the work and are in a waiting distribution state, and the business personnel divided into a plurality of large tasks need to spend the most time to complete the tasks. This results in a large number of tasks waiting longer to complete, resulting in a wasted resource.
Disclosure of Invention
The application at least provides a task scheduling method, electronic equipment and a storage medium in the field of financial science and technology, the task is pulled through the management thread, the task in a to-be-processed state is actively executed by the execution thread, and the resource utilization rate is improved.
The application provides a task scheduling method in the field of financial science and technology in a first aspect, which comprises the following steps:
the management thread pulls all the tasks in an unprocessed state;
after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing;
and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished.
Wherein the management thread communicates with the execution thread through a unified interactive application.
Wherein, after the execution thread completes the task, the updating, by the management thread, the processing state of the executed task to be completed includes:
the management thread is informed by the execution thread that the task has been executed;
and the management thread updates the processing state of the executed task to be completed so that the execution thread does not continue to acquire the executed task.
After the execution thread acquires the task in the unprocessed state, the establishing of the association relationship between the execution thread and the task in the unprocessed state by the management thread comprises the following steps:
the management thread is informed by the execution thread to acquire the identifier of the task in an unprocessed state;
and the management thread establishes the incidence relation between the task corresponding to the identification and the execution thread.
The establishing, by the management thread, an association relationship between the task corresponding to the identifier and the execution thread includes:
establishing an incidence relation between the execution thread and the task in the unprocessed state;
and setting the state of the task in the unprocessed state as preparation.
Wherein, after the management thread pulls all the tasks in the unprocessed state, the method includes:
the execution thread acquires the identification of the task in an unprocessed state through an optimistic lock;
and if the execution result acquired by the execution thread is in an execution abnormal state, indicating the original execution thread to re-execute the task in the unprocessed state.
After the execution thread finishes the task and the processing state of the executed task is updated to be completed, the method includes:
reading the processing state of the task;
and displaying the processing state of the task by a visual interface.
Wherein the method further comprises:
a plurality of execution threads are defined, wherein each execution thread corresponds to a different task type.
A second aspect of the present application provides an electronic device, which includes a memory and a processor coupled to each other, where the processor is configured to execute program instructions stored in the memory to implement the task scheduling method in the financial technology field in the first aspect.
A third aspect of the present application provides a computer-readable storage medium, on which program instructions are stored, and the program instructions, when executed by a processor, implement the task scheduling method in the financial technology field in the first aspect.
According to the scheme, the management thread pulls all tasks in an unprocessed state; after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state, and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing; and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished. According to the scheme, the management thread pulls the task, and the execution thread actively executes the task in the state to be processed, so that the resource utilization rate is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the application.
FIG. 1 is a schematic flowchart of a first embodiment of a task scheduling method in the field of financial technology;
FIG. 2 is a flowchart illustrating a task scheduling method according to a second embodiment of the present application in the field of financial technology;
FIG. 3 is a block diagram of an embodiment of an electronic device of the present application;
FIG. 4 is a block diagram of an embodiment of a non-volatile computer-readable storage medium of the present application.
Detailed Description
The following describes in detail the embodiments of the present application with reference to the drawings attached hereto.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular system structures, interfaces, techniques, etc. in order to provide a thorough understanding of the present application.
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship. Further, the term "plurality" herein means two or more than two. In addition, the term "at least one" herein means any one of a variety or any combination of at least two of a variety, for example, including at least one of A, B, C, and may mean including any one or more elements selected from the group consisting of A, B and C.
If the technical scheme of the application relates to personal information, a product applying the technical scheme of the application clearly informs personal information processing rules before processing the personal information, and obtains personal independent consent. If the technical scheme of the application relates to sensitive personal information, a product applying the technical scheme of the application obtains individual consent before processing the sensitive personal information, and simultaneously meets the requirement of 'express consent'. For example, at a personal information collection device such as a camera, a clear and significant identifier is set to inform that the personal information collection range is entered, the personal information is collected, and if the person voluntarily enters the collection range, the person is considered as agreeing to collect the personal information; or on the device for processing the personal information, under the condition of informing the personal information processing rule by using obvious identification/information, obtaining personal authorization in the modes of pop-up window information or asking the person to upload personal information thereof and the like; the personal information processing rule may include information such as a personal information processor, a personal information processing purpose, a processing method, and a type of personal information to be processed.
All intelligent management systems on the market today have a large amount of data consuming tasks to perform each day. The commonly used scheduling scheme is that the task to be executed is pulled by the administrator and then is allocated to each business person in operation one by one for execution, and the task is specified by the administrator. At this time, the tasks are different in size, the business personnel divided into a plurality of small tasks quickly complete the work and are in a waiting distribution state, and the business personnel divided into a plurality of large tasks need to spend the most time to complete the tasks. This results in a large number of tasks waiting longer to complete, resulting in a wasted resource.
Referring to fig. 1, fig. 1 is a flowchart illustrating a task scheduling method in the field of financial technology according to a first embodiment of the present application. Specifically, the following steps may be included:
step S100: the management thread pulls all tasks in the unprocessed state.
In this embodiment, after the management thread pulls all the tasks in the unprocessed state, the management thread includes that the execution thread acquires the identifier of the task in the unprocessed state through the optimistic lock; and if the execution result acquired by the execution thread is in an execution abnormal state, indicating the original execution thread to re-execute the task in the unprocessed state.
In one triggering execution task flow, the task identifier is changed only once, but the optimistic lock version number is changed for many times. The optimistic lock version number is used to enable the management thread to determine whether to update the current state, and the task identifier is used to enable the determination whether to trigger execution of the task. The task identifier can be a task version number, and the task version number is increased by one when the task is triggered to be executed; the version number of the optimistic lock is incremented by one each time the task state is changed. The task identification is in task dimension, and each unprocessed task corresponds to a unique task identification; the optimistic lock is used for determining the current state of a task in an unprocessed state; the task state comprises preparation, processing and completion.
In this embodiment, the management thread communicates with the execution thread through a unified interactive application. That is, all the interactive communication between the management thread and the execution thread is provided by the management thread, the unified interactive application is provided by the management thread, the task is distributed by the unified interactive application, and the task state is changed.
In this embodiment, the method further includes defining a plurality of execution threads, where each execution thread corresponds to a different task type. A plurality of different execution threads are set to execute tasks of different task types, so that resource tasks are labeled, and a foundation is laid for resource pool division.
Step S101: after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state, and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing.
In this embodiment, after the execution thread acquires the task in the unprocessed state, the establishing of the association relationship between the execution thread and the task in the unprocessed state by the management thread includes that the management thread is informed by the execution thread of acquiring the identifier of the task in the unprocessed state; and the management thread establishes an incidence relation between the task corresponding to the identification and the execution thread.
Further, the management thread establishes an association relationship between the task corresponding to the identifier and the execution thread, including establishing an association relationship between the execution thread and the task in the unprocessed state; and setting the state of the task in the unprocessed state as preparation.
That is, when the execution thread successfully acquires the identifier of the task in the unprocessed state, the unified interactive application informs the management thread that the task is acquired, and the execution thread can establish the association relationship between the task corresponding to the identifier and the execution thread, and update the corresponding task state from preparation to processing.
Step S102: and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished.
In this embodiment, after the execution thread finishes executing the task, the management thread updates the processing state of the executed task to the processing state of the completed task, including reading the processing state of the task; and displaying the processing state of the task by a visual interface.
In this embodiment, the step S102 includes:
the management thread is informed by the execution thread that the task has been executed;
and the management thread updates the processing state of the executed task to be completed so that the execution thread does not continue to acquire the executed task.
That is, after the execution thread has completed the task, the management thread is informed through the unified interactive application that the task has been completed, the management thread updates the state of the task that has been completed to be completed, and marks the task so that the execution thread does not continue to acquire the task that has been completed.
In this embodiment, an optimistic lock mechanism is used to prevent the same task from being executed by multiple execution threads.
In the embodiment, the optimistic locking mechanism can ensure that the execution thread triggers, executes and completes the task and is confirmed by the manager, so that the situations that the task waiting execution time is too long and no one executes occur, and the resource waste is avoided. In addition, the task scheduling function of the enterprise system can be optimized conveniently.
It will be understood by those skilled in the art that in the method of the present invention, the order of writing the steps does not imply a strict order of execution and any limitations on the implementation, and the specific order of execution of the steps should be determined by their function and possible inherent logic.
Under the existing conditions, all the intelligent management systems on the market currently have a large amount of data consumption tasks to be executed every day. The commonly used scheduling scheme is that the task to be executed is pulled by the administrator and then is allocated to each business person in work one by one for execution, and the task is specified by the administrator. When services exist and are uniformly distributed to different service personnel by an administrator, the time for each service personnel to complete tasks is different according to the size of a project, the sizes of the tasks are different, the service personnel with the small task amount can quickly complete the work and are in a waiting distribution state, and the service personnel with the large task amount can consume the most time to complete the tasks. This results in a large number of tasks waiting longer to complete, resulting in a wasted resource.
In this embodiment, the management thread pulls all tasks in an unprocessed state; after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing; and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished. By the scheme, the management personnel can record the state that the staff acquires the task to be scheduled, know the task scheduling state in time and improve the resource utilization rate.
Referring to fig. 2, fig. 2 is a flowchart illustrating a task scheduling method in the financial technology field according to a second embodiment of the present application. Specifically, the method may include the steps of:
step S200: the management thread pulls all tasks in the unprocessed state.
As described above in S100, which is not described herein.
Step S201: after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state, and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing.
As described above in S101, the description is omitted here.
Step S202: and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished.
In this embodiment, after the execution thread completes the task, the management thread updates the processing state of the executed task to be completed, including the management thread being notified by the execution thread that the task has been completed; and the management thread updates the processing state of the executed task to be completed so that the execution thread does not continue to acquire the executed task.
In this embodiment, the task scheduling system receives an update response of the task data table, and determines whether to change the state of the task to be scheduled according to the update response. And the updating response of the task data table comprises the updating state of the task and the current task identification name.
In this embodiment, whether to execute the task to be scheduled is determined according to the update response; and determining whether to execute the task to be scheduled, so as to change the state of the task to be scheduled. If the execution of the task to be scheduled is successfully triggered, changing the task state of the association table corresponding to the task to be scheduled into processing; and if the triggering of executing the task to be scheduled fails, ending the flow of the task to be scheduled.
In this embodiment, the method further includes the task scheduling system receiving a completion message of the task data table, where the completion message includes a currently completed task identification name; and changing the task state of the corresponding association table in the task scheduling system to be completed according to the task identification name.
Step S203: and reading the processing state of the task.
In this embodiment, when the management thread wants to check the task states of all the tasks at present, the task identifier may be read, so that the processing state of the task is displayed in a form of a visual interface.
Step S204: and displaying the processing state of the task by a visual interface.
In the embodiment, the task state is visually displayed, so that operation and maintenance personnel can conveniently monitor the current execution state of the task.
For example, in a task scheduling optimization application scenario in the financial technology, a bank a may wish to design a bank credit card data consumption task scheduling optimization method, so that a manager records a state of a task to be scheduled acquired by a worker, timely learns a task scheduling state, and improves resource utilization, so that the bank a draws all tasks in an unprocessed state through a design management thread, allocates all tasks in the unprocessed state through a unified interactive application by the management thread, then establishes an association relationship between the execution thread and the tasks in the unprocessed state after the execution thread acquires the tasks in the unprocessed state, and updates a state of the tasks in the unprocessed state to processing, where the execution thread can only acquire the tasks in the unprocessed state for processing, and when the management thread receives a notification that the execution thread has executed the tasks in the interactive application, the management thread updates a processing state of the executed tasks to completed. The problem that only an administrator directly arranges tasks in the prior art is avoided, task acquisition is transferred to a business personnel competition task by the administrator, uniqueness of a plurality of business personnel in competition is guaranteed, and resource utilization rate is improved.
In the embodiment, the management thread pulls the task and allocates the task, and the execution thread informs the management thread of the task state through the unified interactive application, so that the problem that in the prior art, only an administrator directly arranges the task is avoided, the execution thread actively executes the task in the state to be processed through pulling the task by the management thread, and the resource utilization rate is improved.
Referring to fig. 3, fig. 3 is a schematic block diagram of an embodiment of an electronic device 30 according to the present application. The electronic device 30 comprises a memory 31 and a processor 32 coupled to each other, and the processor 32 is configured to execute program instructions stored in the memory 31 to implement the steps in any one of the above embodiments of the task scheduling method in the financial technology field. In one particular implementation scenario, the electronic device 30 may include, but is not limited to: a microcomputer, a server, and the electronic device 30 may also include a mobile device such as a notebook computer, a tablet computer, and the like, which is not limited herein.
In particular, the processor 32 is configured to control itself and the memory 31 to implement the steps of any of the above embodiments of the task scheduling method in the field of financial technology. The processor 32 may also be referred to as a CPU (Central Processing Unit). The processor 32 may be an integrated circuit chip having signal processing capabilities. The Processor 32 may also be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate array (Field-Programmable Gate array fpga) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. In addition, the processor 32 may be commonly implemented by an integrated circuit chip.
Referring to fig. 4, fig. 4 is a block diagram of an embodiment of a non-volatile computer readable storage medium 40 according to the present invention. The non-transitory computer readable storage medium 40 stores program instructions 401 capable of being executed by the processor, the program instructions 401 being configured to implement the steps of any of the above embodiments of the task scheduling method in the field of financial technology.
In some embodiments, functions of or modules included in the apparatus provided in the embodiments of the present disclosure may be used to execute the method described in the above method embodiments, and for specific implementation, reference may be made to the description of the above method embodiments, and for brevity, details are not described here again.
The foregoing description of the various embodiments is intended to highlight various differences between the embodiments, and the same or similar parts may be referred to each other, and for brevity, will not be described again herein.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a module or a unit is merely one type of logical division, and an actual implementation may have another division, for example, a unit or a component may be combined or integrated with another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some interfaces, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Claims (10)
1. A task scheduling method in the field of financial technology is characterized by comprising the following steps:
the management thread pulls all tasks in an unprocessed state;
after the execution thread acquires the task in the unprocessed state, the management thread establishes the incidence relation between the execution thread and the task in the unprocessed state, and updates the state of the task in the unprocessed state into processing, wherein the execution thread can only acquire the task in the unprocessed state for processing;
and after the execution thread finishes the task, the management thread updates the processing state of the executed task to be finished.
2. The method of claim 1,
the management thread communicates with the execution thread through a unified interactive application.
3. The method of claim 1,
after the execution thread finishes the task, the updating, by the management thread, the processing state of the executed task to be completed includes:
the management thread is informed by the execution thread that the task has been executed;
and the management thread updates the processing state of the executed task to be completed so that the execution thread does not continue to acquire the executed task.
4. The method of claim 1,
after the execution thread acquires the task in the unprocessed state, the establishing of the incidence relation between the execution thread and the task in the unprocessed state by the management thread comprises the following steps:
the management thread is informed by the execution thread to acquire the identifier of the task in an unprocessed state;
and the management thread establishes the incidence relation between the task corresponding to the identification and the execution thread.
5. The method of claim 1,
after the management thread pulls all the tasks in the unprocessed state, the method comprises the following steps:
the execution thread acquires the identification of the task in an unprocessed state through the optimistic lock;
and if the execution result acquired by the execution thread is in an execution abnormal state, indicating the original execution thread to re-execute the task in the unprocessed state.
6. The method of claim 4,
the management thread establishes an incidence relation between the task corresponding to the identifier and the execution thread, and the incidence relation comprises the following steps:
establishing an incidence relation between the execution thread and the task in the unprocessed state;
and setting the state of the task in the unprocessed state as preparation.
7. The method of claim 1,
after the execution thread finishes the task and the processing state of the executed task is updated to be completed, the management thread comprises:
reading the processing state of the task;
and displaying the processing state of the task by a visual interface.
8. The method of claim 1,
the method further comprises the following steps:
a plurality of execution threads are defined, wherein each execution thread corresponds to a different task type.
9. An electronic device, comprising a memory and a processor coupled to each other, wherein the processor is configured to execute program instructions stored in the memory to implement the task scheduling method in the field of financial technology according to any one of claims 1 to 8.
10. A non-transitory computer readable storage medium having stored thereon program instructions, wherein the program instructions, when executed by a processor, implement the task scheduling method in the field of financial technology of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211615153.8A CN115981810A (en) | 2022-12-14 | 2022-12-14 | Task scheduling method, electronic device and storage medium in field of financial science and technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211615153.8A CN115981810A (en) | 2022-12-14 | 2022-12-14 | Task scheduling method, electronic device and storage medium in field of financial science and technology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115981810A true CN115981810A (en) | 2023-04-18 |
Family
ID=85962039
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211615153.8A Pending CN115981810A (en) | 2022-12-14 | 2022-12-14 | Task scheduling method, electronic device and storage medium in field of financial science and technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115981810A (en) |
-
2022
- 2022-12-14 CN CN202211615153.8A patent/CN115981810A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8489729B2 (en) | System and method for social service event processing and management | |
| CN111786886B (en) | Message processing method, device and system, electronic equipment and storage medium | |
| US20070106669A1 (en) | Ensuring Timely Servicing of Desired Transactions in a Database Server | |
| CN104750550A (en) | Mobile terminal application management system and method and use time record generating method | |
| CN102971711A (en) | An apparatus for processing a batched unit of work | |
| CN112905323B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN113361838A (en) | Business wind control method and device, electronic equipment and storage medium | |
| CN111767127A (en) | Service data processing method and device | |
| CN113407973B (en) | Software function authority management method, system, server and storage medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN114168297A (en) | Method, device, equipment and medium for scheduling collection tasks | |
| CN115981810A (en) | Task scheduling method, electronic device and storage medium in field of financial science and technology | |
| CN116860344A (en) | Flow management method, system, equipment and medium | |
| CN114860408A (en) | Thread pool resource management method and device | |
| CN115309558A (en) | Resource scheduling management system, method, computer equipment and storage medium | |
| CN107402752B (en) | Timing triggering method and device for application | |
| CN112685142A (en) | Distributed data processing system | |
| CN108008966B (en) | Resource updating method and system | |
| CN113792051B (en) | Data processing method, system, equipment and storage medium based on multi-mode lock | |
| US20240154994A1 (en) | Automated system access review using inter-system mappings | |
| CN112837154B (en) | Registration and execution methods and devices of timing intelligent contracts in blockchain | |
| US20230267098A1 (en) | Data blocking for application platforms | |
| EP1544709A1 (en) | Distribution computer system managing method | |
| CN115617390A (en) | Configuration information maintenance method, electronic equipment and computer readable storage medium | |
| CN107609740B (en) | Method and device for distributing and managing mobile equipment based on internal application |
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 |