Task execution memory query method and device, and computer readable storage medium
By acquiring task characteristic information and verifying it using proxy service information, combined with shared memory and data transfer using Go language, the problem of transaction performance degradation under high concurrency was solved, achieving efficient task execution and guaranteed transaction success rate.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- 中国邮政储蓄银行股份有限公司
- Filing Date
- 2022-09-22
- Publication Date
- 2026-04-24
AI Technical Summary
Under high concurrency, existing technologies suffer from decreased transaction performance, which can easily lead to resource contention and transaction delays, and even reduce the transaction success rate, especially when the database fails.
By acquiring the characteristic information of the target task, including task type, execution function and business requirements, and using proxy service information for verification, the execution subject is obtained. Shared memory is used as a cache to reduce the dependence on the database. Data is transmitted using Go language and Unix domain sockets to achieve business orchestration and authentication.
It improves the efficiency of parallel task processing, reduces transaction latency, ensures transaction success rate, and ensures that system node failures do not affect overall transactions, thereby improving application performance and development efficiency.
Smart Images

Figure CN115563352B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data processing, and more specifically, to a method and apparatus for querying task execution memory, and a computer-readable storage medium. Background Technology
[0002] During project development, numerous concurrent scenarios arise, and atomic orchestration and custom design are frequent challenges. Modifying transaction flows without impacting software concurrency performance often involves storing function atomic names in a database and querying configuration information to implement the business process. However, this approach still incurs performance overhead under high concurrency, affecting software performance. For example, when multiple node processes simultaneously read from a single database instance (e.g., ... Figure 1 , Figure 1 This diagram illustrates resource contention caused by concurrent access in existing technologies. Competition for mutually exclusive resources often leads to conflicts. Developers need to pay close attention to these issues during the development of related functions to avoid misuse of resources. Mutual competition can cause transaction delays, performance degradation, and even a decrease in transaction success rate. In particular, this situation is prone to single points of failure; transactions will fail when the database fails. Currently, no effective solution has been proposed to address these problems. Summary of the Invention
[0003] This invention provides a method and apparatus for querying task execution memory, as well as a computer-readable storage medium, to at least solve the technical problem in related technologies where transaction performance degrades once the transaction concurrency increases in transaction atomication.
[0004] According to one aspect of the present invention, a method for querying task execution memory is provided, comprising: obtaining feature information of a target task, wherein the feature information includes at least: task type information, task execution function, and business requirement information, wherein the task type information is information about the task type of the target task, the task execution function is a function required to execute the target task, and the business requirement information is information about the business requirements of the target task; obtaining proxy service information of the target task based on the task type information, wherein the proxy service information is information about a proxy service module for executing the target task; verifying the feature information using the proxy service information, and if the verification passes, obtaining an execution entity for executing the target task.
[0005] Optionally, obtaining proxy service information for the target task based on the task type information includes: connecting the target task to a web client, wherein the web client includes a Golang language; and querying the proxy service information through a nested client within the web client based on the task type information of the target task.
[0006] Optionally, the proxy service information can be obtained by querying the nested client in the web client based on the feature information of the target task, including: substituting the task execution function into the nested client to obtain the address information corresponding to the nested client; and obtaining the proxy service information based on the address information.
[0007] Optionally, verifying the feature information through the proxy service information includes: orchestrating the target task based on the business requirement information to obtain the orchestrated target task; and verifying the identity of the orchestrated target task.
[0008] Optionally, the business orchestration of the target task based on the business requirements includes: obtaining the corresponding task orchestration function based on the business requirement information; and performing business orchestration of the target task based on the task orchestration function.
[0009] Optionally, before orchestrating the target task based on the business requirements, the process includes: segmenting and reorganizing the target task based on the business requirements information to obtain multiple sub-tasks. The multiple sub-tasks include a major category table, a minor category table, and an atomic table. The major category table, the minor category table, and the atomic table represent sub-tasks with different levels of task granularity. The task granularity of the minor category table is greater than that of the atomic table and less than that of the major category table.
[0010] According to another aspect of the present invention, a task execution memory query device is also provided, comprising: a first acquisition module, configured to acquire feature information of a target task, wherein the feature information includes at least: task type information, task execution function, and business requirement information, wherein the task type information is information about the task type of the target task, the task execution function is a function required to execute the target task, and the business requirement information is information about the business requirements of the target task; a second acquisition module, configured to acquire proxy service information of the target task based on the task type information, wherein the proxy service information is information about a queried proxy service module that executes the target task; and a verification module, configured to verify the feature information using the proxy service information, and, if the verification is successful, acquire the execution entity used to execute the target task.
[0011] Optionally, the second acquisition module includes: an access unit, configured to access the target task to a web client, wherein the web client includes the Golang language; and a query unit, configured to query the proxy service information based on the task type information of the target task through a nested client in the web client.
[0012] Optionally, the query unit includes: a first acquisition unit, configured to substitute the task execution function into the nested client to obtain address information corresponding to the nested client; and a second acquisition unit, configured to obtain the proxy service information based on the address information.
[0013] Optionally, the verification module includes: an orchestration unit, used to orchestrate the target task based on the business requirement information and obtain the orchestrated target task; and a verification unit, used to verify the identity of the orchestrated target task.
[0014] Optionally, the orchestration unit includes: an acquisition subunit, used to acquire a corresponding task orchestration function based on the business requirement information; and an orchestration subunit, used to perform business orchestration on the target task based on the task orchestration function.
[0015] Optionally, the method further includes: a segmentation and reorganization unit, used to segment and reorganize the target task based on the business requirements information before performing business orchestration on the target task based on the business requirements, to obtain multiple sub-tasks, wherein the multiple sub-tasks include: a major category table, a minor category table, and an atomic table, wherein the major category table, the minor category table, and the atomic table are sub-tasks with different levels of task granularity, and the task granularity of the minor category table is greater than that of the atomic table and smaller than that of the major category table.
[0016] According to another aspect of the present invention, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored computer program, wherein, when the computer program is executed by a processor, it controls the device where the computer-readable storage medium is located to execute any of the above-described task execution memory query methods.
[0017] According to another aspect of the present invention, a processor is also provided, the processor being configured to run a computer program, wherein the computer program, when running, executes any of the above-described methods for querying task execution memory.
[0018] In this embodiment of the invention, feature information of the target task is obtained, wherein the feature information includes at least: task type information, task execution function, and business requirement information. The task type information is the task type information of the target task, the task execution function is the function required to execute the target task, and the business requirement information is the business requirement information of the target task. Based on the task type information, proxy service information of the target task is obtained, wherein the proxy service information is the information of the proxy service module that executes the target task. The feature information is verified using the proxy service information, and if the verification passes, the execution entity used to execute the target task is obtained. The task execution memory query method provided by this embodiment of the invention achieves the goal of quickly querying the execution entity of the task based on the feature information of the target task and through the proxy service to accurately execute the task, thereby improving the technical effect of parallel task processing efficiency and solving the technical problem in related technologies where transaction performance degrades as transaction concurrency increases in transaction atomicity. Attached Figure Description
[0019] The accompanying drawings, which are included to provide a further understanding of the invention and form part of this application, illustrate exemplary embodiments of the invention and, together with their description, serve to explain the invention and do not constitute an undue limitation thereof. In the drawings:
[0020] Figure 1 This is a diagram illustrating resource contention caused by concurrent access based on existing technologies;
[0021] Figure 2 This is a flowchart of a task execution memory query method according to an embodiment of the present invention;
[0022] Figure 3 This is a schematic diagram of a model of a task execution memory query method according to an embodiment of the present invention;
[0023] Figure 4 This is a schematic diagram of a preferred method for querying task execution memory according to an embodiment of the present invention;
[0024] Figure 5 This is a schematic diagram of the task transaction atomic orchestration service according to an embodiment of the present invention;
[0025] Figure 6 This is a schematic diagram of a task execution memory query device according to an embodiment of the present invention; Detailed Implementation
[0026] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.
[0027] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0028] Example 1
[0029] According to an embodiment of the present invention, a method embodiment of a task execution memory query method is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.
[0030] Figure 2 This is a flowchart of a task execution memory query method according to an embodiment of the present invention, such as... Figure 2 As shown, the method includes the following steps:
[0031] Step S202: Obtain the feature information of the target task. The feature information includes at least: task type information, task execution function and business requirement information. The task type information is the task type information of the target task. The task execution function is the function required to execute the target task. The business requirement information is the business requirement information of the target task.
[0032] In the above steps, the first step is to obtain the characteristic information of the target task to be executed. The characteristic information includes, but is not limited to: task type information, task execution function, and business requirement information. The task type information mainly indicates what type of task the target task is; the task execution function mainly indicates the set of functions required to execute and query the task; the business requirement type mainly indicates the main type of business requirement corresponding to the task.
[0033] Step S204: Obtain the proxy service information of the target task based on the task type information, wherein the proxy service information is the information of the proxy service module that executes the target task.
[0034] In the above steps, the proxy service information for the target task is obtained based on the task type information of the target task. The proxy service information can be used to query the information of the proxy service module that executes the target task. The proxy service module is similar to a "channel" that delivers the execution action of the target task to the task execution subject.
[0035] Step S206: Verify the feature information using the proxy service information. If the verification is successful, obtain the execution entity used to execute the target task.
[0036] Optionally, if the verification passes, the execution entity used to execute the target task is obtained; if the verification fails, the acquisition of the proxy service information of the target task will be initiated again to query and obtain the execution entity for executing the target task again.
[0037] As can be seen from the above, in this embodiment of the invention, the characteristic information of the target task can first be obtained. This characteristic information includes at least: task type information, task execution function, and business requirement information. The task type information refers to the task type of the target task; the task execution function is the function required to execute the target task; and the business requirement information is the business requirement information of the target task. Next, the proxy service information of the target task is obtained based on the task type information. This proxy service information is the information of the proxy service module that executes the target task. Finally, the characteristic information is verified using the proxy service information. If the verification passes, the execution entity used to execute the target task is obtained. The task execution memory query method provided by this embodiment of the invention achieves the goal of quickly querying the execution entity of the task based on the characteristic information of the target task and through the proxy service to accurately execute the task. This achieves the technical effect of improving the efficiency of parallel task processing, and solves the technical problem in related technologies where transaction performance degrades once the transaction concurrency increases in transaction atomicity.
[0038] As an optional embodiment, obtaining proxy service information for a target task based on task type information includes: connecting the target task to a web client, wherein the web client includes the Golang language; and querying the proxy service information through a nested client within the web client based on the task type information of the target task.
[0039] In the above optional embodiments, the target task first needs to be connected to the web client. Then, based on the task type of the target task, a query is performed through the nested client in the web client to obtain the corresponding proxy service information. It should be noted that the nested client is a type of client jointly developed by software vendors and transmission control protocol vendors that can convert between standards with inconsistent protocols.
[0040] As an optional embodiment, the proxy service information is obtained by querying the nested client in the web client based on the feature information of the target task, including: substituting the task execution function into the nested client to obtain the address information corresponding to the nested client; and obtaining the proxy service information based on the address information.
[0041] Figure 3 This is a schematic diagram of a model of a task execution memory query method according to an embodiment of the present invention, such as... Figure 3 As shown, the Golang web service receives business data and passes it to the Golang Unix domain socket server (a proxy service for querying shared memory) through the Golang Unix domain socket client. Based on the business content, it queries the local shared memory for data and finds the corresponding transaction atoms. The orchestration of transaction atoms in shared memory is accomplished by manipulating the data. After the transaction atoms are orchestrated, they are refreshed to the local shared memory via a data sharing connection.
[0042] The Go language proxy service for querying shared memory: It takes key-value pairs, feeds them into a hash function, and obtains the hash address of the corresponding data, improving query efficiency. During normal transactions, it reduces the time spent reading process configurations, improving program execution efficiency. Combined with Go's web services, it can also serve as a secondary cache for the database, facilitating the storage of static data during application development and providing convenience for future software application expansion.
[0043] As an optional embodiment, the feature information is verified through the proxy service information, including: performing business orchestration on the target task based on business requirement information, obtaining the orchestrated target task; and verifying the identity of the orchestrated target task.
[0044] Figure 4 This is a schematic diagram of a preferred method for querying task execution memory according to an embodiment of the present invention, such as... Figure 4 As shown, shared memory exists on every node, preventing resource contention during multi-application access. As a database cache, changes to atomic configurations in the database do not affect the normal production environment, ensuring transaction success rates. Since shared memory exists across multiple nodes, there is no single point of failure. Even if the database fails, transactions are unaffected, or if one node fails, it does not impact transactions on other nodes. Timely isolation of failed nodes further guarantees transaction success rates, providing a better user experience. Furthermore, this approach allows for cross-host business processes; different business subsystems can perform different atomic configurations within shared memory, enabling convenient and efficient development.
[0045] As an optional embodiment, business orchestration of the target task based on business requirements includes: obtaining the corresponding task orchestration function based on business requirement information; and performing business orchestration of the target task based on the task orchestration function.
[0046] In the above optional embodiments, business orchestration of the target task needs to be performed based on business requirements. The following is a detailed description of this process using an example. First, for business transaction A, a new business process orchestration is required. This only requires identifying the functions contained in the dynamic library (i.e., task orchestration functions), finding the corresponding function names according to business requirements, writing a major category process table based on transaction code A and its system code, defining the major category type such as CLASSTYPE, and then orchestrating the business process steps (such as configuring XXX verification) in the minor category table based on CLASSTYPE. Finally, in the atomic table, the atomic function names (1. Institutional verification 2. Unified authorization verification 3. Backend communication) are written according to the minor category flag of the process steps.
[0047] The key features of this transaction rule include: 1. Support for identifying different hosts and completing cross-host processes. 2. Configuring new transactions on top of existing transaction atoms requires no code modification, ensuring development agility and security.
[0048] It should be noted that when production transactions are launched, only the database configuration needs to be modified, and the process does not need to be restarted, ensuring the long-term stability and security of the production environment.
[0049] As an optional embodiment, before orchestrating the target task based on business requirements, the process includes: dividing and reorganizing the target task based on business requirement information to obtain multiple sub-tasks. The multiple sub-tasks include: a major category table, a minor category table, and an atomic table. The major category table, minor category table, and atomic table are sub-tasks with different levels of task granularity. The task granularity of the minor category table is greater than that of the atomic table and less than that of the major category table.
[0050] Figure 5This is a schematic diagram of the task transaction atomic orchestration service according to an embodiment of the present invention, such as... Figure 5 As shown, these transaction types are all arranged according to transaction atom rules. Transaction atom rules are mainly used to combine or reuse transaction atoms according to different business needs to realize different transaction types and complete corresponding business processes. They mainly divide multiple tasks into transaction categories, transaction subcategories, and transaction atoms, namely, category tables, subcategory tables, and atom tables.
[0051] As can be seen from the above, the embodiments provided by this invention offer an atomic technical implementation method. Specifically, it utilizes shared memory as a cache and a database for persistence, and implements a method for atomic transaction configuration based on Go. It combines Go language with shared memory, transmits data through Unix domain sockets, and uses hash to query shared content. It also provides a process orchestration design scheme: by designing a table structure and configuring different transaction types, it can reduce development tasks, improve development efficiency, and freely configure business processes using existing atomic transactions.
[0052] Furthermore, the method provided in this embodiment of the invention has the following advantages:
[0053] 1. When a system node malfunctions, transactions are minimally affected, and the problem can be easily isolated, ensuring system security.
[0054] 2. The transaction configuration does not access the database, but accesses shared memory, which reduces access time, shortens transaction duration, and improves application performance.
[0055] 3. Achieve atomic configuration of transactions. Developers only need to write their own business atoms to freely combine business processes, avoiding redundant development and improving development efficiency.
[0056] Example 2
[0057] According to another aspect of the present invention, a device for querying task execution memory is also provided. Figure 6 This is a schematic diagram of a task execution memory query device according to an embodiment of the present invention, such as... Figure 6 As shown, it includes: a first acquisition module 61, a second acquisition module 63, and a verification module 65. The memory query device for this task execution will be described below.
[0058] The first acquisition module 61 is used to acquire the feature information of the target task. The feature information includes at least: task type information, task execution function and business requirement information. The task type information is the task type information of the target task, the task execution function is the function required to execute the target task, and the business requirement information is the business requirement information of the target task.
[0059] The second acquisition module 63 is used to acquire the proxy service information of the target task based on the task type information, wherein the proxy service information is the information of the proxy service module that executes the target task.
[0060] The verification module 65 is used to verify the feature information through the proxy service information, and if the verification is passed, the execution entity used to execute the target task is obtained.
[0061] It should be noted that the first acquisition module 61, the second acquisition module 63, and the verification module 65 mentioned above correspond to steps S202 to S206 in Embodiment 1. The instances and application scenarios implemented by the above modules and their corresponding steps are the same, but they are not limited to the content disclosed in Embodiment 1. It should be noted that the above modules, as part of the device, can be executed in a computer system such as a set of computer-executable instructions.
[0062] As can be seen from the above, in this embodiment of the invention, the first acquisition module 61 can first acquire the feature information of the target task, wherein the feature information includes at least: task type information, task execution function, and business requirement information. The task type information is the task type information of the target task, the task execution function is the function required to execute the target task, and the business requirement information is the business requirement information of the target task. Then, the second acquisition module 63 acquires the proxy service information of the target task based on the task type information, wherein the proxy service information is the information of the proxy service module that executes the target task. Finally, the verification module 65 verifies the feature information through the proxy service information. If the verification is passed, the execution entity used to execute the target task is acquired. Through the task execution memory query device provided by this embodiment of the invention, the purpose of quickly querying the execution entity of the task based on the feature information of the target task and through the proxy service is achieved to accurately execute the task, thereby realizing the technical effect of improving the efficiency of parallel task processing, and thus solving the technical problem in related technologies where the transaction performance degrades once the transaction concurrency increases in transaction atomicity.
[0063] As an optional embodiment, the second acquisition module includes: an access unit for accessing the target task to a web client, wherein the web client includes the Golang language; and a query unit for querying proxy service information based on the task type information of the target task through a nested client in the web client.
[0064] As an optional embodiment, the query unit includes: a first acquisition unit, used to substitute the task execution function into the nested word client to obtain address information corresponding to the nested word client; and a second acquisition unit, used to obtain proxy service information based on the address information.
[0065] As an optional embodiment, the verification module includes: an orchestration unit for orchestrating the target task based on business requirement information and obtaining the orchestrated target task; and a verification unit for authenticating the orchestrated target task.
[0066] Optionally, the orchestration unit includes: an acquisition subunit for acquiring the corresponding task orchestration function based on business requirement information; and an orchestration subunit for performing business orchestration on the target task based on the task orchestration function.
[0067] As an optional embodiment, the method further includes: a segmentation and reorganization unit, used to segment and reorganize the target task based on business requirements information before performing business orchestration on the target task based on business requirements, and obtain multiple sub-tasks, wherein the multiple sub-tasks include: a major category table, a minor category table, and an atomic table, the major category table, the minor category table, and the atomic table are sub-tasks with different levels of task granularity, and the task granularity of the minor category table is greater than that of the atomic table and smaller than that of the major category table.
[0068] Example 3
[0069] According to another aspect of the present invention, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored computer program, wherein, when the computer program is run by a processor, it controls the device where the computer-readable storage medium is located to perform any of the above-described task execution memory query methods.
[0070] Example 4
[0071] According to another aspect of the present invention, a processor is also provided, which is used to run a computer program, wherein the computer program executes any of the above-described methods for querying task execution memory.
[0072] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.
[0073] In the above embodiments of the present invention, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.
[0074] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. The device embodiments described above are merely illustrative; for example, the division of units can be a logical functional division, and in actual implementation, there may be other division methods. For instance, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual coupling, direct coupling, or communication connection may be through some interfaces; the indirect coupling or communication connection between units or modules may be electrical or other forms.
[0075] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0076] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0077] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks.
[0078] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.
Claims
1. A method for querying memory during task execution, characterized in that, include: Obtain feature information of the target task, wherein the feature information includes at least: task type information, task execution function, and business requirement information, wherein the task type information is the task type information of the target task, the task execution function is the function required to execute the target task, and the business requirement information is the business requirement information of the target task; Based on the task type information, the proxy service information of the target task is obtained, wherein the proxy service information is the information of the proxy service module that executes the target task; The feature information is verified using the proxy service information. If the verification passes, the execution entity for executing the target task is obtained. Based on the task type information, obtain the proxy service information for the target task, including: The target task is connected to a web client, wherein the web client includes the Golang language; Based on the task type information of the target task, the proxy service information is obtained by querying the nested client in the web client. Based on the feature information of the target task, the proxy service information is obtained by querying through the nested client in the web client, including: Substitute the task execution function into the nested word client to obtain the address information corresponding to the nested word client; Based on the address information, obtain the proxy service information.
2. The method according to claim 1, characterized in that, Verifying the feature information using the proxy service information includes: Based on the business requirement information, the target task is orchestrated to obtain the orchestrated target task. The orchestrated target task is then authenticated.
3. The method according to claim 2, characterized in that, Based on the aforementioned business requirements, the target task is orchestrated, including: Obtain the corresponding task orchestration function based on the aforementioned business requirement information; The target task is orchestrated based on the task orchestration function.
4. The method according to claim 2, characterized in that, Before orchestrating the target task based on the business requirements, the method further includes: Based on the business requirement information, the target task is segmented and reorganized to obtain multiple sub-tasks. The multiple sub-tasks include a major category table, a minor category table, and an atomic table. The major category table, the minor category table, and the atomic table are sub-tasks with different levels of task granularity. The task granularity of the minor category table is greater than that of the atomic table and smaller than that of the major category table.
5. A device for querying task execution memory, characterized in that, include: The first acquisition module is used to acquire feature information of the target task, wherein the feature information includes at least: task type information, task execution function and business requirement information, the task type information is the task type information of the target task, the task execution function is the function required to execute the target task, and the business requirement information is the business requirement information of the target task; The second acquisition module is used to acquire the proxy service information of the target task based on the task type information, wherein the proxy service information is the information of the proxy service module that executes the target task; The verification module is used to verify the feature information using the proxy service information. If the verification passes, the module obtains the execution entity used to execute the target task. The second acquisition module includes: an access unit for connecting the target task to a web client, wherein the web client is written in Golang; and a query unit for querying proxy service information based on the task type information of the target task through a nested sub-client within the web client. The query unit includes: a first acquisition unit, used to substitute the task execution function into the nested client to obtain the address information corresponding to the nested client; and a second acquisition unit, used to obtain proxy service information based on the address information.
6. A system for querying memory during task execution, characterized in that, The task execution memory query system is used to execute the task execution memory query method according to any one of claims 1 to 4.
7. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein, when the computer program is executed by a processor, it controls the device containing the computer-readable storage medium to perform a task execution memory query method as described in any one of claims 1 to 4.
8. A processor, characterized in that, The processor is used to run a computer program, wherein the computer program executes the task execution memory query method according to any one of claims 1 to 4.
Citation Information
Patent Citations
A multi-command concurrent agent service method and system based on a Linux system
CN109669724A
Task allocation processing method and device and workflow system
CN112613845A