CN115629827B - Linux server multi-application process scheduling method based on shared memory - Google Patents
Linux server multi-application process scheduling method based on shared memory Download PDFInfo
- Publication number
- CN115629827B CN115629827B CN202211652082.9A CN202211652082A CN115629827B CN 115629827 B CN115629827 B CN 115629827B CN 202211652082 A CN202211652082 A CN 202211652082A CN 115629827 B CN115629827 B CN 115629827B
- Authority
- CN
- China
- Prior art keywords
- shared memory
- application software
- state
- information
- updating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
- G06F9/44505—Configuring for program initiating, e.g. using registry, configuration files
-
- 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/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
- G06F9/44594—Unloading
-
- 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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- 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/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
-
- 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)
- Hardware Redundancy (AREA)
Abstract
The invention discloses a Linux server multi-application process scheduling method based on a shared memory, which comprises the following steps: 1. configuring each application software of a data processing system running on a Linux server; 2. creating a shared memory; 3. setting and initializing a plurality of process information contents in a shared memory; 4. sequentially writing the configuration information of each application software into the shared memory; 5. starting each application software to update the PID parameters of the corresponding process of the shared memory; 6. updating the survival time parameter of the process corresponding to the shared memory at regular time when the process corresponding to each application software runs; 7. reading information of each process of the shared memory at regular time, and updating or maintaining the state of each process of the shared memory; 8. stopping or restarting of any application software. The invention stores the process information of each application program into the system process shared memory, and carries out scheduling management on multiple processes based on the process scheduling processing strategy and the process state.
Description
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to a shared memory-based Linux server multi-application process scheduling method.
Background
The data processing system runs on a plurality of servers provided with Linux kernel operating systems. Based on the consideration of service layering, component generalization and flexible function configuration, a data processing system generally comprises hundreds of application software with the same frame design, similar processing logic, mutually independent operation and different specific functions, and is started and stopped in a daemon process mode resident background operation or an on-demand dynamic scheduling mode. In the same way, data interaction is mainly performed between application processes (application program processes) on the Linux server in a message middleware manner, and the data interaction is closely related to the upstream and downstream of data processing, so that once a certain application process is abnormal, the function of a data processing system is affected or even unavailable, and therefore, in the whole life cycle of the large-scale application processes of the Linux server, the process management problems of initialization starting, running monitoring, quitting in abnormal and the like of each application process need to be solved, and the states of all application processes of the data processing system are controlled.
Aiming at the design of a Linux server multiprocess, the current scheme is a multi-process application program of an IPTV live broadcast system based on a Linux kernel, and specifically comprises the steps of creating a work main process by a management process, monitoring the work main process based on a message queue, creating a work sub-process by the work main process, and finishing inter-process data sharing and process monitoring through a shared memory. When a certain sub-process of a work is abnormal, all the work processes need to be killed, and then the system is restarted.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method for scheduling multiple application processes of a Linux server based on a shared memory, which has simple steps and reasonable design, uniformly considers the processes corresponding to all application programs running on the Linux server, stores the process information of each application program into a system process shared memory, schedules and manages the multiple processes based on a process scheduling processing strategy and a process state, and independently controls the starting, stopping and restarting of each process.
In order to solve the technical problems, the invention adopts the technical scheme that: a Linux server multi-application process scheduling method based on a shared memory is characterized by comprising the following steps:
step one, configuring each application software of a data processing system running on a Linux server according to a data processing requirement; wherein, each process is after each application software is loaded to the memory, and the configuration content after each application software is loaded comprises a process execution image name, a process description table name and process overtime time;
step two, establishing a shared memory;
setting and initializing a plurality of process information contents in the shared memory; wherein, each process information content comprises a process PID, a process execution image name, a process state, a scheduling processing strategy, a process description table name, process overtime time and process survival time;
presetting process PID parameters in a plurality of process information contents in a shared memory to-2, presetting a process state to 'an empty process', and presetting a scheduling processing strategy to 'maintain';
step four, writing the configuration information of each application software in the step one into the shared memory in sequence, then setting the process state of the process corresponding to each application software as 'to be built', and setting the scheduling processing strategy as 'starting';
step five, starting each application software, and updating PID parameters of the corresponding processes of the shared memory;
step six, when the process corresponding to each application software runs, updating the survival time parameter of the process corresponding to the shared memory at regular time;
step seven, reading the information of each process of the shared memory at regular time, and updating or maintaining the state of each process of the shared memory according to the judgment of the state of the process, the PID parameter and the survival time information;
step eight, stopping or restarting any application software.
The shared memory-based Linux server multi-application process scheduling method is characterized in that: and step five, starting each application software, and updating the PID parameters of the corresponding processes of the shared memory, wherein the specific process is as follows:
step 501, setting the process state in each process shared memory as 'ready' and setting the scheduling processing strategy as 'maintenance';
step 502, copying executable mapping files of each application software from a storage directory of the application software to other directories of a server, renaming the executable mapping files, wherein the renamed files are called software copies, and the names of the software copies are consistent with the names of processes in a shared memory;
step 503, running the software copy by calling an execl interface function provided by a Linux operating system in the server, and updating the process PID corresponding to each application software to the process PID parameter in the shared memory after each application software is successfully started.
The shared memory-based Linux server multi-application process scheduling method is characterized in that: and step six, the process corresponding to each application software comprises a timer thread when running, and the survival time information of each process is acquired every set time when each process runs and is written into the survival time parameter of the process corresponding to the shared memory.
The shared memory-based Linux server multi-application process scheduling method is characterized in that: and step seven, periodically reading the process information of the shared memory, and updating or maintaining the process state of the shared memory according to the judgment of the process state, the PID parameter and the survival time information, wherein the specific process comprises the following steps:
step 701, judging whether any process state of the shared memory is an 'empty process' or a 'to-be-built', if so, executing step 702; otherwise, go to step 703;
step 702, maintaining the process state in the shared memory unchanged;
step 703, judging whether the process PID of the process exists in the operating system of the Linux server, if so, executing step 704; otherwise, go to step 705;
step 704, if the survival time of the process is continuously changed, or if the survival time of the process is not changed any more and the duration time does not reach the process timeout time, updating the process state to "normal";
if the survival time does not change any more and the duration reaches the process timeout time, updating the process state into 'abnormal no response';
step 705, the process state is updated to "Exit".
The shared memory-based Linux server multi-application process scheduling method is characterized in that: stopping or restarting any application software in the step eight, wherein the specific process is as follows:
the stop of any application software is as follows:
step 801, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'stop', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, executing step 802 and step 803; otherwise, go to step 803;
step 802, calling a kill method provided by an operating system of the Linux server to kill the process so as to stop the application software;
step 803, setting the process state of the process in the shared memory as "stop" and the scheduling processing policy as "maintain";
restart of any application software, as follows:
step 80A, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'restart', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, sequentially executing step 80B and step 80C; otherwise, go to step 80C;
step 80B, calling a kill method provided by an operating system of the Linux server to kill the process;
and step 80C, restarting the application software according to the method described in step 501, step 502 and step 503.
Compared with the prior art, the invention has the following advantages:
1. the invention describes the process information of all application programs on the Linux server by using a data structure and writes the process information into the created system process shared memory, finishes the start-stop management of the processes of all the application programs according to the process scheduling processing strategy and can update the survival time and the process state of the processes at regular time. Therefore, the method provided by the invention is simple and has strong universality.
2. The invention realizes centralized and unified monitoring of large-scale application processes and improves the reliability of the data processing system. The technology of automatically creating the software copy in the process starting process can effectively prevent the application software version upgrading from influencing the running process.
3. The method provided by the invention can realize independent treatment of the abnormal process, namely stop or restart treatment of a single or a plurality of abnormal processes, and is realized without restarting the whole system, thereby improving the continuous service capability of the system.
4. The shared memory mechanism adopted by the invention stores the state information of all the managed processes, and can thoroughly solve the problem that a large amount of uncontrolled orphan processes are generated after the abnormal exit of the management process.
5. The invention updates the process survival time to the shared memory in real time, fully utilizes the advantage of high communication efficiency of the shared memory, and reduces the consumption of process management on the computing resources of the server.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
FIG. 1 is a block diagram of the process flow of the present invention.
FIG. 2 is a diagram illustrating information of multiple application processes sharing a memory according to the present invention.
Detailed Description
As shown in fig. 1 and fig. 2, the method for scheduling multiple application processes of a Linux server based on a shared memory according to the present invention includes the following steps:
step one, configuring each application software of a data processing system running on a Linux server according to a data processing requirement; wherein, each process is after each application software is loaded to the memory, and the configuration content after each application software is loaded comprises a process execution image name, a process description table name and process overtime time;
step two, establishing a shared memory;
setting and initializing a plurality of process information contents in the shared memory; wherein, each process information content comprises a process PID, a process execution image name, a process state, a scheduling processing strategy, a process description table name, process overtime time and process survival time;
presetting process PID parameters in a plurality of process information contents in a shared memory to-2, presetting a process state to 'an empty process', and presetting a scheduling processing strategy to 'maintain';
step four, writing the configuration information of each application software in the step one into the shared memory in sequence, then setting the process state of the process corresponding to each application software as 'to be built', and setting the scheduling processing strategy as 'starting';
step five, starting each application software, and updating PID parameters of the corresponding processes of the shared memory;
step six, when the process corresponding to each application software runs, updating the survival time parameter of the process corresponding to the shared memory at regular time;
step seven, reading the information of each process of the shared memory at regular time, and updating or maintaining the state of each process of the shared memory according to the judgment of the state of the process, the PID parameter and the survival time information;
step eight, stopping or restarting any application software.
In this embodiment, in the fifth step, each application software is started, and the PID parameter of the process corresponding to the shared memory is updated, which includes the following specific processes:
step 501, setting the process state in each process shared memory as 'ready' and setting the scheduling processing strategy as 'maintenance';
step 502, copying the executable mapping file of each application software from the storage directory to other directories of the server, renaming the executable mapping file, wherein the renamed file is called a software copy, and the name of the software copy is consistent with the process name in the shared memory;
step 503, running the software copy by calling an execl interface function provided by a Linux operating system in the server, and updating the process PID corresponding to each application software to the process PID parameter of the shared memory after each application software is successfully started.
In this embodiment, the process running corresponding to each application software in the sixth step includes a timer thread, and the survival time information of each process is obtained every set time when each process runs, and is written into the survival time parameter of the process corresponding to the shared memory.
In this embodiment, in the seventh step, information of each process in the shared memory is periodically read, and the state of each process in the shared memory is updated or maintained according to the judgment of the process state, the PID parameter, and the survival time information, and the specific process is as follows:
step 701, judging whether any process state of the shared memory is an 'empty process' or a 'to-be-built', if so, executing step 702; otherwise, go to step 703;
step 702, maintaining the process status in the shared memory;
step 703, judging whether the process PID of the process exists in the operating system of the Linux server, if so, executing step 704; otherwise, go to step 705;
step 704, if the survival time of the process is continuously changed, or if the survival time of the process is not changed and the duration time does not reach the process timeout time, updating the process state to "normal";
if the survival time does not change any more and the duration reaches the process timeout time, updating the process state into 'abnormal no response';
step 705, the process state is updated to "exception exit".
In this embodiment, the stopping or restarting of any application software in step eight includes the following specific processes:
the shutdown of any application software is as follows:
step 801, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'stop', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, executing step 802 and step 803; otherwise, go to step 803;
step 802, calling a kill method provided by an operating system of the Linux server to kill the process so as to stop the application software;
step 803, setting the process state of the process in the shared memory as "stop" and the scheduling processing policy as "maintain";
restarting of any application software as follows:
step 80A, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'restart', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, sequentially executing step 80B and step 80C; otherwise, go to step 80C;
step 80B, calling a kill method provided by an operating system of the Linux server to kill the process;
and step 80C, restarting the application software according to the method described in step 501, step 502 and step 503.
In this embodiment, it should be noted that, when the processes corresponding to the application software access the shared memory together, mutual exclusion and synchronization of reading and writing the same shared memory by multiple processes need to be achieved by acquiring or releasing the semaphore.
In this embodiment, the set time is set to 1 second.
In this embodiment, it should be noted that:
"null process": when the shared memory is created, a process state field is initialized to be set as a 'null process' by default;
"to be built": when the process information of the newly added application software is written into the shared memory for the first time, setting the process state field of the shared memory as 'to be established';
"ready": for the process with the scheduling processing strategy of 'start', the state field of the process of the shared memory is set to 'ready' after the scheduling processing strategy is executed;
"stop": for the process whose scheduling processing strategy is "stop", when the process normally exits after executing the scheduling processing strategy, the process state is set to "stop".
In this embodiment, it should be noted that the "ready" state of the process may be converted into "normal", "abnormal no response", or "abnormal exit" under certain conditions.
In this embodiment, each process information content includes a process PID, a process execution image name ProcEXName, a process name ProcName, a process state Status, a scheduling processing policy Stategy, a process description table name DescName, a process timeout time ExitTime, and a process survival time LiveTime.
In this embodiment, the DescName name stores a process configuration file name, where the process configuration file describes various variable parameters read when each process starts running, such as a network transceiving address, a data processing result file name and path, a running log file name and path, and a physical quantity analysis method.
In this embodiment, the scheduling processing policy Stategy has "maintain", "start", "stop", and "restart".
In this embodiment, it should be noted that:
"start up": when application software is started for the first time, setting a process scheduling processing strategy in a shared memory corresponding to the software as 'starting';
"stop": when the application software needs to be stopped, setting a process scheduling processing strategy in a shared memory corresponding to the software to be stopped;
and (3) restarting: after the process execution image or the process configuration file is updated, the process needs to be stopped firstly and then started to take effect, and at the moment, the process scheduling processing strategy is set to be 'restart';
"maintain": the process is in a waiting state after executing the scheduling processing strategy, so that the process is prevented from continuously executing the starting, stopping or restarting.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and any simple modifications, changes and equivalent structural changes made to the above embodiment according to the technical essence of the present invention still fall within the protection scope of the technical solution of the present invention.
Claims (1)
1. A Linux server multi-application process scheduling method based on a shared memory is characterized by comprising the following steps:
step one, configuring each application software of a data processing system running on a Linux server according to a data processing requirement; wherein, each process is after each application software is loaded to the memory, and the configuration content after each application software is loaded comprises a process execution image name, a process description table name and process overtime time;
step two, establishing a shared memory;
setting and initializing a plurality of process information contents in the shared memory; wherein, each process information content comprises a process PID, a process execution image name, a process state, a scheduling processing strategy, a process description table name, process overtime and process survival time;
presetting process PID parameters in a plurality of process information contents in a shared memory to-2, presetting a process state to 'an empty process', and presetting a scheduling processing strategy to 'maintain';
step four, writing the configuration information of each application software in the step one into the shared memory in sequence, then setting the process state of the process corresponding to each application software as 'to be built', and setting the scheduling processing strategy as 'starting';
step five, starting each application software, and updating PID parameters of the corresponding processes of the shared memory;
step six, when the process corresponding to each application software runs, updating the survival time parameter of the process corresponding to the shared memory at regular time;
step seven, reading the information of each process of the shared memory at regular time, and updating or maintaining the state of each process of the shared memory according to the judgment of the state of the process, the PID parameter and the survival time information;
step eight, stopping or restarting any application software;
and step five, starting each application software, and updating the PID parameters of the corresponding processes of the shared memory, wherein the specific process is as follows:
step 501, setting the process state in each process shared memory as 'ready' and setting the scheduling processing strategy as 'maintenance';
step 502, copying the executable mapping file of each application software from the storage directory to other directories of the server, renaming the executable mapping file, wherein the renamed file is called a software copy, and the name of the software copy is consistent with the process name in the shared memory;
step 503, running the software copy by calling an execl interface function provided by a Linux operating system in the server, and updating the process PID corresponding to each application software into the process PID parameter of the shared memory after each application software is successfully started;
step six, the process corresponding to each application software comprises a timer thread when running, and the survival time information of each process is obtained every set time when each process runs and is written into the survival time parameter of the process corresponding to the shared memory;
and step seven, periodically reading the process information of the shared memory, and updating or maintaining the process state of the shared memory according to the judgment of the process state, the PID parameter and the survival time information, wherein the specific process comprises the following steps:
step 701, judging whether any process state of the shared memory is an 'empty process' or a 'to-be-built', if so, executing step 702; otherwise, go to step 703;
step 702, maintaining the process state in the shared memory unchanged;
step 703, judging whether the process PID of the process exists in the operating system of the Linux server, if so, executing step 704; otherwise, go to step 705;
step 704, if the survival time of the process is continuously changed, or if the survival time of the process is not changed any more and the duration time does not reach the process timeout time, updating the process state to "normal";
if the survival time does not change any more and the duration reaches the process timeout time, updating the process state into 'abnormal no response';
step 705, updating the process state to "abnormal exit";
stopping or restarting any application software in the step eight, wherein the specific process is as follows:
the stop of any application software is as follows:
step 801, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'stop', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, executing step 802 and step 803; otherwise, go to step 803;
step 802, calling a kill method provided by an operating system of the Linux server to kill the process so as to stop the application software;
step 803, setting the process state of the process in the shared memory as "stop" and the scheduling processing policy as "maintain";
restart of any application software, as follows:
step 80A, setting a process information scheduling processing strategy corresponding to the application software in the shared memory as 'restart', judging whether a process PID of the process exists in an operating system of a Linux server, and if so, sequentially executing step 80B and step 80C; otherwise, go to step 80C;
step 80B, calling a kill method provided by an operating system of the Linux server to kill the process;
and step 80C, restarting the application software according to the method described in step 501, step 502 and step 503.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211652082.9A CN115629827B (en) | 2022-12-22 | 2022-12-22 | Linux server multi-application process scheduling method based on shared memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211652082.9A CN115629827B (en) | 2022-12-22 | 2022-12-22 | Linux server multi-application process scheduling method based on shared memory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115629827A CN115629827A (en) | 2023-01-20 |
| CN115629827B true CN115629827B (en) | 2023-03-10 |
Family
ID=84910113
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211652082.9A Active CN115629827B (en) | 2022-12-22 | 2022-12-22 | Linux server multi-application process scheduling method based on shared memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115629827B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5553235A (en) * | 1992-10-23 | 1996-09-03 | International Business Machines Corporation | System and method for maintaining performance data in a data processing system |
| US6021438A (en) * | 1997-06-18 | 2000-02-01 | Wyatt River Software, Inc. | License management system using daemons and aliasing |
| CN101299677A (en) * | 2008-04-30 | 2008-11-05 | 中兴通讯股份有限公司 | Method for sharing unity service course by multiple courses |
| CN108984317A (en) * | 2018-06-21 | 2018-12-11 | 北京奇虎科技有限公司 | The implementation method and device of interprocess communication IPC |
| CN113407414A (en) * | 2021-06-24 | 2021-09-17 | 厦门科灿信息技术有限公司 | Program operation monitoring method, device, terminal and storage medium |
| CN114817075A (en) * | 2022-06-21 | 2022-07-29 | 远江盛邦（北京）网络安全科技股份有限公司 | Inter-process heartbeat detection method and device |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9367462B2 (en) * | 2009-12-29 | 2016-06-14 | Empire Technology Development Llc | Shared memories for energy efficient multi-core processors |
| EP2764440B1 (en) * | 2011-10-07 | 2021-02-17 | Hitachi, Ltd. | Storage system |
| JP2013149108A (en) * | 2012-01-19 | 2013-08-01 | Canon Inc | Information processing apparatus, control method therefor, and program |
| CN105204936A (en) * | 2015-09-30 | 2015-12-30 | 山东乾云启创信息科技有限公司 | Universal resident process management platform and method |
| US11036494B2 (en) * | 2019-03-22 | 2021-06-15 | International Business Machines Corporation | Embedded application upgrade |
| CN110119377B (en) * | 2019-04-24 | 2021-01-15 | 华中科技大学 | Docker container-oriented online migration system implementation and optimization method |
-
2022
- 2022-12-22 CN CN202211652082.9A patent/CN115629827B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5553235A (en) * | 1992-10-23 | 1996-09-03 | International Business Machines Corporation | System and method for maintaining performance data in a data processing system |
| US6021438A (en) * | 1997-06-18 | 2000-02-01 | Wyatt River Software, Inc. | License management system using daemons and aliasing |
| CN101299677A (en) * | 2008-04-30 | 2008-11-05 | 中兴通讯股份有限公司 | Method for sharing unity service course by multiple courses |
| CN108984317A (en) * | 2018-06-21 | 2018-12-11 | 北京奇虎科技有限公司 | The implementation method and device of interprocess communication IPC |
| CN113407414A (en) * | 2021-06-24 | 2021-09-17 | 厦门科灿信息技术有限公司 | Program operation monitoring method, device, terminal and storage medium |
| CN114817075A (en) * | 2022-06-21 | 2022-07-29 | 远江盛邦（北京）网络安全科技股份有限公司 | Inter-process heartbeat detection method and device |
Non-Patent Citations (4)
| Title |
|---|
| Junsung Yook et al..《Modeling Cache and Application Performance on Modern Shared Memory Multiprocessors》.2021,全文. * |
| 杨超 ; 徐如志 ; 杨峰 ; .基于消息队列的多进程数据处理系统.(第13期),全文. * |
| 赵明富,李太福,吴军,罗渝微.嵌入式Linux操作系统的实时化研究.(第03期),全文. * |
| 郭建军 ; .Radius服务端中的共享内存研究.(第01期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115629827A (en) | 2023-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9996401B2 (en) | Task processing method and virtual machine | |
| US10069943B2 (en) | Query dispatch and execution architecture | |
| CN112667362B (en) | Method and system for deploying Kubernetes virtual machine cluster on Kubernetes | |
| CN112000445A (en) | Distributed task scheduling method and system | |
| US20100250908A1 (en) | Concurrent Patching of Operating Systems | |
| CN113569987A (en) | Model training method and device | |
| CN105700939A (en) | Method and system for multi-thread synchronization in distributed system | |
| CN110895487B (en) | Distributed task scheduling system | |
| WO2010070351A1 (en) | Method and device for routing messages to service instances using distribution policies | |
| CN111314212B (en) | API gateway based on Netty and plug-in mechanism and control method | |
| WO2009089746A1 (en) | Method, device and system for realizing task in cluster environment | |
| CN110895483A (en) | Task recovery method and device | |
| CN110895486B (en) | Distributed task scheduling system | |
| CN110895488A (en) | Task scheduling method and device | |
| CN111225007B (en) | Database connection method, device and system | |
| CN113485812B (en) | Partition parallel processing method and system based on large-data-volume task | |
| CN115629827B (en) | Linux server multi-application process scheduling method based on shared memory | |
| CN114064141A (en) | Middleware starting time optimization method and device and readable storage medium | |
| EP4443291A1 (en) | Cluster management method and device, and computing system | |
| CN111245872A (en) | Sequential message filtering and distributing platform and method | |
| US20080077925A1 (en) | Fault Tolerant System for Execution of Parallel Jobs | |
| CN111949687B (en) | Distributed database architecture based on shared memory and multiple processes and implementation method thereof | |
| US20180189080A1 (en) | System And Method For Reacquiring A Running Service After Restarting A Configurable Platform Instance | |
| US8010964B2 (en) | Methods for monitoring and managing processes | |
| JPH0916521A (en) | Parallel batch processing 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 |