CN111857970A - Scheduling method and system based on multiple dependent processes - Google Patents

Scheduling method and system based on multiple dependent processes Download PDF

Info

Publication number
CN111857970A
CN111857970A CN202010744119.5A CN202010744119A CN111857970A CN 111857970 A CN111857970 A CN 111857970A CN 202010744119 A CN202010744119 A CN 202010744119A CN 111857970 A CN111857970 A CN 111857970A
Authority
CN
China
Prior art keywords
sub
dependency relationship
program
script
data
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
CN202010744119.5A
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.)
Beijing Si Tech Information Technology Co Ltd
Original Assignee
Beijing Si Tech Information Technology 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 Beijing Si Tech Information Technology Co Ltd filed Critical Beijing Si Tech Information Technology Co Ltd
Priority to CN202010744119.5A priority Critical patent/CN111857970A/en
Publication of CN111857970A publication Critical patent/CN111857970A/en
Pending legal-status Critical Current

Links

Images

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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45504Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
    • G06F9/45508Runtime interpretation or emulation, e g. emulator loops, bytecode interpretation
    • G06F9/45512Command shells
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/079Root cause analysis, i.e. error or fault diagnosis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3003Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/302Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a software system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3065Monitoring arrangements determined by the means or processing involved in reporting the monitored data
    • 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45504Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
    • G06F9/45529Embedded in an application, e.g. JavaScript in a Web browser
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/865Monitoring of software

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Computing Systems (AREA)
  • Health & Medical Sciences (AREA)
  • Biomedical Technology (AREA)
  • Mathematical Physics (AREA)
  • Stored Programmes (AREA)

Abstract

The invention discloses a scheduling method and a scheduling system based on multiple dependent processes, and relates to the field of process scheduling. The method comprises the following steps: the method comprises the steps of configuring the dependency relationship of a plurality of script files into an entry program, entering a sub-process for obtaining target data through the entry program, calling a sub-process script to combine with the dependency relationship to generate the target data, integrating data acquisition and data statistics by adopting a uniform entry mode, and solving the problem that a plurality of acquisition programs and statistical programs are abnormal due to the problems of data dependency relationship, data arrival time and the like.

Description

Scheduling method and system based on multiple dependent processes
Technical Field
The invention relates to the field of process scheduling, in particular to a scheduling method and a scheduling system based on multiple dependent processes.
Background
In a complex data environment, when the statistical analysis of multiple data sources is carried out, due to the difference of data arrival time, the data have more mutual dependency relationship, the existing scheme can not realize rapid analysis and statistics, simultaneously reduces the manual checking work, and eliminates the abnormal statistical analysis caused by the data lack of the dependency relationship.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a scheduling method and system based on multiple dependent processes aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
a scheduling method based on multiple dependent processes comprises the following steps:
s1, configuring the dependency relationship of multiple script files into the inlet program;
s2, entering a sub-process for obtaining target data through the entrance program;
and S3, calling a sub-process script to combine the dependency relationship to generate the target data.
The invention has the beneficial effects that: according to the scheme, the sub-process is entered through the entry program with the dependency relationship of a plurality of script files, the sub-process script is called to combine the dependency relationship to generate the target data, data acquisition and data statistics are integrated in a unified entry mode, and the abnormity caused by the problems of data dependency relationship, data arrival time and the like of a plurality of acquisition programs and statistical programs is solved.
Further, the S1 is preceded by: establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs.
The beneficial effect of adopting the further scheme is that: according to the scheme, the dependency relationship among the script files is established, so that the scheduling when a plurality of acquisition programs or statistical programs have the dependency relationship is realized, and the problem of calling the programs with the dependency relationship is solved.
Further, the S3 is preceded by:
determining and generating associated data of the target data according to the dependency relationship;
checking whether the associated data exist, if so, performing step 3, and if not, performing step 2.
The beneficial effect of adopting the further scheme is that: according to the scheme, the associated data of the target data is determined and generated through the dependency relationship, the associated data is verified, and when the target data is required to be obtained, whether the associated data exists or not is ensured, so that a basic data source for executing the sub-process is ensured, and a data condition is provided for obtaining the target data.
Further, the S3 further includes: recording a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and if the program log passes the verification, finishing the sub-process; and if the verification is not passed, performing step 2.
The beneficial effect of adopting the further scheme is that: according to the scheme, the program log of the sub-process script is verified, so that unified output and verification of numerous programs are realized, errors occurring in the process are found in time, and the problems of manual checking and repeated execution are reduced.
Further, after the verification fails, the method specifically includes: judging whether other sub-processes are executed, if so, performing the step 2; if not, the flow ends.
The beneficial effect of adopting the further scheme is that: according to the scheme, a new round of cyclic calling is carried out on the sub-processes which do not pass the verification, so that when errors are found in the sub-processes, the error links are quickly positioned, the subsequent processes are quickly processed, manual operation is effectively reduced, the next sub-process is timely carried out, correct data are obtained, the error content is further covered, and further influence caused by the process errors is avoided.
Another technical solution of the present invention for solving the above technical problems is as follows:
a multi-dependent process based scheduling system comprising: the system comprises a configuration module, an entrance program module and a scheduling generation module;
the configuration module is used for configuring the dependency relationship of the script files into an inlet program;
the entrance program module is used for entering a sub-process for obtaining target data through the entrance program;
and the scheduling generation module is used for calling a sub-process script and generating the target data by combining the dependency relationship.
The invention has the beneficial effects that: according to the scheme, the sub-process is entered through the entry program with the dependency relationship of a plurality of script files, the sub-process script is called to combine the dependency relationship to generate the target data, data acquisition and data statistics are integrated in a unified entry mode, and the abnormity caused by the problems of data dependency relationship, data arrival time and the like of a plurality of acquisition programs and statistical programs is solved.
Further, still include: the dependency relationship establishing module is used for establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs.
The beneficial effect of adopting the further scheme is that: the beneficial effect of adopting the further scheme is that: according to the scheme, the dependency relationship among the script files is established, so that the scheduling when a plurality of acquisition programs or statistical programs have the dependency relationship is realized, and the problem of calling the programs with the dependency relationship is solved.
Further, still include: the associated data checking module is used for determining and generating associated data of the target data according to the dependency relationship;
and checking whether the associated data exist, if so, calling a sub-process script to combine the dependency relationship to generate the target data, and if not, entering an entry program to enter a next sub-process.
The beneficial effect of adopting the further scheme is that: the beneficial effect of adopting the further scheme is that: according to the scheme, the associated data of the target data is determined and generated through the dependency relationship, the associated data is verified, and when the target data is required to be obtained, whether the associated data exists or not is ensured, so that a basic data source for executing the sub-process is ensured, and a data condition is provided for obtaining the target data.
Further, the scheduling generation module is further configured to record a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and if the program log passes the verification, finishing the sub-process; if the verification is not passed, entering an entrance program to enter the next sub-process.
The beneficial effect of adopting the further scheme is that: according to the scheme, the program log of the sub-process script is verified, so that unified output and verification of numerous programs are realized, errors occurring in the process are found in time, and the problems of manual checking and repeated execution are reduced.
Further, the scheduling generation module is further specifically configured to determine whether to execute other sub-processes, and if so, enter the entry program to enter the next sub-process; if not, the flow ends.
The beneficial effect of adopting the further scheme is that: according to the scheme, a new round of cyclic calling is carried out on the sub-processes which do not pass the verification, so that when errors are found in the sub-processes, the error links are quickly positioned, the subsequent processes are quickly processed, manual operation is effectively reduced, the next sub-process is timely carried out, correct data are obtained, the error content is further covered, and further influence caused by the process errors is avoided.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
Fig. 1 is a schematic flowchart of a scheduling method based on multiple dependent processes according to an embodiment of the present invention;
fig. 2 is a structural framework diagram of a scheduling system based on multiple dependent processes according to an embodiment of the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth to illustrate, but are not to be construed to limit the scope of the invention.
As shown in fig. 1, a scheduling method based on multiple dependent processes provided in an embodiment of the present invention includes: s1, configuring the dependency relationship of multiple script files into the inlet program; the entry program is used for controlling the flow circulation, judging whether the log has errors, starting the next sub-flow circulation and the like. Wherein the dependency relationship may include: the relationship between scripts and the corresponding script names.
In some examples, obtaining the dependencies may include: and establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs. Wherein the application program can comprise a collecting program, a statistic program and the like. In some examples, the dependencies are, for example: program A generates data DA, program B generates data DB, program C generates data DC, and data DD can be generated only when program D exists in the same time in DA, DB, DC.
S2, entering a sub-process for obtaining target data through an entrance program; the target data can include an example table, the sub-process is equivalent to generating C according to A and B, after the sub-process completes the process of generating C, the subsequent main process is reused for C, the sub-process for generating C does not need to be operated, and the data in C can be directly used.
And S3, calling the sub-process script to combine with the dependency relationship to generate target data.
In some examples, it may further include: recording a program log of the sub-process script; verifying the program log according to a preset operation identifier, and finishing the sub-process if the program log passes the verification; and if the verification is not passed, performing step 2.
According to the scheme, the sub-process is entered through the entry program with the dependency relationship of a plurality of script files, the sub-process script is called to combine with the dependency relationship to generate target data, data acquisition and data statistics are integrated in a unified entry mode, and the abnormity caused by the problems of data dependency relationship, data arrival time and the like of a plurality of acquisition programs and statistical programs is solved.
Preferably, in any of the above embodiments, S1 may be preceded by: and establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs.
According to the scheme, the dependency relationship among the script files is established, so that the scheduling when a plurality of acquisition programs or statistical programs have the dependency relationship is realized, and the problem of calling the programs with the dependency relationship is solved.
Preferably, in any of the above embodiments, S3 may be preceded by:
determining and generating associated data of the target data according to the dependency relationship;
checking whether the associated data exists, if so, performing step 3, and if not, performing step 2.
In certain embodiments, it is checked whether associated data exists, for example: and the C table is generated according to the AB, and the data of the A table and the B table are verified and checked to be existed or not, and if the data of the A table and the B table exist, the check is passed.
According to the scheme, the associated data of the target data is determined and generated through the dependency relationship, the associated data is verified, and when the target data is required to be obtained, whether the associated data exists or not is ensured, so that a basic data source for executing the sub-process is ensured, and a data condition is provided for obtaining the target data.
Preferably, in any of the above embodiments, S3 further includes: recording a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and finishing the sub-process if the program log passes the verification; and if the verification is not passed, performing step 2. Wherein the preset running representation may comprise a script execution success identification.
According to the scheme, the program log of the sub-process script is verified, so that unified output and verification of numerous programs are realized, errors occurring in the process are found in time, and the problems of manual checking and repeated execution are reduced.
Preferably, in any of the above embodiments, after the verification fails, the method further specifically includes: judging whether other sub-processes are executed, if so, performing the step 2; if not, the flow ends.
According to the scheme, a new round of cyclic calling is carried out on the sub-processes which do not pass the verification, so that when errors are found in the sub-processes, the error links are quickly positioned, the subsequent processes are quickly processed, manual operation is effectively reduced, the next sub-process is timely carried out, correct data are obtained, the error content is further covered, and further influence caused by the process errors is avoided.
In one embodiment, as shown in fig. 2, a multi-dependent process based scheduling system includes: a configuration module 11, a portal program module 12 and a schedule generation module 13;
the configuration module 11 is used for configuring the dependency relationship of a plurality of script files into an entry program;
the portal program module 12 is used for entering into a sub-process for obtaining target data through a portal program;
the scheduling generation module 13 is configured to invoke a sub-process script to generate target data in combination with the dependency relationship.
According to the scheme, the sub-process is entered through the entry program with the dependency relationship of a plurality of script files, the sub-process script is called to combine with the dependency relationship to generate target data, data acquisition and data statistics are integrated in a unified entry mode, and the abnormity caused by the problems of data dependency relationship, data arrival time and the like of a plurality of acquisition programs and statistical programs is solved.
Preferably, in any of the above embodiments, further comprising: and the dependency relationship establishing module is used for establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the script files according to the dependency relationship of the application programs.
The beneficial effect of adopting the further scheme is that: according to the scheme, the dependency relationship among the script files is established, so that the scheduling when a plurality of acquisition programs or statistical programs have the dependency relationship is realized, and the problem of calling the programs with the dependency relationship is solved.
Preferably, in any of the above embodiments, further comprising: the associated data checking module is used for determining and generating associated data of the target data according to the dependency relationship;
and checking whether the associated data exist, if so, calling a sub-process script to combine with the dependency relationship to generate target data, and if not, entering an entry program to enter a next sub-process.
The beneficial effect of adopting the further scheme is that: according to the scheme, the associated data of the target data is determined and generated through the dependency relationship, the associated data is verified, and when the target data is required to be obtained, whether the associated data exists or not is ensured, so that a basic data source for executing the sub-process is ensured, and a data condition is provided for obtaining the target data.
Preferably, in any of the above embodiments, the schedule generating module 13 is further configured to record a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and finishing the sub-process if the program log passes the verification; if the verification is not passed, entering an entrance program to enter the next sub-process.
According to the scheme, the program log of the sub-process script is verified, so that unified output and verification of numerous programs are realized, errors occurring in the process are found in time, and the problems of manual checking and repeated execution are reduced.
Preferably, in any of the above embodiments, the schedule generating module 13 is further specifically configured to determine whether to execute other sub-processes, and if so, enter the entry program to enter the next sub-process; if not, the flow ends.
According to the scheme, a new round of cyclic calling is carried out on the sub-processes which do not pass the verification, so that when errors are found in the sub-processes, the error links are quickly positioned, the subsequent processes are quickly processed, manual operation is effectively reduced, the next sub-process is timely carried out, correct data are obtained, the error content is further covered, and further influence caused by the process errors is avoided.
It is understood that some or all of the alternative embodiments described above may be included in some embodiments.
It should be noted that the above embodiments are product embodiments corresponding to the previous method embodiments, and for the description of each optional implementation in the product embodiments, reference may be made to corresponding descriptions in the above method embodiments, and details are not described here again.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described method embodiments are merely illustrative, and for example, the division of steps into only one logical functional division may be implemented in practice in another way, for example, multiple steps may be combined or integrated into another step, or some features may be omitted, or not implemented.
The above method, if implemented in the form of software functional units 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 invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (10)

1. A scheduling method based on multiple dependent processes is characterized by comprising the following steps:
s1, configuring the dependency relationship of multiple script files into the inlet program;
s2, entering a sub-process for obtaining target data through the entrance program;
and S3, calling a sub-process script to combine the dependency relationship to generate the target data.
2. The multi-dependent process based scheduling method of claim 1, wherein said S1 is preceded by: establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs.
3. The method according to claim 1 or 2, wherein the S3 is preceded by:
determining and generating associated data of the target data according to the dependency relationship;
checking whether the associated data exist, if so, performing step 3, and if not, performing step 2.
4. The method according to claim 1 or 2, wherein the S3 further comprises: recording a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and if the program log passes the verification, finishing the sub-process; and if the verification is not passed, performing step 2.
5. The scheduling method based on multiple dependent processes according to claim 4, wherein the verifying further specifically comprises, after failing to pass: judging whether other sub-processes are executed, if so, performing the step 2; if not, the flow ends.
6. A multi-dependent process based scheduling system, comprising: the system comprises a configuration module, an entrance program module and a scheduling generation module;
the configuration module is used for configuring the dependency relationship of the script files into an inlet program;
the entrance program module is used for entering a sub-process for obtaining target data through the entrance program;
and the scheduling generation module is used for calling a sub-process script and generating the target data by combining the dependency relationship.
7. The multi-dependent process based scheduling system of claim 6, further comprising: the dependency relationship establishing module is used for establishing a plurality of corresponding script files according to a plurality of application programs to be uniformly scheduled, and establishing the dependency relationship of the plurality of script files according to the dependency relationship of the plurality of application programs.
8. The system according to claim 6 or 7, further comprising: the associated data checking module is used for determining and generating associated data of the target data according to the dependency relationship;
and checking whether the associated data exist, if so, calling a sub-process script to combine the dependency relationship to generate the target data, and if not, entering an entry program to enter a next sub-process.
9. The system according to claim 6 or 7, wherein the schedule generation module is further configured to record a program log of the sub-process script;
verifying the program log according to a preset operation identifier, and if the program log passes the verification, finishing the sub-process; if the verification is not passed, entering the entry program to enter the next sub-process.
10. The scheduling system based on multiple dependent processes according to claim 9, wherein the scheduling generation module is further specifically configured to determine whether to execute other sub-processes, and if so, enter the entry program to enter a next sub-process; if not, the flow ends.
CN202010744119.5A 2020-07-29 2020-07-29 Scheduling method and system based on multiple dependent processes Pending CN111857970A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010744119.5A CN111857970A (en) 2020-07-29 2020-07-29 Scheduling method and system based on multiple dependent processes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010744119.5A CN111857970A (en) 2020-07-29 2020-07-29 Scheduling method and system based on multiple dependent processes

Publications (1)

Publication Number Publication Date
CN111857970A true CN111857970A (en) 2020-10-30

Family

ID=72946777

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010744119.5A Pending CN111857970A (en) 2020-07-29 2020-07-29 Scheduling method and system based on multiple dependent processes

Country Status (1)

Country Link
CN (1) CN111857970A (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11134307A (en) * 1997-10-31 1999-05-21 Toshiba Corp Program development supporting device and method therefor and recording medium for recording program development supporting software
EP2290535A1 (en) * 2009-08-31 2011-03-02 ACCENTURE Global Services GmbH Integration environment generator
US20120047497A1 (en) * 2007-06-08 2012-02-23 Apple Inc. Asynchronous load of source dependencies
CN107608774A (en) * 2017-09-08 2018-01-19 新智云数据服务有限公司 A kind of method for scheduling task, device, equipment and storage medium
CN109086986A (en) * 2018-07-20 2018-12-25 中国邮政储蓄银行股份有限公司 job scheduling method and device
CN109902489A (en) * 2019-02-18 2019-06-18 福建六壬网安股份有限公司 A kind of method and device detecting loophole script
CN110162387A (en) * 2019-04-09 2019-08-23 口口相传(北京)网络技术有限公司 Thread scheduling method, device, computer equipment and computer readable storage medium
CN110865888A (en) * 2019-11-28 2020-03-06 米哈游科技(上海)有限公司 Resource loading method and device, server and storage medium
CN110968358A (en) * 2018-09-30 2020-04-07 北京国双科技有限公司 Method and device for loading script module based on browser plug-in
CN111309464A (en) * 2020-02-12 2020-06-19 杭州涂鸦信息技术有限公司 Task scheduling method and system

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11134307A (en) * 1997-10-31 1999-05-21 Toshiba Corp Program development supporting device and method therefor and recording medium for recording program development supporting software
US20120047497A1 (en) * 2007-06-08 2012-02-23 Apple Inc. Asynchronous load of source dependencies
EP2290535A1 (en) * 2009-08-31 2011-03-02 ACCENTURE Global Services GmbH Integration environment generator
CN107608774A (en) * 2017-09-08 2018-01-19 新智云数据服务有限公司 A kind of method for scheduling task, device, equipment and storage medium
CN109086986A (en) * 2018-07-20 2018-12-25 中国邮政储蓄银行股份有限公司 job scheduling method and device
CN110968358A (en) * 2018-09-30 2020-04-07 北京国双科技有限公司 Method and device for loading script module based on browser plug-in
CN109902489A (en) * 2019-02-18 2019-06-18 福建六壬网安股份有限公司 A kind of method and device detecting loophole script
CN110162387A (en) * 2019-04-09 2019-08-23 口口相传(北京)网络技术有限公司 Thread scheduling method, device, computer equipment and computer readable storage medium
CN110865888A (en) * 2019-11-28 2020-03-06 米哈游科技(上海)有限公司 Resource loading method and device, server and storage medium
CN111309464A (en) * 2020-02-12 2020-06-19 杭州涂鸦信息技术有限公司 Task scheduling method and system

Similar Documents

Publication Publication Date Title
CN109614324A (en) A kind of method for generating test case and device
US10970198B2 (en) Automatic test system and method thereof
US20020116153A1 (en) Test automation framework
CN100520732C (en) Performance test script generation method
Marijan et al. Practical selective regression testing with effective redundancy in interleaved tests
CN116627848B (en) Automatic test method and system for application program
CN115328784A (en) Agile interface-oriented automatic testing method and system
CN112650676A (en) Software testing method, device, equipment and storage medium
CN110990289B (en) Method and device for automatically submitting bug, electronic equipment and storage medium
CN111240974A (en) Log output method and device, electronic equipment and medium
CN111611154B (en) Regression testing method, device and equipment
US6983216B2 (en) Test automation method and tool with dynamic attributes and value sets integration
CN114996127A (en) Intelligent test method and system for solid state disk firmware module
KR20070079033A (en) Methods and systems for derivation of missing data objects from test data
CN111857970A (en) Scheduling method and system based on multiple dependent processes
CN107102938B (en) Test script updating method and device
CN111198798B (en) Service stability measuring method and device
CN112905438A (en) Automatic testing method and device
CN112132544B (en) Inspection method and device of business system
CN110347589B (en) Software unit test automatic detection method and system
CN114518885A (en) Information collection method and device, electronic equipment and storage medium
CN113849484A (en) Big data component upgrading method and device, electronic equipment and storage medium
CN113111009A (en) Software testing device and testing method
CN114138677B (en) Test method and device, test system and electronic equipment
CN100501698C (en) Method and system for automatic checking for man-machine command

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