WO2018000678A1 - 模块流程化调度方法及装置 - Google Patents

模块流程化调度方法及装置 Download PDF

Info

Publication number
WO2018000678A1
WO2018000678A1 PCT/CN2016/104332 CN2016104332W WO2018000678A1 WO 2018000678 A1 WO2018000678 A1 WO 2018000678A1 CN 2016104332 W CN2016104332 W CN 2016104332W WO 2018000678 A1 WO2018000678 A1 WO 2018000678A1
Authority
WO
WIPO (PCT)
Prior art keywords
function module
module
information
function
scheduling
Prior art date
Application number
PCT/CN2016/104332
Other languages
English (en)
French (fr)
Inventor
甘铁斌
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018000678A1 publication Critical patent/WO2018000678A1/zh

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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring

Definitions

  • the present disclosure relates to the field of module flow scheduling, for example, to a module flow scheduling method and apparatus.
  • a large task is divided into different subtasks, and the subtasks are scheduled to execute.
  • a series of fixed operations such as file copying, document scanning, and version update are performed.
  • These fixed operations can usually be implemented as independent fixed function modules or widgets by code.
  • the technical solution provided by the embodiment of the present disclosure automatically schedules independent function modules or widgets in a fixed order and presents them to the client in an intuitive interface.
  • the call running status of the called function module is updated and the interface is displayed.
  • the loading the function module information according to the scheduling order of the function module includes:
  • the information of the function modules saved according to the scheduling order of the function modules is sequentially read from the configuration file, and the information of the read function modules is loaded into the data buffer area according to the scheduling order of the function modules.
  • the function module is invoked according to a loading order of information of the function module.
  • the function module includes:
  • next called function module is scheduled and run by querying information of the next called function module.
  • the method further includes:
  • the method further includes:
  • the method further includes:
  • the method further includes:
  • the control timer starts timing
  • the running time of the scheduled function module is determined according to the timing of the timer.
  • Embodiments of the present disclosure provide a non-transitory computer readable storage medium storing computer executable instructions configured to perform the above-described module flow scheduling method.
  • the display module is set to update the calling running state of the called function module and display the interface.
  • the loading module is configured to sequentially read information of the function modules saved according to the scheduling order of the function modules from the configuration file, and load the information of the read function modules into the data cache according to the scheduling order of the function modules. Area.
  • the calling module is configured to query information of the currently called function module from the information of the loaded function module, and schedule and run the currently called function module by using the information of the currently called function module of the query. And if the currently called function module runs successfully, scheduling and running the next called function module by querying information of the next called function module.
  • the device further includes:
  • the memory module is configured to record information of the successfully functioning function module when the scheduled function module runs successfully.
  • the memory module is further configured to delete, when the successfully functioning function module is the last function module, information of all the recorded function modules that are successfully executed.
  • the loading module is configured to search for information about a successfully functioning function module that has been recorded by the memory module when performing the next module flow scheduling, and if the information of the successfully functioning function module is found, The information of the function module that was found to be successful is deleted from the information of the loaded function module.
  • the device further includes:
  • a timing module configured to: when the scheduled function module starts running, control the timer to start timing, when the scheduled function module ends running, control the timer to stop timing, and determine a schedule according to the timer time of the timer The runtime time of the function module.
  • At least one processor At least one processor
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one processor to perform the method described above.
  • the embodiments of the present disclosure can automatically schedule and execute individual function modules in a fixed order, and display them to the user in an intuitive interface manner, which can reduce the failure occurrence rate and improve work efficiency.
  • FIG. 1 is a block diagram of a module flow scheduling method according to an embodiment of the present disclosure
  • FIG. 2 is a block diagram of a first device flow scheduling of a module according to an embodiment of the present disclosure
  • FIG. 3 is a block diagram of a second apparatus for program flow scheduling according to an embodiment of the present disclosure.
  • FIG. 4 is a flowchart of a configuration of a function module display component provided by an embodiment of the present disclosure
  • FIG. 5 is a flowchart of a model loading function module provided by an embodiment of the present disclosure.
  • FIG. 6 is a flowchart of reading the content of a memory module according to an embodiment of the present disclosure
  • FIG. 7 is a timing chart of the embodiment of the present disclosure.
  • FIG. 8 is a flowchart of a write memory module provided by an embodiment of the present disclosure.
  • FIG. 9 is a flowchart of a model scheduling operation provided by an embodiment of the present disclosure.
  • FIG. 10 is a schematic structural diagram of hardware of an electronic device according to an embodiment of the present disclosure.
  • FIG. 1 is a block diagram of a module flow scheduling method according to an embodiment of the present disclosure.
  • step 110 the information of the function module is loaded according to the scheduling order of the function modules.
  • the step 110 may include sequentially reading information of the function modules saved according to the scheduling order of the function modules from the configuration file, and loading the information of the read function modules into the data buffer area according to the scheduling order of the function modules.
  • the information of the function module may include an identity (ID) of the function module and a class path corresponding to the main program entry.
  • step 120 the function module is called according to the loading order of the information of the function module.
  • the information of the currently called function module may be queried from the information of the loaded function module, and the currently called function module is scheduled and run by using the information of the currently called function module of the query, and If the currently called function module runs successfully, the next called function module is scheduled and run by querying the information of the next called function module.
  • step 120 it is also possible to record the running time (ie, running time) of each functional module and to record the running time (ie, running time) of the entire module flow scheduling process.
  • the control timer performs start timing
  • the scheduled function module ends running controls the timer to stop timing, and determines the scheduled function module according to the timer time of the timer.
  • the running time, and finally the running time (ie running time) of each function module is added, and the running time (ie running time) of the whole module flow scheduling process is obtained.
  • the information of the successfully functioning function module can also be recorded and deleted. If the scheduled function module runs successfully, record the information of the function module that is successfully executed; if the function module that is successfully executed is the last function module, the information of the function module is the last information of the loaded function module. One, deletes all recorded information about successful function modules.
  • the method further includes: searching for all the recorded information of the successfully functioning function module before calling the function module during the next module flow scheduling, and if the function information of the successfully functioning module is found, The information of the found successful function module is deleted from the information of the loaded function module.
  • the task of switching the network management version requires the use of information of seven functional modules. In the process of performing the pipeline scheduling of this module, if the first three functional modules are successfully run, the information of the first three functional modules is recorded, and the fourth is After the function module fails to run, stop the module flow scheduling. When executing the next module process scheduling, delete the found successful operation from the information of the seven loaded function modules before calling the function module.
  • the information of the first three functional modules, the subsequent scheduling can be continued after scheduling four functional modules, reducing repetitive scheduling and improving the efficiency of module flow scheduling. If the seven function modules of the module flow scheduling are successfully run, the information of the seven function modules that have been successfully recorded is deleted. When the next module flow scheduling is executed, the function modules that are successfully run are not queried. The information, that is, according to the information of the loaded function module, is scheduled, that is, a completely new scheduling.
  • step 130 the calling running state of the called function module is updated, and the interface is displayed.
  • the call running state may include three states: running, running successfully, and running failure.
  • the icons and running states of the function modules of all the loaded function modules can be displayed, thereby displaying the function modules of the scheduling progress, the running state, and the positioning running failure to the user.
  • the scheduling order of the function module is presented on the interface, during the calling process, the function module
  • the scheduling running status is updated on the interface in real time, so that the scheduling execution flow of the function module can be presented to the user very intuitively.
  • the method may also display the running time (ie, running time) of each functional module and the running time (ie, running time) of the current program scheduling of the module.
  • the embodiment provides a general function module flow scheduling execution method, and the information of the individual function modules or gadgets can be put into the module flow scheduling model according to the format and the order, so that the function modules or gadgets are in a fixed order. Scheduling execution, simple operation, extensibility, and presentation to customers in an intuitive interface.
  • the scheduling operation state of the function module on the interface is updated in real time during the calling process.
  • a function module fails to run it can display content through the interface, and timely locate the function module that fails to run.
  • the storage medium may be a read-only memory (ROM) or a random-access memory (RAM), a magnetic disk, an optical disk, or the like.
  • FIG. 2 is a block diagram of a first apparatus for program flow scheduling according to an embodiment of the present disclosure. As shown in FIG. 2, the method includes: a loading module 10, a calling module 20, and a display module 30.
  • the loading module 10 is arranged to load the information of the function module according to the scheduling order of the function modules.
  • the calling module 20 is arranged to call the function module according to the loading order of the information of the function module.
  • the display module 30 is configured to update the call running state of the called function module and display the interface.
  • the loading module 10 may be configured to sequentially read information of the function modules saved according to the scheduling order of the function modules from the configuration file, and load the information of the read function modules into the data buffer area according to the scheduling order of the function modules.
  • the information of the function module may include an ID of the function module and a class path corresponding to the main program entry.
  • the calling module 20 may be configured to query the information of the currently called function module from the information of the function module that has been loaded into the data buffer, and schedule and run the currently called information by using the information of the currently called function module of the query. a function module, and if the currently called function module runs successfully, by querying information of a next called function module in the data buffer, The function module of the next call is scheduled and run.
  • the module flow operation model ie, the module flow operation device
  • the module flow operation model can adjust the operation sequence of the function module (or the service module) according to the user's requirements, and present the operation effect to the user, and the operation is simple and the effect is good.
  • FIG. 3 is a block diagram of a second apparatus for program flow scheduling according to an embodiment of the present disclosure. As shown in FIG. 3, the loading module 10, the calling module 20, and the display module 30 shown in FIG. 2, and the configuration module 40 and the memory module 50 are included. And at least one of the timing modules 60.
  • the configuration module 40 is configured to configure information of the function module, and form a configuration file including information of the function module, wherein the information of the function module in the configuration file may be saved according to a scheduling order of the function module, so that the loading module 10 presses Read and load.
  • a function module is added or deleted in the scheduling model, information of adding or deleting function modules may be added or deleted in the configuration file.
  • the calling order of the function modules in the scheduling model is changed, the order of the function modules that are subsequently loaded and called can be changed by adjusting the order in which the information of the function modules in the configuration file is saved.
  • the memory module 50 can be configured to record the information of the successfully functioning function module when the scheduled function module runs successfully, and delete all the recorded successful running functions when the successfully running function module is the last function module. Module information.
  • the loading module 10 may search for information about the successfully functioning function module that has been recorded by the memory module, and if the information of the successfully functioning function module is found, the function module from the loaded function module The information of the found successful function module is deleted in the information, and the calling module 20 can call the function module in sequence according to the information of the function module obtained after the deletion process, thereby eliminating the repetition of the function module that has been successfully run before. Call, if no information is found for the function module that ran successfully, a new call is made.
  • the running status of each function module can be displayed on the interface through the display module 30.
  • the timing module 60 is configured to: when the scheduled function module starts running, control the timer to start timing, when the scheduled function module ends running, control the timer to stop timing, and determine according to the timer time of the timer.
  • the running time of the scheduled function module is configured to: when the scheduled function module starts running, control the timer to start timing, when the scheduled function module ends running, control the timer to stop timing, and determine according to the timer time of the timer.
  • the running time of the scheduled function module is configured to: when the scheduled function module starts running, control the timer to start timing, when the scheduled function module ends running, control the timer to stop timing, and determine according to the timer time of the timer.
  • the running time of the scheduled function module performs statistics on the running time of each functional module during the current scheduling of the module, and obtains the running time of the current program scheduling of the module.
  • the running time of each function module and/or the running time of the current module scheduling is displayed on the interface by the display module 30.
  • FIG. 3 shows the working steps of the device.
  • the model reads the information of the functional modules from the configuration module 40.
  • the information of the read function module may include, but is not limited to, an ID of the function module and a class path corresponding to the entry of the main program.
  • the scheduling model defines a common interface, and the model only interacts with the interface. Through the interface, the scheduling model does not need to pay attention to the internal processing logic of different types of functional modules, and improves the processing of functional modules. Versatility.
  • the order in which the function modules are stored in the configuration module is meaningful.
  • the scheduling order of the models depends on the order in which the function modules are stored, ensuring the flexibility of the scheduling order of the function modules.
  • the model defines the data buffer and loads the information of the function module.
  • the scheduling model determines whether the configuration module has configured the information of the function module. If the configuration module has configured the information of the function module, the data cache area is opened. If the configuration module configures the information of the function module, the model is directly exited.
  • the size of the buffer depends on the number of functional modules. In theory, there is no limit to the number of functional modules. However, considering the application effect and the friendliness of the interface, the functional module can be no more than 12 at a resolution of 1280*1024. In order to make the scheduling model perform better. The lower the resolution, the less the number of functional modules the interface can present.
  • the ID of the function module and the class path corresponding to the entry of the main program may be stored, and the ID and the corresponding class path correspond one-to-one, and the ID may be mapped to the corresponding class path corresponding to the function module.
  • the ID and corresponding classpath form a data record in the data buffer.
  • the function modules are stored in the cache in the order of reading. This order determines the scheduling order of the model.
  • the model defines a memory module, and the memory module enables the model to remember the error process node (ie, the function module) at the time of the last execution of the process, so that it is convenient to continue execution from the error node during the next execution, and the process node module that has been successfully executed is not repeatedly executed, for the whole Process runs save time.
  • the error process node ie, the function module
  • the memory module is saved on the disk in the form of a file medium.
  • a function module is successfully executed for each scheduling, and the ID of the function module is written into the disk file medium according to the designed special format, as the next process.
  • the basis of the execution is that if all the process nodes are successfully executed after the execution of the entire process, the content in the file medium is cleared after the process ends, and the next process is provided.
  • the model defines a timekeeping module, and the timing module calculates the running time for each functional module, each one When the function module is finished running, it will take time to calculate the operation. Finally, the timing module will make a total of the running time of the overall process.
  • the timing function module starts the timer before the model scheduling executes each function module. After the execution of the function module ends, regardless of whether the execution is successful, the timer expires, the function module running time is calculated, and is fed back to the interface display module.
  • the scheduling model When the scheduling model starts to execute the function module, it traverses the data in the data buffer area. When traversing the data, it traverses one by one according to the storage order of the data buffer data records. Each time a piece of data is traversed, the model finds the corresponding main according to the ID of the function module. The class path corresponding to the program entry is executed by the class reflection calling function module. When the function module executes successfully, it traverses the next data record. If the function module fails to execute, the traversal is immediately aborted. Each time a record is executed, the model interacts with the interface to update the scheduling state of the function module on the interface.
  • the display component of the function module is configured in the configuration file, and the component name is composed of btn+ function module ID, and the component is displayed as a status icon on the interface.
  • the scheduling model scheduling function module is running, the model finds the corresponding operation according to the ID of the function module.
  • the status icon update interface is displayed.
  • the model finds a corresponding running success status icon update interface display according to the ID of the function module.
  • the scheduling model scheduling function module fails to run, the model according to the function
  • the ID of the module finds the corresponding run failure icon update interface display.
  • the module flow scheduling device of the embodiment is a general-purpose device, and different functional modules can be organized into a process operation as needed, the operation is simple, the scalability is strong, and the interface presentation effect is intuitive.
  • the method and apparatus of the present disclosure can perform scheduled scheduling execution on subtasks.
  • the following takes the execution of the network management version switching process as an example.
  • the methods and devices provided by the present disclosure are used for these independent functions.
  • the module performs unified scheduling. This embodiment will be described with reference to Figs. 4 to 9 .
  • step one define the function module information.
  • the function module that needs to be scheduled to be executed is configured in the file medium, and the information of the configuration function module includes the function module ID, the class path corresponding to the function module execution main program entry, and the interface display component name. And other information.
  • 4 is a flowchart of a function module display component configuration provided by an embodiment of the present disclosure.
  • step 210 it is determined whether the function module has been configured. If the function module has been configured, step 220 is performed. If the function module is not configured, the flow of the display component of the configuration function module is ended.
  • step 220 a status button name (statebtnname) value of the function module is obtained as the configuration component name.
  • step 230 the Chinese name displayed by the function module is configured, and the step is an optional step.
  • step 240 a status icon displayed by the function module is configured.
  • step two the function module information is obtained, and the module container is initialized.
  • FIG. 5 is a flowchart of a model loading function module provided by an embodiment of the present disclosure.
  • step 310 the system is initialized.
  • step 320 the configuration file is loaded.
  • step 330 it is determined whether the function module has been configured. If the function module has been configured, step 340 is performed. If the function module is not configured, the flow of loading the information of the function module is ended.
  • step 340 the function module container is initialized.
  • step 350 the information of the function modules in the configuration file is sequentially read and loaded into the function module container according to the execution order of the function modules switched by the network management version, and the information of each function module includes the function module ID and the function module.
  • step 360 the display components of the functional modules in the configuration file are loaded, and the display components of each functional module include an interface display component name and a status icon.
  • step 370 it is determined whether the currently loaded function module information is the last function module information. If the currently loaded function module information is the last function module information, the step of executing the step of loading the information of the function module is performed, if currently loaded If the function module information is not the last function module information, step 350 is performed.
  • step three the deployment interface displays the process.
  • the corresponding interface display component is found, and according to the order of the function modules in the configuration file, the organization interface displays the placement position of the component, and the display process of the function module on the interface is formed.
  • step four the contents of the memory module are read, and the execution flow node is updated.
  • the established module scheduling execution flow has been formed.
  • the memory function module is read to determine whether the last execution process is in error. If a node error occurs in the last execution flow, the last error occurs. The node begins executing the process, saving process execution time. 6 is a flow chart of reading the contents of the memory module provided by the embodiment of the present disclosure.
  • step 410 the memory module is read.
  • step 420 it is determined whether the memory module is empty. If the memory module is empty, step 430 is performed. If the memory module is not empty, step 450 is performed.
  • step 430 the content in the memory module is read, that is, the ID of the function module that has been successfully executed in the memory module is read.
  • step 440 the memory flow node is deleted in all the process nodes, that is, the subsequent process no longer calls the function module corresponding to the read ID of the successfully functioning function module.
  • step 450 the current process node is executed.
  • step five the execution process node is scheduled, and the timer starts timing.
  • FIG. 7 is a timing chart of the embodiment of the present disclosure.
  • step 610 model scheduling begins.
  • step 620 a timer is started for the currently scheduled process node (ie, the functional module).
  • step 630 the currently scheduled process node is executed.
  • step 640 the currently scheduled process node is executed.
  • step 650 the time (i.e., runtime) of the currently scheduled process node is calculated.
  • step 660 the time consumption of the currently scheduled process node is fed back to the interface display module (ie, the display module).
  • step 670 it is determined whether all the process nodes have been executed. If all the process nodes are executed, step 680 is executed. If all the process nodes are not executed, step 620 is executed.
  • step 680 the total process time is counted.
  • step 6 the memory module content is updated.
  • FIG. 8 is a flowchart of a write memory module provided by an embodiment of the present disclosure.
  • step 510 the currently scheduled process node is executed.
  • step 520 it is determined whether the currently scheduled process node is successfully executed. If the currently scheduled process node is successfully executed, step 530 is performed, and if the currently scheduled process node is not successfully executed, step 560 is performed.
  • step 530 the ID of the currently scheduled process node is written to the memory module.
  • step 540 it is determined whether all the process nodes are all executed. If all the process nodes are executed, step 550 is executed. If all the process nodes are not executed, step 510 is performed.
  • step 550 the content in the memory module is cleared.
  • step 560 the scheduling process is exited.
  • step 7 the model scheduling process is executed and the interface is updated in real time.
  • the model schedules the execution process node according to the established process.
  • the interface displays the running status of the component in real time according to the execution result, and shows the user the real-time running effect of the process.
  • FIG. 9 is a flowchart of a model scheduling operation provided by an embodiment of the present disclosure.
  • step 710 the function module container is parsed.
  • step 720 based on the analysis result, it is determined whether the function module information is stored in the function module container. If the function module information is stored in the function module container, step 730 is performed, and if the function module information is not stored in the function module container, the process ends. .
  • step 730 the function module container is traversed.
  • step 740 the class path corresponding to the main program entry of the function module is invoked in the order of each piece of data recorded in the function module container.
  • step 750 the status icon of the called function module is converted to a dynamic run icon.
  • step 760 it is determined whether the called function module is successfully run. If the called function module is not successful, step 770 is performed. If the called function module is not successfully executed, step 780 is performed.
  • step 770 the status icon of the called function module is converted to green.
  • step 780 the status icon of the called function module is converted to red, ending the process.
  • step 790 it is determined whether the called function module is the last function module. If the called function module is the last function module, the process ends; if the called function module is not the last function module, step 730 is performed.
  • the function module is configurable, that is, the function module is configured in the form of a configuration file, which has good scalability and maintainability; the calling sequence of the function module can be configured, that is, by changing the configuration file.
  • the order of storing the function module information changes the calling sequence of the function module; it can be added at any time, and the function module can be called at any time, that is, by adding the function module information that needs to be added and called in the configuration file, the function module can be added at any time.
  • the process is in error and can be executed after modification. That is, through the memory function of the memory module, the function module that runs successfully is not called, but is executed from the function module that failed the last run; the process running effect is intuitive; and the running process is controllable. , is conducive to fault tracking and positioning.
  • Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions arranged to perform the method of any of the above embodiments.
  • the embodiment of the present disclosure further provides a hardware structure diagram of an electronic device.
  • the electronic device includes:
  • At least one processor 80 which is exemplified by a processor 80 in FIG. 10; and a memory 81, may further include a communication interface 82 and a bus 83.
  • the processor 80, the communication interface 82, and the memory 81 can complete communication with each other through the bus 83.
  • Communication interface 82 can be used for information transfer.
  • Processor 80 can invoke logic instructions in memory 81 to perform the methods of the above-described embodiments.
  • logic instructions in the memory 81 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the memory 81 is a computer readable storage medium and can be used to store software programs, computer executable programs, program instructions or modules corresponding to the methods in the embodiments of the present disclosure.
  • Processor 80 passes The software program, the instruction or the module stored in the memory 81 is executed to perform the function application and the data processing, that is, the module flow scheduling method in the above method embodiment is implemented.
  • the memory 81 may include a storage program area and an storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to use of the terminal device, and the like. Further, the memory 81 may include a high speed random access memory, and may also include a nonvolatile memory.
  • the technical solution of the present disclosure may be embodied in the form of a software product stored in a storage medium, including one or more instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) Performing all or part of the steps of the method of the embodiments of the present disclosure.
  • the foregoing storage medium may be a non-transitory storage medium, including: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk, and the like, and may be a temporary storage medium.
  • the module flow scheduling method and apparatus can automatically schedule and execute individual function modules in a fixed order, and display them to the user in an intuitive interface manner, which can reduce the failure occurrence rate and improve work efficiency.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Quality & Reliability (AREA)
  • Stored Programmes (AREA)

Abstract

一种模块流程化调度方法及装置，所述方法包括：按照功能模块的调度顺序，加载功能模块的信息（110）；按照加载的功能模块的信息，依次对功能模块进行调度执行（120）；以及对所调度执行的功能模块的调用运行状态进行更新，并进行界面显示（130）。

Description

模块流程化调度方法及装置 技术领域
本公开涉及模块流程化调度领域，例如涉及一种模块流程化调度方法及装置。
背景技术
一般，将一个大任务划分为不同的子任务，子任务间有序调度执行。例如在切换网管系统版本时，进行文件复制、文档扫描、版本更新等一系列的固定操作，这些固定操作通常可以用代码实现成独立的固定的功能模块或者小工具。
在日常工作中，为提高工作效率，这些功能模块或小工具之间有严格的执行顺序，但这种顺序依靠人工保证，效率低，故障频出，使得业务交接困难。例如，在执行网管版本切换过程中，会经常使用到一些第三方小工具和自主开发的功能模块，这些小工具和功能模块的使用都是各自独立的，缺乏对这些小工具和功能模块的统一的调度管理，因此整个网管版本切换过程严格地自动按照版本切换业务顺序执行，避免人工操作导致的失误，提高工作效率。
发明内容
本公开实施例提供的技术方案将独立的功能模块或小工具按照固定顺序自动调度执行，并以直观的界面展现给客户。
本公开实施例提供的一种模块流程化调度方法，包括：
按照功能模块的调度顺序，加载功能模块的信息；
按照所述功能模块的信息的加载顺序，对功能模块进行调用；以及
对调用的功能模块的调用运行状态进行更新，并进行界面显示。
可选地，所述按照功能模块的调度顺序，加载功能模块的信息包括：
从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。
可选地，所述按照所述功能模块的信息的加载顺序，对功能模块进行调用 包括：
从已加载的功能模块的信息中，查询当前调用的功能模块的信息；
利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块；以及
若所述当前调用的功能模块运行成功，则通过查询下一个调用的功能模块的信息，调度并运行所述下一个调用的功能模块。
可选地，所述方法还包括：
当调度的功能模块运行成功时，记录所述运行成功的功能模块的信息。
可选地，所述方法还包括：
当所述运行成功的功能模块是最后一个功能模块时，删除所有已记录的运行成功的功能模块的信息。
可选地，所述方法还包括：
在执行下一次模块流程化调度时，查找所有已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中删除所找到的运行成功的功能模块的信息。
可选地，所述方法还包括：
当调度的功能模块开始运行时，控制计时器进行启动计时；
当调度的功能模块结束运行时，控制所述计时器停止计时；以及
根据所述计时器的计时时间，确定调度的功能模块的运行时间。
本公开实施例提供了一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述模块流程化调度方法。
本公开实施例提供的一种模块流程化调度装置，包括：
加载模块，设置为按照功能模块的调度顺序，加载功能模块的信息；
调用模块，设置为按照所述功能模块的信息的加载顺序，对功能模块进行调用；
显示模块，设置为对调用的功能模块的调用运行状态进行更新，并进行界面显示。
可选地，所述加载模块设置为从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。
可选地，所述调用模块设置为从已加载的功能模块的信息中，查询当前调用的功能模块的信息，利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块，以及若所述当前调用的功能模块运行成功，则通过查询下一个调用的功能模块的信息，调度并运行所述下一个调用的功能模块。
可选地，所述装置还包括：
记忆模块，设置为当调度的功能模块运行成功时，记录所述运行成功的功能模块的信息。
可选地，所述记忆模块还设置为在所述运行成功的功能模块是最后一个功能模块时，删除所有已记录的运行成功的功能模块的信息。
可选地，所述加载模块，设置为在执行下一次模块流程化调度时，查找所述记忆模块已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中删除所找到的运行成功的功能模块的信息。
可选地，所述装置还包括：
计时模块，设置为当调度的功能模块开始运行时，控制计时器进行启动计时，当调度的功能模块结束运行时，控制所述计时器停止计时，以及根据所述计时器的计时时间，确定调度的功能模块的运行时间。本公开实施例提供了一种电子设备，该电子设备包括：
至少一个处理器；以及
与所述至少一个处理器通信连接的存储器；其中，
所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器执行上述的方法。
本公开实施例能够将单独的功能模块按照固定顺序自动调度执行，并以直观的界面方式展现给用户，能够降低故障出现率，提高工作效率。
附图说明
图1是本公开实施例提供的模块流程化调度方法框图；
图2是本公开实施例提供的模块流程化调度第一装置框图；
图3是本公开实施例提供的模块流程化调度第二装置框图；
图4是本公开实施例提供的功能模块显示组件配置流程图；
图5本公开实施例提供的模型加载功能模块的流程图；
图6本公开实施例提供的读取记忆模块内容的流程图；
图7本公开实施例提供的计时流程图；
图8本公开实施例提供的写记忆模块的流程图；
图9本公开实施例提供的模型调度运行流程图；以及
图10是本公开实施例提供的电子设备的硬件结构示意图。
具体实施方式
以下结合附图对本公开的可选实施例进行详细说明，应当理解，以下所说明的可选实施例仅用于说明和解释本公开，并不用于限定本公开。在不冲突的情况下，本公开的实施例以及实施例中的特征可以相互任意组合。
图1是本公开实施例提供的模块流程化调度方法框图。
在步骤110中，按照功能模块的调度顺序，加载功能模块的信息。
步骤110可以包括从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。
其中，所述功能模块的信息可以包括功能模块的身份标识(Identification，ID)和主程序入口对应的类路径。
在步骤120中，按照所述功能模块的信息的加载顺序，对功能模块进行调用。
本步骤中，可以从已加载的功能模块的信息中，查询当前调用的功能模块的信息，并利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块，以及若所述当前调用的功能模块运行成功，则通过查询下一个调用的功能模块的信息，调度并运行所述下一个调用的功能模块。
在执行步骤120期间，还可以记录每个功能模块的运行耗费时间(即运行时间)和记录整个模块流程化调度过程的运行耗费时间(即运行时间)。例如，当调度的功能模块开始运行时，控制计时器进行启动计时，当调度的功能模块结束运行时，控制所述计时器停止计时，以及根据所述计时器的计时时间，确定调度的功能模块的运行时间，最后将每个功能模块的运行耗费时间(即运行时间)相加，得到整个模块流程化调度过程的运行耗费时间(即运行时间)。
在执行步骤120期间，还可以对运行成功的功能模块的信息进行记录及删除记录。，若调度的功能模块运行成功，则记录所述运行成功的功能模块的信息；若所述运行成功的功能模块是最后一个功能模块，该功能模块的信息是加载的功能模块的信息中的最后一个，则删除所有已记录的运行成功的功能模块的信息。
可选地，所述方法还包括：在执行下一次模块流程化调度期间，在调用功能模块前，查找所有已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中删除所找到的运行成功的功能模块的信息。例如，切换网管版本的任务共需要使用七个功能模块的信息，在执行本次模块流程化调度的过程中，若前三个功能模块运行成功，则记录前三个功能模块的信息，第四个功能模块运行失败后，停止本次模块流程化调度，在执行下一次模块流程化调度时，在进行功能模块调用前，从已加载的七个功能模块的信息中删除所找到的运行成功的前三个功能模块的信息，后续调度可以按续调度后四个功能模块即可，减少重复性调度，提高模块流程化调度效率。若本次模块流程化调度的七个功能模块均运行成功，则删除已记录的运行成功的七个功能模块的信息，在执行下一次模块流程化调度时，由于没有查询到运行成功的功能模块的信息，即按照已加载的功能模块的信息，进行调度，即进行全新的调度。
在步骤130中，对调用的功能模块的调用运行状态进行更新，并进行界面显示。
所述调用运行状态可以包括运行中、运行成功和运行失败三种状态。界面中可以显示所有已加载功能模块的信息的功能模块的图标、运行状态，从而向用户展示调度进度、运行状态、定位运行失败的功能模块。在加载功能模块的信息时，功能模块的调度顺序在界面上呈现出来，在调用过程中，功能模块的 调度运行状态实时在界面上更新，使得功能模块的调度执行流程能够非常直观的呈现给用户。可选地，所述方法中还可以显示每个功能模块的运行耗费时间(即运行时间)以及本次模块流程化调度的运行耗费时间(即运行时间)等。
本实施例提供了一种通用的功能模块流程化调度执行方法，可以把单独的功能模块或小工具的信息按照格式和顺序放入模块流程化调度模型中，使功能模块或小工具按照固定顺序调度执行，操作简单，扩展性强，并且以直观的界面方式展现给客户。
本实施例通过在调用过程中，实时更新在界面上的功能模块的调度运行状态。当一功能模块运行失败后，能够通过界面展示内容，及时定位运行失败的功能模块。
本领域普通技术人员可以理解，实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，所述的程序可以存储于非暂态计算机可读取存储介质中，该程序在执行时，包括步骤110至步骤130。其中，存储介质可以为只读存储器(Read-only Memory，ROM)或随机存储存储器(Random-Access Memory，RAM)、磁碟、光盘等。
图2是本公开实施例提供的模块流程化调度第一装置框图，如图2所示，包括：加载模块10、调用模块20以及显示模块30。
加载模块10设置为按照功能模块的调度顺序，加载功能模块的信息。
调用模块20设置为按照所述功能模块的信息的加载顺序，对功能模块进行调用。
显示模块30设置为对调用的功能模块的调用运行状态进行更新，并进行界面显示。
所述加载模块10可以设置为从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。所述功能模块的信息可以包括功能模块的ID和主程序入口对应的类路径。所述调用模块20可以设置为从已加载到数据缓存区的功能模块的信息中，查询当前调用的功能模块的信息，利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块，以及若所述当前调用的功能模块运行成功，则通过查询数据缓存区中的下一个调用的功能模块的信息， 调度并运行所述下一个调用的功能模块。
本实施例提供模块流程化运行模型(即模块流程化运行装置)可以根据用户需求，随意调整功能模块(或业务模块)的运行顺序，并将运行效果呈现给用户，操作简单，效果良好。
图3是本公开实施例提供的模块流程化调度第二装置框图，如图3所示，包括图2所示的加载模块10、调用模块20和显示模块30，以及配置模块40、记忆模块50和计时模块60中的至少一个。
配置模块40设置为配置功能模块的信息，并形成包含所述功能模块的信息的配置文件，其中，配置文件中的功能模块的信息可以按照功能模块的调度顺序进行保存，以供加载模块10按序读取并加载。当在调度模型中增加或者删减功能模块时，可以在配置文件中增加或删减增加或者删减功能模块的信息。当在调度模型中的功能模块的调用顺序改变时，通过调整配置文件中的功能模块的信息的保存顺序，即可改变后续加载和调用的功能模块的顺序。可选地，为了使功能模块的调用和运行过程可视化，还可以在配置文件中为每个功能配置显示组件。
记忆模块50可以设置为当调度的功能模块运行成功时，记录所述运行成功的功能模块的信息，在所述运行成功的功能模块是最后一个功能模块时，删除所有已记录的运行成功的功能模块的信息。在执行下一次模块流程化调度时，所述加载模块10可以查找所述记忆模块已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中删除所找到的运行成功的功能模块的信息，调用模块20可以按照删除处理后得到的功能模块的信息，按序对功能模块进行调用，从而消除对在前已运行成功的功能模块的重复调用，若未找到运行成功的功能模块的信息，则进行全新的调用。其中，每个功能模块的运行状态可通过显示模块30显示到界面上。
计时模块60，设置为当调度的功能模块开始运行时，控制计时器进行启动计时，当调度的功能模块结束运行时，控制所述计时器停止计时，以及根据所述计时器的计时时间，确定调度的功能模块的运行时间。可选地，计时模块60对本次模块流程化调度期间的每个功能模块的运行时间进行统计，得到本次模块流程化调度的运行时间。其中，所述每个功能模块的运行时间和/或本次模块流程化调度的运行时间可通过显示模块30显示到界面上。
图3所示的是装置的工作步骤。
模型(即调度模型或模块流程化调度装置)从配置模块40中读取功能模块的信息。其中，读取的功能模块的信息可以包括但不限于功能模块的ID和主程序的入口对应的类路径。调度模型为了实现对多种类型的功能模块进行无差别调度，定义一个通用的接口，模型只与接口交互，通过接口，调度模型无需关注不同类型功能模块的内部处理逻辑，提高了功能模块的处理通用性。
功能模块在配置模块中的存放顺序是有意义的，模型的调度顺序取决于功能模块的存放顺序，保证了功能模块调度顺序的灵活性。
模型定义数据缓存区，加载功能模块的信息。
调度模型判断配置模块是否已配置功能模块的信息，如果配置模块已配置功能模块的信息，则开辟数据缓存区，如果配置模块为配置功能模块的信息，直接退出模型。缓存区的大小取决于功能模块的数量，理论上对于功能模块的数量是没有限制的，但是考虑到应用效果和界面呈现的友好程度，在1280*1024的分辨率下，功能模块可以不超过12个，以使得调度模型执行效果较佳。分辨率越低，界面所能呈现功能模块的数量就越少。
数据缓存区用于加载功能模块时，可以存放功能模块的ID和主程序的入口对应的类路径，ID和对应的类路径一一对应，通过ID就可以映射到功能模块对应的对应的类路径，ID和对应的类路径组成数据缓存区中的一条数据记录。
功能模块是按照读取的顺序存放在缓存区存放的，这个顺序决定了模型的调度顺序。
模型定义记忆模块，记忆模块能够让模型记住上次流程执行时的出错流程节点(即功能模块)，方便下次执行时从出错节点继续执行，不重复执行已经成功的流程节点模块，为整个流程运行节省时间。
记忆模块以文件介质的方式保存在磁盘中，模型调度执行流程时，每调度执行成功一个功能模块，把该功能模块的ID按照设计好的特殊格式写入到磁盘文件介质中，作为下次流程执行的记忆依据，如果整个流程执行完毕后，所有流程节点都执行成功，则在流程结束后清除文件介质中的内容，给下次流程是否全新执行提供依据。
模型定义记时模块，计时模块为每个功能模块计算运行消耗时间，每一个 功能模块运行完毕都会计算运行耗费时间，最后，计时模块还会对整体流程的运行时间做出总计。
计时功能模块在模型调度执行每一个功能模块前启动计时器，在功能模块执行结束后，不管是否执行成功，计时器计时结束，计算功能模块运行时间，并反馈到界面显示模块中。
模型调度执行功能模块。
调度模型在开始调度执行功能模块时，遍历数据缓存区中的数据，遍历数据时，按照数据缓存区数据记录的存放顺序，逐条遍历，每遍历一条数据，模型根据功能模块的ID找到对应的主程序入口对应的类路径，通过类反射调用功能模块执行，当功能模块执行成功后，遍历下一条数据记录，如果功能模块执行失败，立即中止遍历。每执行一条记录，模型都要和界面进行数据交互，更新界面上功能模块的调度运行状态。
将调度效果直观展现。
在配置文件中配置功能模块的显示组件，组件名称以btn+功能模块ID组成，组件在界面上以状态图标的方式显示，当调度模型调度功能模块运行时，模型根据功能模块的ID找到对应的运行状态图标更新界面显示，可选地，在调度模型调度功能模块运行成功后，模型根据功能模块的ID找到对应的运行成功状态图标更新界面显示，在调度模型调度功能模块运行失败后，模型根据功能模块的ID找到对应的运行失败图标更新界面显示。
本实施例的模块流程化调度装置是通用装置，可以将不同的功能模块按需组织成流程运行，操作简单，扩展性强，界面呈现效果直观。
在将一个大任务划分为不同子任务(相当于功能模块)后，本公开的方法及装置可以对子任务有序调度执行。下面以执行网管版本切换过程为例，为了让整个版本切换过程严格自动按照版本切换业务顺序执行，避免人工操作导致的失误，提高工作效率，利用本公开给出的方法及装置对这些独立的功能模块进行统一调度。结合图4至图9对本实施例进行说明。
在步骤一中，定义功能模块信息。
在文件介质中配置需要调度执行的功能模块，配置功能模块的可以信息包含功能模块ID、功能模块执行主程序入口对应的类路径以及界面显示组件名称 等信息。其中，图4是本公开实施例提供的功能模块显示组件配置流程图
在步骤210中，判断是否已对功能模块进行配置，若已对功能模块进行配置，则执行步骤220，若未对功能模块进行配置，，结束配置功能模块的显示组件的流程。
在步骤220中，获取功能模块的状态按钮名称(statebtnname)值，作为配置组件名称。
在步骤230中，配置功能模块显示的中文名称，该步骤为可选步骤。
在步骤240中，配置功能模块显示的状态图标。
在步骤二中，获取功能模块信息，初始化模块容器。
调度模型读取配置文件中的功能模块信息后，定义一个数据模型，数据模型的结构为HashMap<功能模块ID，功能模块的主程序入口对应的类路径>，遍历配置文件中的所有功能模块信息，按顺序保存到HashMap中，形成功能模块容器。图5本公开实施例提供的模型加载功能模块的流程图。
在步骤310中，系统初始化。
在步骤320中，加载配置文件。
在步骤330中，判断是否已配置功能模块，若已对功能模块进行配置，则执行步骤340，若未对功能模块进行配置，则结束加载功能模块的信息的流程。
在步骤340中，初始化功能模块容器。
在步骤350中，按照网管版本切换的功能模块的执行顺序，依次读取配置文件中的功能模块的信息，并加载至功能模块容器中，每个功能模块的信息包括功能模块ID和功能模块的主程序入口对应的类路径。
在步骤360中，加载配置文件中的功能模块的显示组件，每个功能模块的显示组件包括界面显示组件名称和状态图标。
在步骤370中，判断当前加载的功能模块信息是否是最后一个功能模块信息，若当前加载的功能模块信息是最后一个功能模块信息，则执行步骤结束加载功能模块的信息的流程，若当前加载的功能模块信息不是最后一个功能模块信息，则执行步骤350。
在步骤三中，部署界面显示流程。
根据功能模块ID找到对应的界面显示组件，按配置文件中功能模块的放置顺序，组织界面显示组件的放置位置，形成功能模块在界面上的显示流程。
在步骤四中，读取记忆模块的内容，更新执行流程节点。
模块容器初始化后，已经形成了既定的模块调度执行流程，在模型调度执行流程前，读取记忆功能模块，判断上次执行流程是否出错，如果上次执行流程一个节点出错，则从上次出错节点开始执行流程，节约流程执行时间。其中，图6本公开实施例提供的读取记忆模块内容的流程图。
在步骤410中，读取记忆模块。
在步骤420中，判断记忆模块是否为空，若记忆模块为空则执行步骤430，若记忆模块不为空则执行步骤450。
在步骤430中，读取记忆模块中的内容，即读取记忆模块中的已运行成功的功能模块的ID。
在步骤440中，在所有的流程节点中删除记忆流程节点，即后续流程不再调用读取的已运行成功的功能模块的ID对应的功能模块。
在步骤450中，执行当前的流程节点。
在步骤五中，调度执行流程节点，计时器开始计时。
开始执行流程节点前，启动计时器模块，开始给每个流程节点计时，到节点执行完成结束后，计算节点消耗时间，并反馈给界面显示组件，当整个流程调度结束后，计算整体耗费时间，反馈给界面显示模块，给用户作为流程执行参考依据。图7本公开实施例提供的计时流程图。
在步骤610中，模型调度开始。
在步骤620中，为当前调度的流程节点(即功能模块)启动计时器。
在步骤630中，执行当前调度的流程节点。
在步骤640中，当前调度的流程节点执行完毕。
在步骤650中，计算当前调度的流程节点的耗时(即运行时间)。
在步骤660中，将当前调度的流程节点的耗时反馈给界面显示模块(即显示模块)。
在步骤670中，判断所有流程节点是否均执行完毕，若所有流程节点均执行完毕则执行步骤680，若所有流程节点没有都执行完毕执行步骤620。
在步骤680中，统计总流程耗时。
在步骤六中，更新记忆模块内容。
模型每成功调度执行一个流程节点后，都更新记忆模块的内容，中途遇到执行流程节点出错后，直接退出调度流程。当所有流程节点都成功执行完毕，则清除记忆模块内容。图8本公开实施例提供的写记忆模块的流程图。
在步骤510中，执行当前调度的流程节点。
在步骤520中，判断当前调度的流程节点是否执行成功，若当前调度的流程节点执行成功，则执行步骤530，若当前调度的流程节点未执行成功则执行步骤560。
在步骤530中，将当前调度的流程节点的ID写入记忆模块。
在步骤540中，判断所有流程节点是否均执行完毕，若所有流程节点均执行完毕则执行步骤550，若所有流程节点没有都执行完毕则执行步骤510。
在步骤550中，清除记忆模块中的内容。
在步骤560中，退出调度流程。
在步骤七中，模型调度流程执行，界面实时更新
模型根据既定的流程调度执行流程节点，执行过程中根据执行结果，实时更新界面显示组件的运行状态，给用户展示流程的实时运行效果。图9本公开实施例提供的模型调度运行流程图。
在步骤710中，解析功能模块容器。
在步骤720中，根据解析结果，判断功能模块容器中是否存放功能模块信息，若功能模块容器中存放有功能模块信息，则执行步骤730，若功能模块容器中未存放功能模块信息，则结束流程。
在步骤730中，遍历功能模块容器。
在步骤740中，按照功能模块容器中记录的每条数据的顺序，调用功能模块的主程序入口对应的类路径。
在步骤750中，所调用的功能模块的状态图标转换为动态运行图标。
在步骤760中，判断所调用的功能模块是否运行成功，若所调用的功能模块否运行成功则执行步骤770，若所调用的功能模块未运行成功则执行步骤780。
在步骤770中，所调用的功能模块的状态图标转换为绿色。
在步骤780中，所调用的功能模块的状态图标转换为红色，结束流程。
在步骤790中，判断调用的功能模块是否为最后一个功能模块，若调用的功能模块是最后一个功能模块，则结束流程；若调用的功能模块不是最后一个功能模块，则执行步骤730。
综上所述，本公开的实施例，功能模块可配置，即以配置文件形式配置功能模块，具有良好的可扩展性和可维护性；功能模块的调用顺序可配置，即通过改变配置文件中的功能模块信息的存放顺序，改变功能模块的调用顺序；可以随时加入，随时调用功能模块，即通过在配置文件中增加需要加入并调用的功能模块信息，实现随时加入功能模块。流程出错，修改后可继续执行，即通过记忆模块的记忆功能，不再调用运行成功的功能模块，而是从上次运行失败的功能模块开始执行；流程运行效果呈现直观；以及运行过程可控，利于故障跟踪定位。
本公开实施例还提供了一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述任一实施例中的方法。
本公开实施例还提供了一种电子设备的硬件结构示意图。参见图10，该电子设备包括：
至少一个处理器(processor)80，图10中以一个处理器80为例；和存储器(memory)81，还可以包括通信接口(Communications Interface)82和总线83。其中，处理器80、通信接口82、存储器81可以通过总线83完成相互间的通信。通信接口82可以用于信息传输。处理器80可以调用存储器81中的逻辑指令，以执行上述实施例的方法。
此外，上述的存储器81中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。
存储器81作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序，如本公开实施例中的方法对应的程序指令或模块。处理器80通过运 行存储在存储器81中的软件程序、指令或模块，从而执行功能应用以及数据处理，即实现上述方法实施例中的模块流程化调度方法。
存储器81可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端设备的使用所创建的数据等。此外，存储器81可以包括高速随机存取存储器，还可以包括非易失性存储器。
本公开的技术方案可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括一个或多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开实施例所述方法的全部或部分步骤。而前述的存储介质可以是非暂态存储介质，包括：U盘、移动硬盘、ROM、RAM、磁碟或者光盘等多种可以存储程序代码的介质，也可以是暂态存储介质。
工业实用性
本公开实施例提供的模块流程化调度方法及装置，能够将单独的功能模块按照固定顺序自动调度执行，并以直观的界面方式展现给用户，能够降低故障出现率，提高工作效率。

Claims (15)

  1. 一种模块流程化调度方法，包括：
    按照功能模块的调度顺序，加载功能模块的信息；
    按照所述功能模块的信息的加载顺序，对功能模块进行调用；以及
    对调用的功能模块的调用运行状态进行更新，并进行界面显示。
  2. 根据权利要求1所述的方法，其中，所述按照功能模块的调度顺序，加载功能模块的信息包括：
    从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。
  3. 根据权利要求1所述的方法，其中，所述按照所述功能模块的信息的加载顺序，对功能模块进行调用包括：
    从已加载的功能模块的信息中，查询当前调用的功能模块的信息；
    利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块；以及
    若所述当前调用的功能模块运行成功，则通过查询下一个调用的功能模块的信息，调度并运行所述下一个调用的功能模块。
  4. 根据权利要求1-3任意一项所述的方法，所述方法还包括：
    当调度的功能模块运行成功时，记录所述运行成功的功能模块的信息。
  5. 根据权利要求4所述的方法，所述方法还包括：
    当所述运行成功的功能模块是最后一个功能模块时，删除所有已记录的运行成功的功能模块的信息。
  6. 根据权利要求4所述的方法，所述方法还包括：
    在执行下一次模块流程化调度时，查找所有已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中 删除所找到的运行成功的功能模块的信息。
  7. 根据权利要求1-3任意一项所述的方法，所述方法还包括：
    当调度的功能模块开始运行时，控制计时器进行启动计时；
    当调度的功能模块结束运行时，控制所述计时器停止计时；以及
    根据所述计时器的计时时间，确定调度的功能模块的运行时间。
  8. 一种模块流程化调度装置，包括：
    加载模块，设置为按照功能模块的调度顺序，加载功能模块的信息；
    调用模块，设置为按照所述功能模块的信息的加载顺序，对功能模块进行调用；以及
    显示模块，设置为对调用的功能模块的调用运行状态进行更新，并进行界面显示。
  9. 根据权利要求8所述的装置，其中，所述加载模块设置为从配置文件中依次读取按照功能模块的调度顺序保存的功能模块的信息，并按照功能模块的调度顺序，将读取的功能模块的信息加载到数据缓存区。
  10. 根据权利要求8所述的装置，其中，所述调用模块设置为从已加载的功能模块的信息中，查询当前调用的功能模块的信息，利用查询的当前调用的功能模块的信息，调度并运行所述当前调用的功能模块，以及若所述当前调用的功能模块运行成功，则通过查询下一个调用的功能模块的信息，调度并运行所述下一个调用的功能模块。
  11. 根据权利要求8-10任意一项所述的装置，所述装置还包括：
    记忆模块，设置为当调度的功能模块运行成功时，记录所述运行成功的功能模块的信息。
  12. 根据权利要求11所述的装置，其中，所述记忆模块还设置为在所述运 行成功的功能模块是最后一个功能模块时，删除所有已记录的运行成功的功能模块的信息。
  13. 根据权利要求11所述的装置，其中，所述加载模块，设置为在执行下一次模块流程化调度时，查找所述记忆模块已记录的运行成功的功能模块的信息，若找到运行成功的功能模块的信息，则从已加载的功能模块的信息中删除所找到的运行成功的功能模块的信息。
  14. 根据权利要求8-10任意一项所述的装置，所述装置还包括：
    计时模块，设置为当调度的功能模块开始运行时，控制计时器进行启动计时，当调度的功能模块结束运行时，控制所述计时器停止计时，以及根据所述计时器的计时时间，确定调度的功能模块的运行时间。
  15. 一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行权利要求1-7中任一项的方法。
PCT/CN2016/104332 2016-06-27 2016-11-02 模块流程化调度方法及装置 WO2018000678A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610481362.6A CN107544886A (zh) 2016-06-27 2016-06-27 一种模块流程化调度方法及装置
CN201610481362.6 2016-06-27

Publications (1)

Publication Number Publication Date
WO2018000678A1 true WO2018000678A1 (zh) 2018-01-04

Family

ID=60785910

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/104332 WO2018000678A1 (zh) 2016-06-27 2016-11-02 模块流程化调度方法及装置

Country Status (2)

Country Link
CN (1) CN107544886A (zh)
WO (1) WO2018000678A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111258555A (zh) * 2020-01-15 2020-06-09 上海知白智能科技有限公司 软件实现装置
CN111949328A (zh) * 2020-08-06 2020-11-17 中国工商银行股份有限公司 一种启动加速方法、装置、计算机设备及存储介质

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109491718A (zh) * 2018-09-13 2019-03-19 北京米文动力科技有限公司 一种插件加载方法及设备
CN111123815A (zh) * 2018-10-31 2020-05-08 西门子股份公司 用于确定功能块控制回路的循环时间的方法及装置
CN109918151A (zh) * 2019-03-14 2019-06-21 佳都新太科技股份有限公司 工作流实现方法、装置、设备及存储介质
CN110990137B (zh) * 2019-11-28 2022-08-26 北京字节跳动网络技术有限公司 应用程序的功能模块调度方法、调度信息处理方法及设备
CN111241447A (zh) * 2020-01-13 2020-06-05 浙江省北大信息技术高等研究院 一种网页数据采集方法、系统及存储介质
CN111273962B (zh) * 2020-02-14 2022-02-18 腾讯科技（深圳）有限公司 配置管理方法、装置、计算机可读存储介质和计算机设备
CN116257318B (zh) * 2023-05-17 2023-07-21 湖南一特医疗股份有限公司 一种基于物联网的氧气供应可视化构建方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101470624A (zh) * 2007-12-25 2009-07-01 新奥特（北京）视频技术有限公司 一种大型软件中多任务执行装置
CN102508716A (zh) * 2011-09-29 2012-06-20 用友软件股份有限公司 任务控制装置和任务控制方法
CN103488536A (zh) * 2013-09-29 2014-01-01 华为技术有限公司 任务调度方法、装置及操作系统
CN105373428A (zh) * 2015-12-09 2016-03-02 北京奇虎科技有限公司 一种任务调度方法和系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100377528C (zh) * 2004-06-28 2008-03-26 华为技术有限公司 一种网管系统安全管理方法
CN101290585B (zh) * 2007-04-19 2011-09-21 中兴通讯股份有限公司 一种嵌入式系统实时任务的调度方法
CN102486732A (zh) * 2010-12-02 2012-06-06 上海可鲁系统软件有限公司 一种分布式平台及平台中功能模块启动优先级控制方法
CN105159706A (zh) * 2015-08-07 2015-12-16 北京思特奇信息技术股份有限公司 一种流程化程序页面配置的执行方法及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101470624A (zh) * 2007-12-25 2009-07-01 新奥特（北京）视频技术有限公司 一种大型软件中多任务执行装置
CN102508716A (zh) * 2011-09-29 2012-06-20 用友软件股份有限公司 任务控制装置和任务控制方法
CN103488536A (zh) * 2013-09-29 2014-01-01 华为技术有限公司 任务调度方法、装置及操作系统
CN105373428A (zh) * 2015-12-09 2016-03-02 北京奇虎科技有限公司 一种任务调度方法和系统

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111258555A (zh) * 2020-01-15 2020-06-09 上海知白智能科技有限公司 软件实现装置
CN111949328A (zh) * 2020-08-06 2020-11-17 中国工商银行股份有限公司 一种启动加速方法、装置、计算机设备及存储介质
CN111949328B (zh) * 2020-08-06 2023-10-03 中国工商银行股份有限公司 一种启动加速方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
CN107544886A (zh) 2018-01-05

Similar Documents

Publication Publication Date Title
WO2018000678A1 (zh) 模块流程化调度方法及装置
US10453010B2 (en) Computer device, method, and apparatus for scheduling business flow
US9164755B2 (en) Personal and pooled virtual machine update
US8176465B2 (en) Pluggable model elements
WO2018036342A1 (zh) 基于csar的模型文件的可视化设计方法及装置
CN111125444A (zh) 大数据任务调度管理方法、装置、设备及存储介质
CN109726941B (zh) 一种智能终端的自动营销系统及自动营销方法
US11704139B2 (en) Service processing method and apparatus, electronic device, and storage medium
US20180082228A1 (en) Digital project management office
WO2009089746A1 (fr) Procédé, dispositif et système de réalisation d&#39;une tâche dans un environnement de grappes
WO2016127577A1 (zh) 一种处理事件的方法及装置
CN111949832A (zh) 批量作业依赖关系的解析方法及装置
CN111026530A (zh) 一种任务调度方法、装置、计算机设备和存储介质
CN109740765A (zh) 一种基于亚马逊网络服务器的机器学习系统搭建方法
CN113961346A (zh) 数据缓存的管理与调度方法、装置、电子设备和存储介质
CN111078383A (zh) 一种定时任务的管理方法、装置、设备及存储介质
WO2015196805A1 (zh) 批命令的执行方法及装置
WO2024037132A1 (zh) 工作流处理方法、装置、设备、存储介质和程序产品
WO2023185137A1 (zh) 一种任务管理方法、装置、设备及存储介质
CN114936152A (zh) 应用测试方法及设备
CN115617487A (zh) 一种容器重调度方法、装置、设备、存储介质
JP5387083B2 (ja) ジョブ管理システムおよび方法
CN111159188B (zh) 基于DataWorks实现准实时大数据量的处理方法
CN104462106A (zh) 数据更新方法及系统
US8892519B2 (en) Command interpreter

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16907074

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16907074

Country of ref document: EP

Kind code of ref document: A1