Simulation scheduling method and system for virtual integrated system model, equipment and medium
By introducing the concept of keyframes and a time scaling model, tasks are broken down into atomic operations that start and end execution, solving the problems of insufficient time precision and complex simulation task management in existing technologies, and achieving efficient and accurate simulation scheduling and resource optimization.
Patent Information
- Application Number
- CN202510769350.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-10
- Publication Date
- 2025-11-07
AI Technical Summary
In existing technologies, the time precision of the master-slave mode is insufficient, resulting in insufficient real-time performance and accuracy of simulation scheduling. Furthermore, the highly complex integration and scheduling management lacks the ability to dynamically adjust and intervene in complex simulation tasks in real time, failing to meet the requirements of time sensitivity and data real-time performance.
The concept of keyframes is introduced, and task execution is broken down into two atomic operations: start execution and end execution. The process is advanced through a virtual timeline, and tasks are independently assigned to different threads. A time scaling model is used to adjust the ratio of simulation time to real time, and tasks are offloaded on mobile devices to alleviate resource pressure.
It improves the concurrency and accuracy of simulation calculations, ensures that the simulation process strictly follows the predetermined timing, reduces the interdependence of task execution, and improves the efficiency of timeline advancement and the real-time performance of simulation calculations.
Smart Images

Figure CN120909698A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of virtual simulation, in particular to a simulation scheduling method and system for a virtual integrated system model, a device and a medium. BACKGROUND
[0002] In the fields of modern industry, scientific research, and design, optimization, and evaluation of many complex systems, model integration and simulation technology plays a crucial role. With the continuous improvement of system complexity, a single model often cannot fully and accurately reflect the complex process of real equipment operation, so it is necessary to effectively integrate and co-simulate multiple models of different types.
[0003] The timeline-based model integration and simulation method emerged as the times required. Its core purpose is to simulate the real process of real equipment operation by accurately scheduling and interacting various models in the time dimension. In actual application scenarios, such as large-scale industrial automation production lines, aerospace vehicle systems, smart grids, and other complex systems, they are composed of numerous sub-devices or subsystems with different functions and characteristics. Each sub-device or subsystem can be described by a corresponding model to represent its behavior and performance.
[0004] Referring to CN106777150B, a cross-system real-time simulation scheduling method and system are disclosed. The core is to realize cross-system, cross-platform, and diversified model integration, scheduling, and management through the collaborative work of the master node and the distributed node. However, the existing technology has the following problems:
[0005] Low efficiency of master-slave mode and insufficient time accuracy This scheme relies on the collaborative work of the master node and the distributed node, which has the efficiency bottleneck of the master-slave mode. The unified release time of the master node may cause a delay in time synchronization, resulting in the inability to achieve high-precision time management, affecting the real-time and accuracy of simulation scheduling.
[0006] High complexity of integration and scheduling management
[0007] Although the management and scheduling of the distributed node can interact with the physical device through the expansion interface, the system lacks the ability to dynamically adjust and intervene in real time for complex simulation tasks. In highly real-time and high-precision simulation scenarios, it may not fully meet the requirements of time sensitivity and real-time data, especially when complex systems and multiple nodes are synchronized, which may cause delays and data loss. SUMMARY
[0008] The purpose of the present application is to provide a simulation scheduling method and system for a virtual integrated system model, a device, and a medium to solve the above problems in the prior art.
[0009] The present application is achieved by the following technical solutions:
[0010] In a first aspect, a simulation scheduling method of a virtual integrated system model comprises:
[0011] obtaining a task to be executed, establishing a virtual time axis, placing all tasks on the virtual time axis according to time attributes, and defining a start node or an end node of the task as a key frame;
[0012] obtaining an execution signal of a start simulation, querying key frames of all tasks, and advancing the virtual time axis to a time point of the nearest key frame;
[0013] scheduling a corresponding task action at the time point of the nearest key frame, wherein the task action comprises a start execution and an end execution;
[0014] obtaining an arbitrary target key frame, determining whether a task needs to be ended when the task is executed from the target key frame;
[0015] if a task needs to be ended, determining whether the task to be ended has been executed, if the task has been executed, ending the task in the current frame, if the task has not been executed, waiting for the task to be executed, when the task is ended, executing the task from the target key frame, if a signal of stopping the process is not received, obtaining a next key frame, if the signal of stopping the task is received, ending the process;
[0016] if no task needs to be ended, executing the task from the target key frame, if a signal of stopping the task is not received, obtaining a next key frame, if the signal of stopping the task is received, ending the process.
[0017] Preferably, the virtual time axis is used to represent the advancement of time in the simulation process, a time scale model is established, a task type and a computing power basic parameter of a task to be completed are obtained, and a ratio of time in the virtual time axis to real time is output based on the authentication task amount and the computing power basic parameter through the time scale model.
[0018] Preferably, the task type comprises a periodic task and a special task.
[0019] The periodic task comprises a task defined with a certain period and periodically executed.
[0020] The special task is a task triggered by the periodic task but not periodically executed.
[0021] Preferably, the method further comprises:
[0022] after the periodic task is ended, a next execution time is calculated according to a period of the periodic task, and the next execution time is dynamically adjusted according to the period.
[0023] Preferably, the end flow comprises:
[0024] Determine whether the current task is located in a mobile terminal, if not in the mobile terminal, no processing is performed, if in the mobile terminal, determine whether the task needs to be unloaded, if not, no processing is performed;
[0025] If the task needs to be unloaded, the basic parameters of the tasks to be unloaded are obtained, an evaluation model is established, and an evaluation index is output based on the basic parameters through the evaluation model;
[0026] A number of tasks are unloaded in descending order according to the size of the evaluation index.
[0027] Preferably, the establishment of the time ratio model comprises:
[0028]
[0029] In the formula, N1 is the number of special tasks, N2 is the total number of tasks, P d is the highest computing power that can be used to complete the current simulation, P z is the total computing power of the current system, ψ is the time flow rate of the virtual time axis, and t is the time flow rate of the real time.
[0030] Preferably, the establishment of the evaluation model comprises:
[0031]
[0032] In the formula, R α is the evaluation index, μ is the value of the task execution waiting time, W is the time length from the start of the current task to the end of the execution, β is the value of the data size of the current task, E n is the channel bandwidth of the current system, V ε is the number of times of the current task loop execution, Y ζ is the computing power required to execute the current task.
[0033] In a second aspect, the present application also includes a simulation scheduling system of a virtual comprehensive system model, comprising:
[0034] A preparation module is configured to obtain a task to be executed, establish a virtual time axis, place all tasks on the virtual time axis according to time attributes, and define the start node or the end node of the task as a key frame; obtain an execution signal of the start of simulation, query the key frame of all tasks, and advance the virtual time axis to the time point of the nearest key frame; schedule the corresponding task action at the time point of the nearest key frame, wherein the task action comprises the start of execution and the end of execution;
[0035] The simulation module is configured to acquire a current arbitrary target key frame, determine whether a task needs to be ended when a task is executed from the target key frame, determine whether the task needs to be ended in the current frame if the task needs to be ended, complete the execution of the task if the task has been completed, end the execution of the task if the task has not been completed, wait for the execution of the task in the current frame to be completed, start the execution of the task in the target key frame after the execution of the task in the current frame is completed, acquire a next key frame if a signal of stopping the process is not received, and end the process if the signal of stopping the task is received.
[0036] The master control device is connected with the preparation module and the simulation module, and is used for executing the simulation scheduling method of the virtual comprehensive system model.
[0037] In a third aspect, the present application further provides an electronic device, which comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the simulation scheduling method of the virtual comprehensive system model when executing the computer program.
[0038] In a fourth aspect, the present application further provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the simulation scheduling method of the virtual comprehensive system model.
[0039] The technical scheme of the present application has at least the following advantages and beneficial effects:
[0040] The method provided by the present application introduces the concept of key frame, obtains the key frame through the starting execution time point and the ending execution time point, can skip most of the useless time points, and greatly improves the efficiency of the time axis promotion.
[0041] The present application divides the task execution into two atomic operations of starting execution and ending execution, and the atomic operation is a black box without external interaction in the execution process, thereby greatly reducing the mutual dependence of the task execution, and each atomic operation can be independently allocated to a different thread, and the concurrency of the simulation calculation is greatly improved.
[0042] The present application can accurately promote the time and quickly schedule the task through the task key frame, can ensure that the simulation process of the virtual comprehensive system model is strictly performed according to the predetermined time sequence, and guarantees the accuracy and reliability of the simulation. BRIEF DESCRIPTION OF DRAWINGS
[0043] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following will briefly introduce the drawings needed to be used in the embodiments. It should be understood that the following drawings only show some of the embodiments of the present application, and therefore should not be regarded as a limitation to the scope, and for those skilled in the art, other related drawings can also be obtained without creative labor.
[0044] Fig. 1 The control flow diagram of the present application;
[0045] Fig. 2 The schematic diagram of the periodic task of the present application. DETAILED DESCRIPTION
[0046] In order to make the objects, technical solutions and advantages of the embodiments of the present application more clear, the following will combine the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are some of the embodiments of the present application, but not all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various different configurations.
[0047] The independently described modules or sub-modules can be physically separated or not physically separated, can be software implemented or hardware implemented, and part of the modules or sub-modules can be implemented by software, the functions of the part of the modules or sub-modules are called by the processor, and the other part of the modules or sub-modules are implemented by hardware, for example, by hardware circuit. In addition, part or all of the modules can be selected according to actual needs to achieve the purpose of the present application.
[0048] Please refer to Figs. 1-2 The simulation scheduling method of the virtual comprehensive system model provided by the present application comprises:
[0049] S101: acquiring a task to be executed at present, establishing a virtual time axis, placing all tasks on the virtual time axis according to time attributes, and defining a start node or an end node of the task as a key frame;
[0050] The interaction of a single model is defined as an atomic operation, the periodically executed model interaction is regarded as a periodic task, the interaction triggered by other periodic tasks is regarded as a special task, and one complete execution of all tasks is composed of two interactions, i.e. start execution and end execution. The time point of starting or ending the task is defined as a key frame.
[0051] The time attribute of a task refers to a set of parameters or constraints used to describe the task itself and its key characteristics related to time when it is executed in a simulation or actual system. Specifically, a core set of parameters that describe when the task starts (arrival time), how long it needs to run (execution time), when it must end (deadline), how often it runs (period - for periodic tasks), and how urgent it is (priority). They are the basis for modeling the true task characteristics and the fundamental basis for the simulation engine to perform task scheduling, calculate key performance indicators.
[0052] S102: Obtain an execution signal of starting the simulation, query the key frame of all tasks, and advance the virtual time axis to the time point of the nearest key frame;
[0053] In this embodiment, the starting point of the virtual time axis is aligned with the key frame of a certain task, and the time point starting from the current key frame. The purpose is to:
[0054] Maximize simulation efficiency and avoid invalid simulation steps:
[0055] Between the key points (start, end) of the task, the state of the system is usually unchanged, or the change can be accurately predicted as "no state change" or "insignificant change" (for example, the CPU is only busy waiting to execute the current task). The internal execution time of the simulation engine does not need to elapse real time.
[0056] If a fixed time step is used to advance (for example, advancing once every 1 millisecond), in these idle or state-invariant time periods, the simulation engine will perform a large number of useless step calculations. These calculations neither change the system state nor produce new events, wasting computing resources and simulation time. Advancing to the next key frame precisely jumps over these "idle periods" and only processes the time points that truly cause state changes (i.e., event occurrence points), greatly reducing the number of simulation steps and computational overhead.
[0057] Second, ensure the accurate event processing order:
[0058] The behavior of a real-time system is driven by the event sequence (arrival, start execution, end execution) of its tasks. The time at which these events occur determines the behavior and state of the system. Using key frames (i.e., event points) as the advancement target ensures that the simulation engine strictly follows the timestamp order of the time-sensitive discrete events when processing them. It will not miss an event that occurs at a non-integer step due to fixed step advancement, or pile up events at different time points due to too large a step. This is crucial for evaluating the response time of a task and whether it meets the deadline. Missing the exact processing time of an event can result in completely incorrect subsequent scheduling calculations.
[0059] S103: scheduling a corresponding task action at a time point of the nearest key frame, the task action including starting execution and ending execution;
[0060] S104: acquiring a current arbitrary target key frame, and judging whether a task needs to end execution at a current frame when the task starts execution from the target key frame;
[0061] S105: if the task needs to end execution, judging whether the task that needs to end execution at the current frame is completed, if the task is completed, ending execution of the task at the current frame, if the task is not completed, waiting for the task at the current frame to be completed, starting execution of the task at the target key frame after the task at the current frame is completed, if a signal of stopping the flow is not received, acquiring a next key frame, if the signal of stopping the task is received, ending the flow;
[0062] S106: if the task does not need to end execution, starting execution of the task at the target key frame, if a signal of stopping the task is not received, acquiring a next key frame, if the signal of stopping the task is received, ending the flow.
[0063] In an actual simulation process:
[0064] After the simulation starts, key frames of all tasks are queried, and a virtual time axis is advanced to a time point of the nearest key frame.
[0065] At the time point of the key frame, a corresponding task action is scheduled, and each task is processed by an independent thread.
[0066] The task includes two actions of starting execution and ending execution, the starting execution acquires external data and performs internal logical operation, and does not output data externally; the ending execution outputs the operated data externally.
[0067] When the task starts execution, the virtual time axis does not wait for the task to be completed, but immediately queries a next key frame; however, when the task ends execution at a current frame, the task needs to be completed. When the task ends execution, the virtual time axis waits for the task to end execution, and then queries the next key frame.
[0068] By using the above method provided by the application, by introducing the concept of the key frame, the key frame is obtained through a time point of starting execution and ending execution, most of useless time points can be skipped, and the efficiency of advancing the time axis is greatly improved. By dividing the task execution into two atomic operations of starting execution and ending execution, the atomic operation is a black box and has no external interaction during execution, the dependence between the tasks during execution is greatly reduced, so that the atomic operations can be independently allocated to different threads, and the concurrency of the simulation calculation is greatly improved.
[0069] In an example embodiment of the present application, the virtual time axis is used to represent the advancement of time in the simulation process, a time scale model is established, the task type of the current task to be completed and the basic parameters of computing power are obtained, and the ratio of time in the virtual time axis to real time is output based on the authentication task amount and the basic parameters of computing power through the time scale model.
[0070] Specifically, the virtual time axis is the core component of the present application, which is used to represent the advancement of time in the simulation process, and is relatively independent of real time. The ratio of simulation time to real time can be flexibly adjusted according to the simulation requirements and computing power. For example, in the case of sufficient computing power, the running of the system for a long time can be simulated in a short real time; and in the case of insufficient computing power, the running of the system for a short time can be simulated in a long real time.
[0071] The time units on the virtual time axis and the real time units can be flexibly mapped and converted to meet the needs of different simulation scenarios. This mapping relationship can be dynamically adjusted according to the performance of the simulation system, the complexity of the model, and the user's requirements for simulation speed, etc.
[0072] Specifically, the establishment of the time scale model includes:
[0073]
[0074] In the formula, N1 is the number of special tasks, N2 is the total number of tasks, P d is the highest computing power that can be used to complete the current simulation, P z is the total computing power of the current system, and ψ is the time flow rate of the virtual time axis, t is the time flow rate of the real time, and t = 1.
[0075] In this embodiment, the types and quantities of computing power and tasks are considered, and the relationship or multiple between the virtual time axis and the real time is expressed, i.e., where the time flow rate is the speed of time passing, and the real time passing 1 second is a normal 1 second time, which may pass 0.5 seconds or 2 seconds on the virtual time axis, etc.
[0076] Since special tasks do not need to be executed periodically, special tasks do not require a large amount of computing power, and the more the number is, the higher the overall ratio is, and the higher the highest computing power that can be used to complete the current simulation is, the overall ratio can also be improved.
[0077] In an example embodiment of the present application, the task type includes periodic tasks and special tasks;
[0078] The periodic task includes a task defined with a certain period and periodically executed; the special task is a task triggered by the periodic task but not periodically executed
[0079] Periodic task calculates the next execution time according to its own period after ending execution. The period is calculated from the start time of the task. For example, if the start time of the task is 2 and the period is 10, then the next execution start time is 12 and the end time is 16, and so on.
[0080] Specifically, the method further comprises:
[0081] The periodic task calculates the next execution time according to the period of the periodic task after ending execution, and the time of the next execution is dynamically adjusted according to the period.
[0082] In an example embodiment of the present application, the computing power, storage space or energy consumption of a local device (such as a sensor, an embedded device or an edge node) in the current simulation is limited, and it cannot independently process all tasks (especially computationally intensive or time-sensitive tasks). It is necessary to unload the task (or subtask) to a node with stronger computing power (such as a cloud server, an edge server or other devices) in the simulation to relieve the pressure on local resources.
[0083] S201: Determine whether the current task is located on a mobile terminal. If not, no processing is performed. If it is located on a mobile terminal, it is determined whether the task needs to be unloaded. If not, no processing is performed.
[0084] Since the battery capacity of a mobile device or an Internet of Things terminal is limited, a complex computing task will quickly consume power. Therefore, if the current task is on a mobile terminal, no processing is performed. Then, some tasks are unloaded according to the current usage, and the judgment standard can be set as the occupied storage space and the like.
[0085] S202: If the task needs to be unloaded, the basic parameters of the tasks to be unloaded are obtained, an evaluation model is established, and an evaluation index is output based on the basic parameters through the evaluation model.
[0086] S203: The tasks are unloaded in descending order according to the evaluation index.
[0087] Since multiple tasks are unloaded at the same time, there may be a situation of insufficient computing power or channel congestion. Therefore, there is a problem of how to unload in order. The above scheme of the present embodiment provides a specific ordering scheme.
[0088] Specifically, the establishment of the evaluation model comprises:
[0089]
[0090] In the formula, R αTo evaluate the index, μ is the value of the task execution waiting time, W is the duration from the beginning of the current task to the end of the execution, β is the value of the data size of the current task, E n is the channel bandwidth of the current system, V ε is the number of times of the current task loop execution, Y ζ is the computing power required to execute the current task.
[0091] It should be noted that in the calculation of the present model, the calculation of the dimension is not considered, and when evaluating different tasks, the values in the same dimension are calculated, and the evaluation index is balanced by the plurality of parameters, and the order of unloading is obtained by the size of the evaluation index.
[0092] In a second aspect, the present application further includes a simulation scheduling system of a virtual comprehensive system model, comprising:
[0093] The preparation module is configured to obtain a task to be executed currently, establish a virtual time axis, place all tasks on the virtual time axis according to time attributes, and define a start node or an end node of the task as a key frame; obtain an execution signal of the simulation, query the key frame of all tasks, and advance the virtual time axis to a time point of the nearest key frame; schedule a corresponding task action at the time point of the nearest key frame, the task action including starting execution and ending execution;
[0094] The simulation module is configured to obtain any target key frame currently, when starting to execute the task from the target key frame, judge whether the current frame has a task to be ended; if there is a task to be ended, judge whether the task to be ended in the current frame has completed execution, if the task has completed execution, the task in the current frame is ended, if the task has not completed execution, the task in the current frame is ended after waiting for the task to be completed, after the task in the current frame is ended, the target key frame starts to execute the task, if a signal to stop the process is not received, the next key frame is obtained, if a signal to stop the task is received, the process is ended; if there is no task to be ended, the target key frame starts to execute the task, if a signal to stop the task is not received, the next key frame is obtained, if a signal to stop the task is received, the process is ended.
[0095] The master control device is connected with the preparation module and the simulation module, and is used for executing the simulation scheduling method of the virtual comprehensive system model.
[0096] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.
[0097] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a computer readable storage medium. The computer software product stored in a storage medium includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the embodiments of the method of the present application. The aforementioned storage medium includes a variety of media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0098] The above merely describes the preferred embodiments of the present application and is not intended to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims
1. A simulation scheduling method of a virtual integrated system model, characterized by, The method comprises the following steps: acquiring a task to be executed at present, establishing a virtual time axis, placing all tasks on the virtual time axis according to time attributes, and defining a start node or an end node of the task as a key frame; acquiring an execution signal of starting simulation, inquiring about the key frame of all tasks, and advancing the virtual time axis to a time point of the nearest key frame; scheduling a corresponding task action at the time point of the nearest key frame, wherein the task action comprises starting execution and ending execution; acquiring an arbitrary target key frame, and judging whether a task needs to end execution at a current frame when the task is executed from the target key frame; if a task needs to end execution, judging whether the task needs to end execution at the current frame has been completed, if the task has been completed, ending execution of the task at the current frame, if the task has not been completed, waiting for the task at the current frame to be completed, starting execution of the task at the target key frame, if a signal of stopping the process is not received, acquiring a next key frame, and if the signal of stopping the task is received, ending the process; if no task needs to end execution, starting execution of the task at the target key frame, if a signal of stopping the task is not received, acquiring a next key frame, and if the signal of stopping the task is received, ending the process.
2. The simulation scheduling method of a virtual integrated system model according to claim 1, characterized in that, The virtual time axis is used to represent the advancement of time in the simulation process, to establish a time scale model, to acquire a task type of a task to be completed at present and basic parameters of computing power, and to output a ratio of time in the virtual time axis to real time based on the authentication task amount and the basic parameters of computing power through the time scale model.
3. The simulation scheduling method of a virtual integrated system model according to claim 2, wherein, The task type comprises a periodic task and a special task. The periodic task comprises a task defined with a certain period and periodically executed. The special task is a task triggered by the periodic task but not periodically executed.
4. The simulation scheduling method of a virtual integrated system model according to claim 3, wherein, The method further comprises the following steps: after the periodic task ends execution, calculating a next execution time of the periodic task according to a period of the periodic task, and dynamically adjusting the next execution time according to the period.
5. The simulation scheduling method of a virtual integrated system model according to claim 4, wherein, The ending process comprises the following steps: judging whether a current task is located on a mobile terminal, if not, not processing, and if yes, judging whether the task needs to be unloaded, if not, not processing, and if yes, acquiring basic parameters of a plurality of tasks to be unloaded, establishing an evaluation model, and outputting an evaluation index based on the basic parameters through the evaluation model; the plurality of tasks are unloaded once from large to small according to the evaluation index. The establishment of the time scale model comprises the following steps:
6. The simulation scheduling method of a virtual integrated system model according to claim 5, wherein, The establishment of the evaluation model comprises the following steps: In the formula, N1 is the number of special tasks, N2 is the total number of tasks, P d P is the highest computing power that can be used to complete the current simulation, z P is the total computing power of the current system, ψ is the time flow rate of the virtual time axis, and t is the time flow rate of the real time.
7. The simulation scheduling method of a virtual integrated system model according to claim 5, wherein, The method comprises the following steps: In the formula, R α is an evaluation index, μ is a value of a task execution waiting time, W is a time length from starting execution to ending execution of a current task, β is a value of a data size of the current task, E n is a channel bandwidth of a current system, V ε is a number of times of cyclic execution of the current task, Y ζ is a computing power required for executing the current task.
8. A simulation dispatch system for a virtual integrated system model, characterized by, a preparation module is configured to acquire a task to be executed at present, establish a virtual time axis, place all tasks on the virtual time axis according to time attributes, and define a start node or an end node of the task as a key frame; acquire an execution signal of starting simulation, inquire about the key frame of all tasks, and advance the virtual time axis to a time point of the nearest key frame; and schedule a corresponding task action at the time point of the nearest key frame, wherein the task action comprises starting execution and ending execution. The simulation module is configured to acquire a current arbitrary target key frame, determine whether there is a task to be ended when a task is executed from the target key frame, determine whether the task to be ended in the current frame is completed if there is a task to be ended, end the task in the current frame if the task is completed, wait for the task in the current frame to be completed if the task is not completed, end the task in the current frame, start the task in the target key frame after the task in the current frame is completed, acquire a next key frame if a signal to stop the process is not received, and end the process if the signal to stop the task is received. If there is no task to be ended, the target key frame starts the task, a next key frame is acquired if a signal to stop the task is not received, and the process is ended if the signal to stop the task is received. The main control device is connected with the preparation module and the simulation module, and is configured to execute the simulation scheduling method of the virtual comprehensive system model according to any one of claims 1-7.
9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the computer program to implement the simulation scheduling method of the virtual comprehensive system model according to any one of claims 1-7.
10. A computer-readable storage medium, characterized in that, The computer program is stored on the computer readable storage medium, and the computer program is executed by the processor to implement the simulation scheduling method of the virtual comprehensive system model according to any one of claims 1-7.
Citation Information
Patent Citations
A cross-system data conversion method integrating power grid operating environment and equipment information
CN106777150B