CN110471754B - Data display method, device, equipment and storage medium in job scheduling - Google Patents
Data display method, device, equipment and storage medium in job scheduling Download PDFInfo
- Publication number
- CN110471754B CN110471754B CN201910776943.6A CN201910776943A CN110471754B CN 110471754 B CN110471754 B CN 110471754B CN 201910776943 A CN201910776943 A CN 201910776943A CN 110471754 B CN110471754 B CN 110471754B
- Authority
- CN
- China
- Prior art keywords
- subtask
- job
- graph
- dependency relationship
- subtasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
Abstract
An embodiment of the specification provides a data display method, a device, equipment and a storage medium in job scheduling, wherein the method comprises the following steps: providing a set of operable graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships; generating and displaying a job dependency relationship graph of the subtask set based on the graph establishing operation of the user for the nodes and the directed connectors; and acquiring the execution state of the subtask in the subtask set at fixed time, and displaying the execution state on the operation dependency relationship diagram. The embodiment of the specification can visually display the job dependency relationship and the execution condition of the subtasks when the system schedules the jobs.
Description
Technical Field
The present disclosure relates to the field of distributed batch job scheduling technologies, and in particular, to a method, an apparatus, a device, and a storage medium for displaying data in job scheduling.
Background
Distributed batch job scheduling refers to the automated execution of tasks based on a given point in time, time interval, and number of executions. Wherein a task can be split into multiple independent subtasks, and then one or more of the subtasks are executed by the distributed servers, respectively. Job dependency refers to the execution of a batch scheduling job of subtasks, relying on the completion of one or more subtasks that precede it.
At present, in the existing distributed task scheduling technology, the processing procedure for the existing dependency relationship generally includes: 1. generating a job dependency relation table according to the sequence logic of the service; 2. analyzing the operation relation table into a specific data structure, such as an xml configuration file; 3. the system reads the relevant configuration and analyzes the job dependency relationship and judges whether the job can be called.
However, in the prior art, when the system schedules a job to run, the job dependency and execution condition of each subtask are not intuitively shown.
Disclosure of Invention
An object of the embodiments of the present specification is to provide a method, an apparatus, a device, and a storage medium for displaying data in job scheduling, so as to visually display job dependency and execution conditions of subtasks when a system schedules a job.
In order to achieve the above object, in one aspect, an embodiment of the present specification provides a data display method in job scheduling, including:
providing a set of operable graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
generating and displaying a job dependency relationship graph of the subtask set based on the graph establishing operation of the user for the nodes and the directed connectors;
and acquiring the execution state of the subtask in the subtask set at fixed time, and displaying the execution state on the operation dependency relationship diagram.
The data display method in job scheduling in the embodiment of the present specification further includes:
and receiving modification operation of a user for the job dependency relationship diagram, and modifying the job dependency relationship diagram according to the modification operation.
In the data presentation method in job scheduling according to the embodiment of the present specification, the modifying operation includes any one or more of:
increasing the dependency relationship between the subtask and other subtasks in the subtask set;
deleting the subtask and the dependency relationship between the subtask and other subtasks in the subtask set;
and modifying the dependency relationship between the subtask and other subtasks in the subtask set.
In the data presentation method in job scheduling according to the embodiment of the present specification, the periodically acquiring the execution state of the subtask in the subtask set includes:
and reading the execution state of the subtask in the subtask set from the locally cached job instance table.
In the data presentation method in job scheduling according to the embodiment of the present specification, the presenting the execution state on the job dependency graph includes:
and displaying the execution completion condition of the front subtask of the subtask on the node corresponding to the subtask.
In the data presentation method in job scheduling according to the embodiment of the present specification, the presenting the execution state on the job dependency graph further includes:
and displaying the planned execution time of the subtasks on the nodes corresponding to the subtasks.
The data display method in job scheduling in the embodiment of the present specification further includes:
extracting the job dependency relationship and the plan execution time of the subtask in the subtask set from the job dependency relationship graph;
and writing the operation dependency relationship and the scheduled execution time into an operation instance table of a local cache.
On the other hand, an embodiment of the present specification further provides a data presentation apparatus in job scheduling, including:
a component providing module for providing an operable set of graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
the graph generation module is used for generating and displaying the job dependency graph of the subtask set based on the graph establishment operation of the user aiming at the nodes and the directed connectors;
and the graph display module is used for acquiring the execution state of the subtask in the subtask set at regular time and displaying the execution state on the operation dependency graph.
The data presentation apparatus in job scheduling according to the embodiment of the present specification further includes:
and the graph modification module is used for receiving the modification operation of the user aiming at the job dependency relationship graph and modifying the job dependency relationship graph according to the modification operation.
In the data presentation apparatus in job scheduling according to the embodiment of the present specification, the modification operation includes any one or more of:
increasing the dependency relationship between the subtask and other subtasks in the subtask set;
deleting the subtask and the dependency relationship between the subtask and other subtasks in the subtask set;
and modifying the dependency relationship between the subtask and other subtasks in the subtask set.
The data presentation apparatus in job scheduling according to an embodiment of this specification, the periodically acquiring an execution state of a subtask in the subtask set, includes:
and reading the execution state of the subtask in the subtask set from the locally cached job instance table.
The data presentation apparatus in job scheduling according to an embodiment of the present specification, which presents the execution state on the job dependency graph, includes:
and displaying the execution completion condition of the front subtask of the subtask on the node corresponding to the subtask.
The data presentation apparatus in job scheduling according to an embodiment of the present specification, which presents the execution state on the job dependency graph, further includes:
and displaying the planned execution time of the subtasks on the nodes corresponding to the subtasks.
The data presentation apparatus in job scheduling according to the embodiment of the present specification further includes:
and the data writing module is used for extracting the job dependency relationship and the scheduled execution time of the subtask in the subtask set from the job dependency relationship graph and writing the job dependency relationship and the scheduled execution time into a job instance table of a local cache.
In another aspect, the present specification further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory, and when the computer program is executed by the processor, the computer program performs the data presentation method described above.
In another aspect, the present specification further provides a computer storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the data presentation method described above.
As can be seen from the technical solutions provided by the embodiments of the present specification, in the embodiments of the present specification, after providing an operable graph component set to a user, based on a graph building operation of the user for nodes and directed connectors, an operation dependency graph of a subtask set may be generated and displayed to the user; and then, the execution state of the subtask in the subtask set can be obtained at regular time, and the execution state is displayed on the job dependency relationship diagram, so that the job dependency relationship and the execution condition of the subtask can be visually displayed when the system schedules the job.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present specification, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort. In the drawings:
FIG. 1 is a flow diagram of a method for data presentation in job scheduling in some embodiments of the present description;
FIG. 2 is a schematic diagram of a job dependency graph in one embodiment of the present specification;
FIG. 3 is a flow diagram of a method for presenting data during job scheduling in further embodiments of the present description;
FIG. 4 is a block diagram of a data presentation device in job scheduling in some embodiments of the present description;
FIG. 5 is a block diagram of a computer device in some embodiments of the present description.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step should fall within the scope of protection of the present specification.
The data display method in job scheduling according to the embodiment of the present specification can be applied to a distributed job system. For example, in some embodiments of the present description, the present invention may be applied to a data presentation apparatus in a distributed operating system. The data presentation device may be a server in a distributed operating system. In an embodiment of the present specification, the server may be an electronic device having computing and network interaction functions; software that runs in the electronic device and provides business logic for data processing and network interaction is also possible.
Referring to fig. 1, a data presentation method in job scheduling according to some embodiments of the present specification may include the following steps:
s101, providing an operable graphic assembly set; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
s102, generating and displaying a job dependency relationship graph of the subtask set based on the graph establishing operation of the user for the nodes and the directed connectors;
s103, acquiring the execution state of the subtask in the subtask set at regular time, and displaying the execution state on the job dependency graph.
Therefore, in the embodiment of the specification, after the operable graphic component set is provided for the user, the job dependency relationship graph of the subtask set can be generated and displayed to the user based on the graph building operation of the user for the nodes and the directed connectors; and then, the execution state of the subtask in the subtask set can be obtained at regular time, and the execution state is displayed on the job dependency relationship diagram, so that the job dependency relationship and the execution condition of the subtask can be visually displayed when the system schedules the job.
In some embodiments of the present description, the set of graph components that are provided to be operable may include some other graph components (e.g., "add," "delete," "modify," "confirm," "return," etc. components) in addition to the nodes and directed connectors to facilitate the user to dynamically draw the job dependency graph. The node may be in any shape, for example, in the exemplary embodiment shown in fig. 2, the node may be in a rectangular frame shape to facilitate information display. When two nodes are connected through a directed connector, the two nodes are represented to have a dependency relationship. For example, in the exemplary embodiment shown in fig. 2, the directional connector (here, the directional connector is taken as an example of a line segment with an arrow) is used between the node M2 and the node M1, the arrow points to the node M2, and the arrow points to the node M1, which indicates that the execution of the node M2 depends on the completion of the node M1.
In a distributed task scenario, since a task can be split into multiple independent subtasks, these subtasks can constitute a set of subtasks. Therefore, based on the user's graph building operation for the nodes and directed connectors, the job dependency graph of the subtask set can be generated and displayed to the user. It should be noted that the mapping operation here is generally a series of operations, that is, a plurality of operations are required to draw a job dependency graph corresponding to one subtask set.
Referring to FIG. 3, in some embodiments of the present disclosure, after the batch executor of the distributed operating system executes the sub-task, the execution status is returned to the batch controller of the distributed operating system so that the batch controller can write the execution status into the cache of the operation instance table. The execution state may include, for example: execution complete, execution failed, not executed, in execution, and the like. The data presentation apparatus of the distributed job system may periodically scan the execution states stored in the job instance table, and present the execution states on the corresponding nodes of the job dependency graph, for example, as shown in fig. 2. The job instance table may store not only the execution state of each subtask in the subtask set, but also information such as the scheduled execution time of each subtask.
In some embodiments of the present description, the data presentation method may further include: extracting the job dependency relationship and the plan execution time of the subtask in the subtask set from the job dependency relationship graph; and writing the operation dependency relationship and the scheduled execution time into an operation instance table of a local cache. In this way, the batch controller of the distributed job system can periodically check the scheduled execution time of each subtask from the job instance table and start up when the execution condition is met (i.e., instruct the batch executor of the distributed job system to start executing the subtask when the execution condition is met).
In an embodiment of the present specification, the extracting may include: reading a job dependency graph; the job dependency graph is analyzed, so that the job dependency and the scheduled execution time in the graph can be obtained.
Correspondingly, in some embodiments of the present specification, the displaying the execution state on the job dependency graph may include displaying, on a node corresponding to a subtask, an execution completion condition of a pre-subtask of the subtask, and a scheduled execution time of the subtask itself. For example, in the exemplary embodiment of fig. 2, node M1 is the front subtask of node M2, and therefore, the completion of the execution of node M1 and the execution plan of node M2 itself can be shown on node M2. In other embodiments of the present specification, the node corresponding to the subtask may further count a previous subtask of the subtask. For example, a count of the number of completions and/or a count of the number of completed subtasks of the subtask that precedes the subtask may be presented on the node. Correspondingly, after a preceding subtask of the subtasks is executed, the count corresponding to the number of completed subtasks may be incremented by one, while the count corresponding to the number of uncompleted subtasks may be decremented by one.
In some embodiments of the present description, when a job dependency graph needs to be modified, a user may dynamically modify the job dependency graph. After receiving a modification operation of a user on the job dependency graph, a data display device of the distributed job system may modify the job dependency graph according to the modification operation and display the modified job dependency graph. Therefore, compared with the prior art that data needs to be read from a database when the job dependency relationship is modified, the data can be read from the buffer when the job dependency relationship is modified, so that the efficiency of modifying the job dependency relationship is improved.
In an exemplary embodiment, the modifying operation includes, for example, adding a subtask and its dependency relationship with other subtasks in the set of subtasks. In another exemplary embodiment, the modification operation may also be, for example, deleting the subtask and its dependency relationship with other subtasks in the set of subtasks. In another exemplary embodiment, the modification operation may also be, for example, modifying the dependency relationship of the subtask with other subtasks in the set of subtasks.
While the process flows described above include operations that occur in a particular order, it should be appreciated that the processes may include more or less operations that are performed sequentially or in parallel (e.g., using parallel processors or a multi-threaded environment).
Referring to fig. 4, a data presentation apparatus in job scheduling in some embodiments of the present specification may include:
a component providing module 41 operable to provide an operable set of graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
the graph generating module 42 may be configured to generate and display a job dependency graph of the subtask set based on a graph building operation of the user on the node and the directed connector;
the graph display module 43 may be configured to obtain an execution state of a subtask in the subtask set at regular time, and display the execution state on the job dependency graph.
In other embodiments of the present description, the data presentation apparatus may further include a graphic modification module; the graph modification module may be configured to receive a modification operation of a user for the job dependency graph, and modify the job dependency graph according to the modification operation.
In other embodiments of this specification, the data presentation apparatus may further include a data writing module, where the data writing module may be configured to extract the job dependency relationship and the scheduled execution time of the subtask in the subtask set from the job dependency relationship diagram, and write the job dependency relationship and the scheduled execution time into a job instance table of a local cache.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.
Referring to fig. 5, a computer device of some embodiments of the present description may include a memory, a processor, and a computer program stored on the memory, the computer program when executed by the processor performing the steps of:
providing a set of operable graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
generating and displaying a job dependency relationship graph of the subtask set based on the graph establishing operation of the user for the nodes and the directed connectors;
and acquiring the execution state of the subtask in the subtask set at fixed time, and displaying the execution state on the operation dependency relationship diagram.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, the description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only an example of the present specification, and is not intended to limit the present specification. Various modifications and alterations to this description will become apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification should be included in the scope of the claims of the present specification.
Claims (10)
1. A data display method in job scheduling is applied to a distributed task scene, and the method comprises the following steps:
providing a set of operable graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
generating and displaying a job dependency relationship graph of the subtask set based on the graph establishing operation of the user for the nodes and the directed connectors;
acquiring the execution state of the subtask in the subtask set at regular time, and displaying the execution state on the job dependency graph, specifically, displaying the execution completion condition of the front subtask of the subtask, the planned execution time of the subtask per se, and counting the front subtask of the subtask on a node corresponding to the subtask;
and extracting the job dependency relationship and the scheduled execution time of the subtasks in the subtask set from the job dependency relationship graph, and writing the job dependency relationship and the scheduled execution time into a job instance table of a local cache, so that the batch control of the distributed job system regularly checks the scheduled execution time of each subtask from the job instance table and starts up when the execution conditions are met.
2. The method of data presentation in job scheduling according to claim 1, further comprising:
and receiving modification operation of a user for the job dependency relationship diagram, and modifying the job dependency relationship diagram according to the modification operation.
3. The method of claim 2, wherein the modifying operation comprises any one or more of the following:
increasing the dependency relationship between the subtask and other subtasks in the subtask set;
deleting the subtask and the dependency relationship between the subtask and other subtasks in the subtask set;
and modifying the dependency relationship between the subtask and other subtasks in the subtask set.
4. The method for displaying data in job scheduling according to claim 1, wherein the periodically acquiring the execution status of the subtask in the subtask set comprises:
and reading the execution state of the subtask in the subtask set from the locally cached job instance table.
5. A data presentation device in job scheduling, comprising:
a component providing module for providing an operable set of graphical components; the graph component set comprises nodes used for representing subtasks and directed connectors used for representing dependency relationships;
the graph generation module is used for generating and displaying the job dependency graph of the subtask set based on the graph establishment operation of the user aiming at the nodes and the directed connectors;
the graph display module is used for acquiring the execution state of the subtask in the subtask set at regular time and displaying the execution state on the job dependency graph, and specifically, displaying the execution completion condition of the front subtask of the subtask, the scheduled execution time of the subtask per se and counting the front subtask of the subtask on a node corresponding to the subtask;
and the data writing module is used for extracting the job dependency relationship and the scheduled execution time of the subtask in the subtask set from the job dependency relationship diagram, and writing the job dependency relationship and the scheduled execution time into a job instance table of a local cache, so that the batch control of the distributed job system regularly checks the scheduled execution time of each subtask from the job instance table, and is started when the execution conditions are met.
6. The data presentation apparatus in job scheduling according to claim 5, further comprising:
and the graph modification module is used for receiving the modification operation of the user aiming at the job dependency relationship graph and modifying the job dependency relationship graph according to the modification operation.
7. The data presentation device in job scheduling according to claim 6, wherein said modification operation includes any one or more of:
increasing the dependency relationship between the subtask and other subtasks in the subtask set;
deleting the subtask and the dependency relationship between the subtask and other subtasks in the subtask set;
and modifying the dependency relationship between the subtask and other subtasks in the subtask set.
8. The data presentation device in job scheduling according to claim 5, wherein the timing to acquire the execution status of the subtask in the subtask set comprises:
and reading the execution state of the subtask in the subtask set from the locally cached job instance table.
9. A computer device comprising a memory, a processor, and a computer program stored on the memory, wherein the computer program, when executed by the processor, performs the data presentation method of any one of claims 1-4.
10. A computer storage medium on which a computer program is stored, the computer program, when being executed by a processor, implementing the data presentation method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910776943.6A CN110471754B (en) | 2019-08-22 | 2019-08-22 | Data display method, device, equipment and storage medium in job scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910776943.6A CN110471754B (en) | 2019-08-22 | 2019-08-22 | Data display method, device, equipment and storage medium in job scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110471754A CN110471754A (en) | 2019-11-19 |
| CN110471754B true CN110471754B (en) | 2022-04-05 |
Family
ID=68513642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910776943.6A Active CN110471754B (en) | 2019-08-22 | 2019-08-22 | Data display method, device, equipment and storage medium in job scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110471754B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111539185B (en) * | 2020-04-14 | 2023-04-14 | 北京宝兰德软件股份有限公司 | Job processing method, job processing apparatus, electronic device, and storage medium |
| CN113534750B (en) * | 2020-04-15 | 2022-12-02 | 北京旷视机器人技术有限公司 | Job scheduling method, device, system, equipment and medium under intensive storage |
| CN113239028B (en) * | 2021-05-10 | 2023-03-14 | 成都新潮传媒集团有限公司 | Data restoration method and device for data warehouse scheduling and readable storage medium |
| CN113127175A (en) * | 2021-05-18 | 2021-07-16 | 中国银行股份有限公司 | Host job scheduling operation method and device |
| CN113821326A (en) * | 2021-09-24 | 2021-12-21 | 北京天融信网络安全技术有限公司 | Job scheduling method and device, electronic equipment and storage medium |
| CN117170889B (en) * | 2023-11-01 | 2024-01-23 | 沐曦集成电路(上海)有限公司 | Heterogeneous non-blocking data packet synchronous processing system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7594227B2 (en) * | 2004-03-08 | 2009-09-22 | Ab Initio Technology Llc | Dependency graph parameter scoping |
| CN107315581A (en) * | 2017-05-23 | 2017-11-03 | 努比亚技术有限公司 | Mission script generating means and method, task scheduling system and method |
| CN108845798A (en) * | 2018-05-30 | 2018-11-20 | 安徽四创电子股份有限公司 | A kind of visualization big data task cradle and processing method |
| CN109508413A (en) * | 2018-10-22 | 2019-03-22 | 中国银行股份有限公司 | Job scheduling methods of exhibiting and device, storage medium and electronic equipment |
-
2019
- 2019-08-22 CN CN201910776943.6A patent/CN110471754B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7594227B2 (en) * | 2004-03-08 | 2009-09-22 | Ab Initio Technology Llc | Dependency graph parameter scoping |
| CN107315581A (en) * | 2017-05-23 | 2017-11-03 | 努比亚技术有限公司 | Mission script generating means and method, task scheduling system and method |
| CN108845798A (en) * | 2018-05-30 | 2018-11-20 | 安徽四创电子股份有限公司 | A kind of visualization big data task cradle and processing method |
| CN109508413A (en) * | 2018-10-22 | 2019-03-22 | 中国银行股份有限公司 | Job scheduling methods of exhibiting and device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110471754A (en) | 2019-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110471754B (en) | Data display method, device, equipment and storage medium in job scheduling | |
| US8893118B2 (en) | Migratable unit based application migration | |
| US9189270B2 (en) | Realizing jumps in an executing process instance | |
| CN108984652B (en) | Configurable data cleaning system and method | |
| US10423442B2 (en) | Processing jobs using task dependencies | |
| CN112748993A (en) | Task execution method and device, storage medium and electronic equipment | |
| US10496423B2 (en) | Method for opening up data and functions of terminal application based on reconstruction technology | |
| CN111158800B (en) | Method and device for constructing task DAG based on mapping relation | |
| CN111784318A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN109102200B (en) | Timed task processing method and device | |
| US20210326179A1 (en) | Progress visualization of computational job | |
| CN111598988A (en) | D3-based method and system for rendering knowledge graph data nodes | |
| CN115220887A (en) | Processing method of scheduling information, task processing system, processor and electronic equipment | |
| CN111435329A (en) | Automatic testing method and device | |
| CN115391004A (en) | Task scheduling system, method and device and electronic equipment | |
| CN115185825A (en) | Interface test scheduling method and device | |
| CN111736967B (en) | Multi-branch flow management and control device, flow template generation method and storage medium | |
| CN113971074A (en) | Transaction processing method and device, electronic equipment and computer readable storage medium | |
| US10832191B1 (en) | System, method, and computer program for metadata driven interface orchestration and mapping | |
| CN113010276A (en) | Task scheduling method and device, terminal equipment and storage medium | |
| CN111832847A (en) | Simulation processing method, device, equipment and storage medium, and replenishment determining method and device | |
| US20140244538A1 (en) | Business process management, configuration and execution | |
| US20180341521A1 (en) | Managing job schedules | |
| CN109766125A (en) | Recognition methods and the device of conflict are produced the equalizer between batch | |
| CN116661767B (en) | File generation method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |