CN111124697B - Task synchronization and execution method for distributed platform - Google Patents
Task synchronization and execution method for distributed platform Download PDFInfo
- Publication number
- CN111124697B CN111124697B CN202010001872.5A CN202010001872A CN111124697B CN 111124697 B CN111124697 B CN 111124697B CN 202010001872 A CN202010001872 A CN 202010001872A CN 111124697 B CN111124697 B CN 111124697B
- Authority
- CN
- China
- Prior art keywords
- resource
- task sequence
- node
- subtasks
- sequence
- 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
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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/526—Mutual exclusion algorithms
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The utility model provides a task synchronization and execution method for a distributed platform, which aims to realize a synchronization mechanism among multi-task sequences of the distributed platform and ensure the mutual exclusive access of platform resources, so that the whole distributed platform can share resources and stably run a series of tasks. The method comprises the following steps: for each node under the distributed platform, the resource lock is acquired in competition through interaction with the file system type registration center, so that a synchronization mechanism is realized; if the tasks of the whole task sequence obtain the resource lock, then adopting an asynchronous execution mode for the task sequence to carry out multithread concurrent processing. If the sequence does not fully acquire the resource lock or the contention fails, the processing is performed by means of spin, rollback and the like.
Description
Technical Field
The utility model belongs to the field of distributed task processing, and particularly relates to a task synchronization and execution method for a distributed platform.
Background
With the rapid development of network and information technology, distributed system technology is increasingly used. In the aviation field, airborne clouds are gaining attention, and an aircraft is taken as a node to establish a distributed architecture, so that resource sharing can be performed between the aircraft and a series of tasks can be completed. However, due to the objective factors of the platform, it is difficult to efficiently and reliably complete the requirements of multiple task sequences.
Disclosure of Invention
The utility model aims to realize a synchronization mechanism among the multi-task sequences of the distributed platform and ensure the mutually exclusive access of platform resources, so that the whole distributed platform can share the resources and stably run a series of tasks.
The technical scheme of the utility model is as follows:
the task synchronization and execution method facing the distributed platform comprises the following steps:
step 1), a task sequence execution module (computer software running on any distributed node) sends a request for acquiring a resource lock to a unified registry, wherein the request comprises a UUID (universal serial bus) which is randomly generated and corresponds to a current task sequence and resource information required by a certain subtask in the current task sequence;
step 2) verifying whether the UUID of the current task sequence is consistent with the UUID of the corresponding resource lock (corresponding to the resource information required by the certain subtask) recorded by the unified registry;
step 3) if the two sub-tasks are consistent (indicating that a certain sub-task in the front of the task sequence has obtained the resource lock), obtaining the resource lock successfully; directly executing the step 5); if the UUID of the corresponding resource lock recorded by the unified registry is empty, executing the step 4); if the resource lock is inconsistent (indicating that the corresponding resource is currently occupied by other task sequences), the acquisition of the resource lock fails, and the subsequent steps are not executed any more;
step 4), the unified registration center receives the request and competes to create a resource node catalog in a multithreading mode; if the resource node catalog is successfully created, acquiring a resource lock successfully, and writing the UUID of the current task sequence into a data bit corresponding to the resource node catalog; if the resource node catalog is failed to be established, spin operation is entered, and continuous competition is returned;
step 5), the task sequence execution module judges whether all the resource locks needed by all the subtasks of the task sequence compete successfully or not, and if the resource locks compete successfully, the task sequence is executed; otherwise, starting execution from the step 1) again, and continuing to compete for the resource lock of the subsequent subtasks of the task sequence.
Optionally, the resource information in step 1) includes a primary node ID, a resource category, and a secondary node ID. For example, a primary node-an aircraft node-a secondary node-a functional device node (e.g., a weapons node).
Optionally, for the spin operation in step 4), if the spin operation has exceeded the upper limit of the number of times, it indicates that acquiring the resource lock fails, and the request is terminated.
Optionally, when the acquisition of the resource lock fails, further judging whether the former sub-tasks of the current task sequence acquire other resource locks or not; if yes, releasing the other resource lock, and then terminating the request; if not, the request is directly terminated.
Optionally, the primary node is an aircraft node, and the secondary node is a functional equipment node; the task sequence execution module operates on any aircraft node of the distributed platform, and the unified registry is carried on one set aircraft node or the ground command center.
Optionally, the executing the task sequence in step 5) is executed in a multi-thread concurrent manner for a plurality of subtasks in the task sequence; and according to the time sequence relation among the subtasks, carrying out waiting and suspending operation on the dependent tasks, returning a result after the execution of the current sequence subtasks is completed, and waking up the suspended related subtasks to read the returned result at the moment, and continuing to execute the tasks.
Correspondingly, the utility model also provides a distributed node, which comprises a processor and a program memory, wherein the program memory stores programs which can be loaded by the processor to execute the following steps:
step 1) sending a request for acquiring a resource lock to a unified registration center, wherein the request comprises a UUID (unmanned aerial vehicle) which is randomly generated and corresponds to a current task sequence and resource information required by a certain subtask in the current task sequence;
step 2) verifying whether the UUID of the current task sequence is consistent with the UUID of the corresponding resource lock recorded by the unified registry;
step 3) if the resource locks are consistent, the resource locks are successfully obtained; directly executing the step 5); if the UUID of the corresponding resource lock recorded by the unified registry is empty, executing the step 4); if the resource locks are inconsistent, the resource locks are failed to be acquired, the subsequent steps are not executed, and the request is terminated;
step 4) responding to the result of the unified registration center to establish the resource node catalog through competition in a multithreading mode; if the resource node catalog is successfully created, acquiring a resource lock successfully, and writing the UUID of the current task sequence into a data bit corresponding to the resource node catalog; if the resource node catalog is failed to be established, spin operation is entered, and continuous competition is returned;
step 5) judging whether all the resource locks needed by all the subtasks of the task sequence compete successfully or not, and if so, executing the task sequence; otherwise, starting execution from the step 1) again, and continuing to compete for the resource lock of the subsequent subtasks of the task sequence.
The utility model has at least the following advantages:
aiming at a distributed platform limited by objective factors when tasks such as an airborne cloud are executed, the utility model provides a synchronization mechanism scheme for solving the synchronization problem among a plurality of task sequences. Meanwhile, a reasonable release method is provided for the problem of releasing the resource lock in the synchronous mechanism, so that the fault tolerance of the whole platform is improved, and the occurrence of deadlock is prevented.
Drawings
FIG. 1 is a flow chart of an embodiment of the present utility model.
FIG. 2 is a diagram illustrating resource lock contention.
Detailed Description
The utility model is further described in detail below with reference to the drawings and examples.
The embodiment mainly comprises a synchronization mechanism for the multi-task sequence contention resource lock and concurrent execution of the task sequence under the synchronization mechanism. For each node under the distributed platform, the resource lock is acquired in competition through interaction with a unified registry (file system registry), so as to realize a synchronization mechanism; if the tasks of the whole task sequence obtain the resource lock, then adopting an asynchronous execution mode for the task sequence to carry out multithread concurrent processing. If the sequence does not fully acquire the resource lock or the contention fails, the processing is performed by means of spin, rollback and the like. The overall execution flow is shown in fig. 1.
When the distributed platform performs the process of multi-task execution, the tasks are required to compete for resources due to the limitation of objective factors, for example, in an airborne cloud environment, a cloud node network is formed by a plurality of planes, but the tasks in a plurality of task sequences cannot be executed in parallel by taking the plane as the node resource, so that a synchronous task execution mode can only be adopted. And for the interior of the task sequence for obtaining all the resources, the tasks can be executed in an asynchronous mode. In the process of acquiring the resources, the competition of the resources is required to be carried out through a unified registry, and the information registration after the resources are acquired is completed. The utility model mainly comprises the following steps: and carrying out resource competition and concurrent execution processing of subtasks in the task sequence by using a registry mechanism. The method is characterized in that: (1) aiming at the distributed environment similar to the airborne cloud, the embodiment realizes synchronous task execution, adopts a unified registry to lock resources, solves the distributed lock competition, and has the problems of resource release and rollback; (2) the subtasks are processed in a concurrent mode, so that asynchronous execution of the subtasks is realized; (3) and releasing the resource lock in three modes of timing release, error release and completion release.
Task synchronous execution and resource lock competition part: aiming at the condition that a plurality of task sequences are executed in a distributed environment, the system is limited by some objective factors, and can only meet the execution requirement of one task sequence, and a synchronous mechanism is met at the moment, but the distributed environment is different from a single machine environment, and resource scheduling cannot be carried out through threads or processes, so that a unified registry is introduced for lock management. When multiple task sequences need to use the same resource, a resource lock request is initiated first, and at a registry end, a lock is acquired in a multithreaded resource competition mode, the task sequence acquiring the lock can continue to run downwards, and partial acquired or non-acquired resources need to be subjected to failure rollback to release the acquired lock, and a result of failure in execution of the task sequence is returned, and competition of the resource lock is waited to be restarted again. Fig. 2 is a schematic diagram of resource lock contention, where UUIDs are the same for the same aircraft node; and when the resource lock is successfully contended, a catalog of the resource is created, a UUID unique mark is added as the occupation of the resource, and the resource lock corresponding to the subtask of the same task sequence is not required to be contended again when the subtask of the same task sequence is acquired next time.
The concurrent processing of the subtasks realizes asynchronous execution: the task sequence of all resource locks is obtained to execute tasks, and for the subtasks in the task sequence, the execution sequence of the tasks is controlled by time (each subtask is executed according to a set time sequence), so that a multithreading concurrency mode is adopted, but the task dependency can occur in a distributed environment similar to an airborne cloud, namely, a returned result can be used as an input parameter of a subsequent task after the execution of the preceding task is finished, so that the task waiting for suspension operation needs to be carried out on the dependent task, after the execution of the current task is finished, the result is returned, and at the moment, the suspended related task is awakened to read the returned result, and the task is continuously executed.
The release of the resource lock is performed by means of three modes, namely, timing release, error release and completion release. The time release resource lock is to calculate the execution period time of the task and release the resource at fixed time to prevent the unsuccessful release of the resource lock after the task is executed; error release means that once task execution fails, subsequent task execution is terminated and all resource locks are released; and releasing the resource lock after the task is normally executed after the release is completed.
As shown in fig. 1, the specific flow of this embodiment is as follows:
step 1), a task sequence execution module sends a resource lock acquisition request to a unified registry, wherein the request comprises a UUID (unmanned aerial vehicle) which is randomly generated and corresponds to a current task sequence and resource information (such as an airplane node ID, a resource category, a weapon node ID and the like) required by a certain subtask in the current task sequence;
step 2) verifying whether the UUID of the current task sequence is consistent with the UUID of the corresponding resource lock recorded by the unified registry;
step 3) if the resource locks are consistent, the resource locks are successfully obtained; directly executing the step 5); if the UUID of the corresponding resource lock recorded by the unified registry is empty, executing the step 4); if the resource locks are inconsistent, the resource locks are not acquired, and the subsequent steps are not executed;
step 4), the unified registration center receives the request and competes to create a resource node catalog in a multithreading mode; if the resource node catalog is successfully created, acquiring a resource lock successfully, and writing the UUID of the current task sequence into a data bit corresponding to the resource node catalog; if the resource node catalog is failed to be established, spin operation is entered, and continuous competition is returned; if the spin operation exceeds the upper limit of the times, the acquisition of the resource lock is failed, and the request is terminated; when the acquisition of the resource lock fails, further judging whether a plurality of subtasks in the front of the current task sequence acquire other resource locks or not; if yes, releasing the other resource lock, and then terminating the request; if not, directly terminating the request;
step 5), the task sequence execution module judges whether all the resource locks needed by all the subtasks of the task sequence compete successfully or not, and if the resource locks compete successfully, the task sequence is executed; otherwise, starting execution from the step 1) again, and continuing to compete for the resource lock of the subsequent subtasks of the task sequence. Wherein, for a plurality of subtasks in the task sequence, a multithreading concurrent mode is adopted for execution; and according to the time sequence relation among the subtasks, carrying out waiting and suspending operation on the dependent tasks, returning a result after the execution of the current sequence subtasks is completed, and waking up the suspended related subtasks to read the returned result at the moment, and continuing to execute the tasks.
Claims (6)
1. The task synchronization and execution method for the distributed platform is characterized by comprising the following steps:
step 1), a task sequence execution module sends a request for acquiring a resource lock to a unified registry, wherein the request comprises a UUID (unmanned aerial vehicle) which is randomly generated and corresponds to a current task sequence and resource information required by a certain subtask in the current task sequence; the resource information comprises a primary node ID, a resource category and a secondary node ID;
step 2) verifying whether the UUID of the current task sequence is consistent with the UUID of the corresponding resource lock recorded by the unified registry;
step 3) if the resource locks are consistent, the resource locks are successfully obtained; directly executing the step 5); if the UUID of the corresponding resource lock recorded by the unified registry is empty, executing the step 4); if the resource locks are inconsistent, the resource locks are not acquired, and the subsequent steps are not executed;
step 4), the unified registration center receives the request and competes to create a resource node catalog in a multithreading mode; if the resource node catalog is successfully created, acquiring a resource lock successfully, and writing the UUID of the current task sequence into a data bit corresponding to the resource node catalog; if the resource node catalog is failed to be established, spin operation is entered, and continuous competition is returned; if the spin operation exceeds the upper limit of times, the spin operation indicates that the acquisition of the resource lock fails, and the request is terminated;
step 5), the task sequence execution module judges whether all the resource locks needed by all the subtasks of the task sequence compete successfully or not, and if the resource locks compete successfully, the task sequence is executed; otherwise, starting execution from the step 1) again, and continuing to compete for the resource lock of the subsequent subtasks of the task sequence.
2. The distributed platform oriented task synchronization and execution method of claim 1, wherein: when the acquisition of the resource lock fails, further judging whether a plurality of subtasks in the front of the current task sequence acquire other resource locks or not; if yes, releasing the other resource lock, and then terminating the request; if not, the request is directly terminated.
3. The distributed platform oriented task synchronization and execution method of claim 1, wherein: the first-level node is an airplane node, and the second-level node is a functional equipment node; the task sequence execution module operates on any aircraft node of the distributed platform, and the unified registration center is carried on one set aircraft node or the ground command center.
4. The distributed platform oriented task synchronization and execution method of claim 1, wherein: the task sequence is executed in the step 5), and a multithreading concurrent mode is adopted for executing a plurality of subtasks in the task sequence; and according to the time sequence relation among the subtasks, carrying out waiting and suspending operation on the dependent tasks, returning a result after the execution of the current sequence subtasks is completed, and waking up the suspended related subtasks to read the returned result at the moment, and continuing to execute the tasks.
5. A distributed node comprising a processor and a program memory, characterized by: the program memory stores a program that can be loaded by a processor to perform the steps of:
step 1) sending a request for acquiring a resource lock to a unified registration center, wherein the request comprises a UUID (unmanned aerial vehicle) which is randomly generated and corresponds to a current task sequence and resource information required by a certain subtask in the current task sequence; the resource information comprises a primary node ID, a resource category and a secondary node ID;
step 2) verifying whether the UUID of the current task sequence is consistent with the UUID of the corresponding resource lock recorded by the unified registry;
step 3) if the resource locks are consistent, the resource locks are successfully obtained; directly executing the step 5); if the UUID of the corresponding resource lock recorded by the unified registry is empty, executing the step 4); if the resource locks are inconsistent, the resource locks are failed to be acquired, the subsequent steps are not executed, and the request is terminated;
step 4) responding to the result of the unified registration center to establish the resource node catalog through competition in a multithreading mode; if the resource node catalog is successfully created, acquiring a resource lock successfully, and writing the UUID of the current task sequence into a data bit corresponding to the resource node catalog; if the resource node catalog is failed to be established, spin operation is entered, and continuous competition is returned; if the spin operation exceeds the upper limit of times, the spin operation indicates that the acquisition of the resource lock fails, and the request is terminated; when the acquisition of the resource lock fails, further judging whether a plurality of subtasks in the front of the current task sequence acquire other resource locks or not; if yes, releasing the other resource lock, and then terminating the request; if not, directly terminating the request
Step 5) judging whether all the resource locks needed by all the subtasks of the task sequence compete successfully or not, and if so, executing the task sequence; otherwise, starting execution from the step 1) again, and continuing to compete for the resource lock of the subsequent subtasks of the task sequence.
6. A distributed node according to claim 5, wherein: the task sequence is executed in the step 5), and a multithreading concurrent mode is adopted for executing a plurality of subtasks in the task sequence; and according to the time sequence relation among the subtasks, carrying out waiting and suspending operation on the dependent tasks, returning a result after the execution of the current sequence subtasks is completed, and waking up the suspended related subtasks to read the returned result at the moment, and continuing to execute the tasks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010001872.5A CN111124697B (en) | 2020-01-02 | 2020-01-02 | Task synchronization and execution method for distributed platform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010001872.5A CN111124697B (en) | 2020-01-02 | 2020-01-02 | Task synchronization and execution method for distributed platform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111124697A CN111124697A (en) | 2020-05-08 |
| CN111124697B true CN111124697B (en) | 2023-09-08 |
Family
ID=70507382
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010001872.5A Active CN111124697B (en) | 2020-01-02 | 2020-01-02 | Task synchronization and execution method for distributed platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111124697B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114006913A (en) * | 2021-10-29 | 2022-02-01 | 中国银行股份有限公司 | Distributed lock processing method and device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800763A (en) * | 2009-02-05 | 2010-08-11 | 威睿公司 | hybrid locking using network and on-disk based schemes |
| CN104702655A (en) * | 2014-03-21 | 2015-06-10 | 杭州海康威视系统技术有限公司 | Cloud storage resource distribution method and system |
| CN106325980A (en) * | 2015-06-30 | 2017-01-11 | 中国石油化工股份有限公司 | Multi-thread concurrent system |
| CN106572130A (en) * | 2015-10-09 | 2017-04-19 | 阿里巴巴集团控股有限公司 | Method used for realizing distributed lock management and equipment thereof |
| CN107133108A (en) * | 2017-04-27 | 2017-09-05 | 努比亚技术有限公司 | Implementation method, terminal, server and the computer-readable recording medium of distributed complex lock |
| CN107608773A (en) * | 2017-08-24 | 2018-01-19 | 阿里巴巴集团控股有限公司 | task concurrent processing method, device and computing device |
| CN108038005A (en) * | 2017-12-28 | 2018-05-15 | 广东蜂助手网络技术股份有限公司 | Shared resource access method, client, server-side, system based on zookeeper |
| CN109753364A (en) * | 2018-12-28 | 2019-05-14 | 北京明朝万达科技股份有限公司 | A kind of implementation method, equipment and the medium of network-based distributed lock |
| CN109753540A (en) * | 2018-12-03 | 2019-05-14 | 新华三云计算技术有限公司 | Shared resource access method, device and computer-readable storage medium |
| CN110445864A (en) * | 2019-08-11 | 2019-11-12 | 西藏宁算科技集团有限公司 | The realization method and system of distributed lock under a kind of cloud computing environment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8271437B2 (en) * | 2008-07-28 | 2012-09-18 | International Business Machines Corporation | Managing locks across distributed computing nodes |
-
2020
- 2020-01-02 CN CN202010001872.5A patent/CN111124697B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800763A (en) * | 2009-02-05 | 2010-08-11 | 威睿公司 | hybrid locking using network and on-disk based schemes |
| CN104702655A (en) * | 2014-03-21 | 2015-06-10 | 杭州海康威视系统技术有限公司 | Cloud storage resource distribution method and system |
| CN106325980A (en) * | 2015-06-30 | 2017-01-11 | 中国石油化工股份有限公司 | Multi-thread concurrent system |
| CN106572130A (en) * | 2015-10-09 | 2017-04-19 | 阿里巴巴集团控股有限公司 | Method used for realizing distributed lock management and equipment thereof |
| CN107133108A (en) * | 2017-04-27 | 2017-09-05 | 努比亚技术有限公司 | Implementation method, terminal, server and the computer-readable recording medium of distributed complex lock |
| CN107608773A (en) * | 2017-08-24 | 2018-01-19 | 阿里巴巴集团控股有限公司 | task concurrent processing method, device and computing device |
| CN108038005A (en) * | 2017-12-28 | 2018-05-15 | 广东蜂助手网络技术股份有限公司 | Shared resource access method, client, server-side, system based on zookeeper |
| CN109753540A (en) * | 2018-12-03 | 2019-05-14 | 新华三云计算技术有限公司 | Shared resource access method, device and computer-readable storage medium |
| CN109753364A (en) * | 2018-12-28 | 2019-05-14 | 北京明朝万达科技股份有限公司 | A kind of implementation method, equipment and the medium of network-based distributed lock |
| CN110445864A (en) * | 2019-08-11 | 2019-11-12 | 西藏宁算科技集团有限公司 | The realization method and system of distributed lock under a kind of cloud computing environment |
Non-Patent Citations (1)
| Title |
|---|
| 刘芬 ; 王芳 ; 田昊 ; .基于Zookeeper的分布式锁服务及性能优化.计算机研究与发展.2014,(S1),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111124697A (en) | 2020-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20070206611A1 (en) | Effective high availability cluster management and effective state propagation for failure recovery in high availability clusters | |
| CN112527489B (en) | Task scheduling method, device, equipment and computer readable storage medium | |
| CN111105155B (en) | Role-based group unmanned system collaborative task management method | |
| JPH03230225A (en) | Process dispersion system | |
| CN103500119B (en) | A kind of method for allocating tasks based on pre-scheduling | |
| CN111124697B (en) | Task synchronization and execution method for distributed platform | |
| CN106961700B (en) | Wireless communication method for dynamic remote fault-tolerant reconstruction of cluster avionics system computing resources | |
| CN111459622A (en) | Method and device for scheduling virtual CPU, computer equipment and storage medium | |
| CN110134533B (en) | System and method capable of scheduling data in batches | |
| CN113051049B (en) | Task scheduling system, method, electronic device and readable storage medium | |
| CN111858026B (en) | Efficient parallel scheduling method for large-scale multi-granularity simulation model | |
| CN101189579A (en) | Behavioral model based multi-threaded architecture | |
| CN115964176B (en) | Cloud computing cluster scheduling method, electronic equipment and storage medium | |
| CN102214094B (en) | Operation is performed via asynchronous programming model | |
| Böhm et al. | Multi-core processors in the automotive domain: An AUTOSAR case study | |
| Chiba et al. | A distributed real-time operating system with location-transparent system calls for task management and inter-task synchronization | |
| CN108345505B (en) | Multithreading resource management method and system | |
| CN115269136A (en) | Heterogeneous multi-core platform partition operating system safety scheduling method and system | |
| CN111580792B (en) | High-reliability satellite-borne software architecture design method based on operating system | |
| CN111201514B (en) | Electronic device and method for implementing partitioning during execution of a software application on a platform comprising a multicore processor, associated computer program and electronic system | |
| Gu et al. | Dynamic Reconfiguration Mechanism for Distributed Integrated Modular Avionics System | |
| JP2019204387A (en) | Program execution control method and program converter | |
| CN115904711B (en) | Load balancing-oriented multi-core IMA (image processing) predictability scheduling method | |
| CN117591132B (en) | Service release method and release system | |
| CN112363816B (en) | Deterministic scheduling method, system and medium for embedded multi-core operating system |
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 |