CN111966472A - Process scheduling method and system for industrial real-time operating system - Google Patents
Process scheduling method and system for industrial real-time operating system Download PDFInfo
- Publication number
- CN111966472A CN111966472A CN202010632327.6A CN202010632327A CN111966472A CN 111966472 A CN111966472 A CN 111966472A CN 202010632327 A CN202010632327 A CN 202010632327A CN 111966472 A CN111966472 A CN 111966472A
- Authority
- CN
- China
- Prior art keywords
- data
- stack
- operating system
- segment
- file
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
-
- 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- 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/545—Interprogram communication where tasks reside in different layers, e.g. user- and kernel-space
Abstract
The invention discloses a process scheduling method and a system of an industrial real-time operating system.A pre-read file serving as a transfer is established in a proc file system between a user mode and a kernel mode of the operating system; and high-frequency use data with extremely high repeatability and similarity of the industrial real-time operating system is screened out through the data hit degree and stored in the pre-read file, so that each process can quickly read the data with the maximum data hit degree value from the pre-read file, the real-time performance of the operating system is improved by utilizing the characteristic of high data repeat degree in the operating environment of the industrial operating system, the delay of process scheduling is reduced, the data read-write complexity is reduced, and the overall operating efficiency of the system is improved.
Description
Technical Field
The invention relates to the field of operating systems and industrial real-time operating systems, in particular to a process scheduling method and system of an industrial real-time operating system.
Background
In an industrial control environment, because large data acquisition causes huge memory space and high communication real-time requirement, most of operations are mechanized operations of a production line in the industrial control environment, and the repeatability and the similarity between the operations are extremely high, the process scheduling rule of the current operating system cannot be well suitable for software and hardware resource control in an industrial application environment, is more complex than the traditional data read-write, and can cause the phenomena of blockage of industrial control equipment, I/O read-write overtime and the like; in a real-time system, a cross-process calling system structure is usually constructed through a multi-core system to reduce the problem of uncoordinated process scheduling; however, the inter-system cross-process mechanism may reduce the real-time performance and increase the delay of process scheduling.
Disclosure of Invention
The invention provides a process scheduling method and a system of an industrial real-time operating system.A pre-read file serving as a transfer is established in a proc file system between a user mode and a kernel mode of the operating system; and high-frequency use data with extremely high repeatability and similarity in an industrial real-time operating system are screened out through the data hit degree and stored in the pre-read file, so that each process can quickly read the data with the maximum data hit degree value from the pre-read file.
The invention aims to solve the problems and provides a process scheduling method and a process scheduling system of an industrial real-time operating system, which specifically comprise the following steps:
s100: creating a file in a proc file system of an operating system as a pre-read file;
s200: executing steps S300 and S400 when the operating system newly creates a process, and turning to step S500 when no newly created process exists;
s300: when the operating system creates a process, judging whether the process priority of the newly created process is larger than or equal to the average value of the process priorities of all the processes in the running state, if so, calculating the data hit degrees of the dynamically allocated memory segment in the stack of the newly created process and all the data in the pre-read file;
s400: if the data with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file, adding the data of the dynamically allocated memory segment in the stack of the newly created process into the data segment sequence of the pre-read file;
s500: starting from the process priorities of 0 to 31, the processes of the corresponding process priorities are executed, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
Further, in S100, when the pre-read file has no data, directly adding the data of the dynamically allocated memory segment in the stack of the newly created process to the data segment sequence of the pre-read file.
Further, in S100, the pre-read file includes a data segment sequence used for storing the dynamically allocated memory segment in the stack of the plurality of processes, and the data segment sequence is a queue of data composed of an order in which the data of the dynamically allocated memory segment in the stack of the process is added to the sequence.
Further, in S200, the process includes a BSS segment, a data segment, a code segment, a heap, and a stack; the BSS section is a memory area used for storing uninitialized global variables in a program; the data segment is a memory area used for storing initialized global variables in the program; the code segment refers to a memory area for storing program execution code. The size of this part of the area is determined before the program runs, and the memory area is usually read-only, and some architectures also allow the code segment to be writable, i.e. allow the program to be modified. It is also possible to include some read-only constant variables, such as string constants, etc., in the code segment.
Further, in S300, the stack of the process includes a heap and a stack, where the heap is used to store a memory segment that is dynamically allocated during the running of the process, and the size of the memory segment is not fixed and can be dynamically expanded or reduced; the stack is also called as a stack and is a local variable temporarily created by a user storage program, when a function is called, the parameter of the function is pressed into a process stack initiating the calling, and after the calling is finished, the return value of the function is stored back to the stack; the stack is particularly convenient for saving/restoring call sites due to the first-in-last-out feature of the stack.
Further, in S300, the value range of the process priority is [0,31 ]; smaller process priority values indicate higher process priorities, and larger process priority values indicate lower process priorities.
Further, in S300, the method for calculating the data hit levels of the data of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file includes:
s301: extracting a first N-bit binary number from data of a dynamically allocated memory segment in the stack of the process as a first comparison sequence; the value range of N is [50,1000 ];
s302: respectively extracting first N-bit binary numbers from each data in the pre-read file to serve as a plurality of second comparison sequences;
s303: calculating the data hit rates of the first and second comparison sequences;
the formula for calculating the data hit rate H is:
Further, in S400, the hit threshold is set to 0.5.
The invention also provides a process scheduling system of the industrial real-time operating system, which comprises the following steps: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the file pre-reading unit is used for creating a file in a proc file system of an operating system as a pre-reading file;
the process pre-reading unit is used for executing the process pre-selection unit and the data segment sequence unit when a process is newly created by the operating system, and switching to the process execution unit when no newly created process exists;
the process pre-selection unit is used for judging whether the process priority of the process is larger than or equal to the average value of the process priorities of all the processes in the running state when the operating system creates the process, and if so, calculating the data hit degrees of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file;
the data segment sequence unit is used for adding the data of the dynamically allocated memory segment in the stack of the process into the data segment sequence of the pre-read file if the data segment with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file;
and the process execution unit is used for starting processes with the corresponding process priorities from the process priorities of 0 to 31, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
The invention has the beneficial effects that: the invention discloses a process scheduling method of an industrial real-time operating system, which improves the real-time performance of the operating system, reduces the delay of process scheduling and the complexity of data reading and writing by utilizing the characteristic of higher data repetition rate in the operating environment of the industrial operating system, thereby improving the overall operating efficiency of the system.
Drawings
The above and other features of the present invention will become more apparent by describing in detail embodiments thereof with reference to the attached drawings in which like reference numerals designate the same or similar elements, it being apparent that the drawings in the following description are merely exemplary of the present invention and other drawings can be obtained by those skilled in the art without inventive effort, wherein:
FIG. 1 is a flow chart illustrating a process scheduling method of an industrial real-time operating system according to the present invention;
fig. 2 is a diagram illustrating a process scheduling system of an industrial real-time operating system according to an embodiment of the present invention.
Detailed Description
The conception, the specific structure and the technical effects of the present invention will be clearly and completely described in conjunction with the embodiments and the accompanying drawings to fully understand the objects, the schemes and the effects of the present invention. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Referring to fig. 1, a flow chart of a process scheduling method of an industrial real-time operating system according to the present invention is shown, and the method according to the embodiment of the present invention is described below with reference to fig. 1.
The invention provides a process scheduling method of an industrial real-time operating system, which specifically comprises the following steps:
s100: the kernel module creates a file in a proc file system of an operating system as a pre-read file; the proc file system is a virtual file system, and the proc file system can use the kernel space of an operating system to communicate with users;
s200: executing steps S300 and S400 when the operating system newly creates a process, and turning to step S500 when no newly created process exists;
s300: when an operating system creates a process, judging whether the process priority of the process is larger than or equal to the average value of the process priorities of all the processes in a running state, if so, calculating the data hit degree of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file;
s400: if the data segment with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file, adding the data of the dynamically allocated memory segment in the stack of the process into the data segment sequence of the pre-read file;
s500: starting from the process priorities of 0 to 31, the processes of the corresponding process priorities are executed, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
Further, in S100, when the pre-read file has no data, directly adding the data of the dynamically allocated memory segment in the stack of the newly created process to the data segment sequence of the pre-read file.
Further, in S100, the pre-read file includes a data segment sequence used for storing the dynamically allocated memory segment in the stack of the plurality of processes, and the data segment sequence is a queue of data composed of an order in which the data of the dynamically allocated memory segment in the stack of the process is added to the sequence.
Further, in S200, the process includes a BSS segment, a data segment, a code segment, a heap, and a stack; the BSS section is a memory area used for storing uninitialized global variables in a program; the data segment is a memory area used for storing initialized global variables in the program; the code segment refers to a memory area for storing program execution code. The size of this part of the area is determined before the program runs, and the memory area is usually read-only, and some architectures also allow the code segment to be writable, i.e. allow the program to be modified. It is also possible to include some read-only constant variables, such as string constants, etc., in the code segment.
Further, in S300, the stack of the process includes a heap and a stack, where the heap is used to store a memory segment that is dynamically allocated during the running of the process, and the size of the memory segment is not fixed and can be dynamically expanded or reduced; the stack is also called as a stack and is a local variable temporarily created by a user storage program, when a function is called, the parameter of the function is pressed into a process stack initiating the calling, and after the calling is finished, the return value of the function is stored back to the stack; the stack is particularly convenient for saving/restoring call sites due to the first-in-last-out feature of the stack.
Further, in S300, the value range of the process priority is [0,31 ]; smaller process priority values indicate higher process priorities, and larger process priority values indicate lower process priorities.
Further, in S300, the method for calculating the data hit levels of the data of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file includes:
s301: extracting a first N-bit binary number from data of a dynamically allocated memory segment in the stack of the process as a first comparison sequence; the value range of N is [50,1000 ];
s302: respectively extracting first N-bit binary numbers from each data in the pre-read file to serve as a plurality of second comparison sequences;
s303: calculating the data hit rates of the first and second comparison sequences;
the formula for calculating the data hit rate H is:
Further, in S400, the hit threshold is set to 0.5.
An embodiment of the present invention provides a process scheduling system of an industrial real-time operating system, as shown in fig. 2, which is a structure diagram of the process scheduling system of the industrial real-time operating system of the present invention, and the process scheduling system of the industrial real-time operating system of the embodiment includes: the system comprises a processor, a memory and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program to realize the steps in the embodiment of the process scheduling system of the industrial real-time operating system.
The system comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the file pre-reading unit is used for creating a file in a proc file system of an operating system as a pre-reading file;
the process pre-reading unit is used for executing the process pre-selection unit and the data segment sequence unit when a process is newly created by the operating system, and switching to the process execution unit when no newly created process exists;
the process pre-selection unit is used for judging whether the process priority of the process is larger than or equal to the average value of the process priorities of all the processes in the running state when the operating system creates the process, and if so, calculating the data hit degrees of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file;
the data segment sequence unit is used for adding the data of the dynamically allocated memory segment in the stack of the process into the data segment sequence of the pre-read file if the data segment with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file;
and the process execution unit is used for starting processes with the corresponding process priorities from the process priorities of 0 to 31, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
The process scheduling system of the industrial real-time operating system can be operated in computing equipment such as desktop computers, notebooks, palm computers and cloud servers. The system which can be operated by the process scheduling system of the industrial real-time operating system can comprise a processor and a memory. It will be understood by those skilled in the art that the examples are merely illustrative of a process scheduling system of an industrial real-time operating system and are not intended to be limiting, and may include more or less than all of the components, or some of the components in combination, or different components, for example, the process scheduling system of the industrial real-time operating system may also include input output devices, network access devices, buses, etc. The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like. The general purpose processor may be a microprocessor or the processor may be any conventional processor, etc., the processor is a control center of the process scheduling system running system of the industrial real-time operating system, and various interfaces and lines are used for connecting various parts of the process scheduling system running system of the whole industrial real-time operating system.
The memory may be used to store the computer programs and/or modules, and the processor may implement the various functions of the process scheduling system of the industrial real-time operating system by running or executing the computer programs and/or modules stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
While the present invention has been described in considerable detail and with particular reference to a few illustrative embodiments thereof, it is not intended to be limited to any such details or embodiments or any particular embodiments, but it is to be construed as effectively covering the intended scope of the invention by providing a broad, potential interpretation of such claims in view of the prior art with reference to the appended claims. Furthermore, the foregoing describes the invention in terms of embodiments foreseen by the inventor for which an enabling description was available, notwithstanding that insubstantial modifications of the invention, not presently foreseen, may nonetheless represent equivalent modifications thereto.
Claims (7)
1. A process scheduling method of an industrial real-time operating system is characterized by comprising the following steps:
s100: creating a file in a proc file system of an operating system as a pre-read file;
s200: executing steps S300 and S400 when the operating system newly creates a process, and turning to step S500 when no newly created process exists;
s300: when the operating system creates a process, judging whether the process priority of the newly created process is larger than or equal to the average value of the process priorities of all the processes in the running state, if so, calculating the data hit degrees of the dynamically allocated memory segment in the stack of the newly created process and all the data in the pre-read file;
s400: if the data with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file, adding the data of the dynamically allocated memory segment in the stack of the newly created process into the data segment sequence of the pre-read file;
s500: starting from the process priorities of 0 to 31, the processes of the corresponding process priorities are executed, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
2. The process scheduling method of the industrial real-time operating system according to claim 1, wherein in S100, the pre-read file includes a data segment sequence for storing the dynamically allocated memory segments in the stack of the plurality of processes, and the data segment sequence is a queue of data composed of data added to the sequence according to the order in which the data of the dynamically allocated memory segments in the stack of the processes is added to the sequence.
3. The method for scheduling process of industrial real-time operating system according to claim 1, wherein in S200, the process comprises BSS segment, data segment, code segment, heap, stack; the BSS section is a memory area used for storing uninitialized global variables in a program; the data segment is a memory area used for storing initialized global variables in the program; the code segment refers to a memory area for storing program execution code.
4. The method according to claim 1, wherein in S300, the stack of the process includes a heap and a stack, wherein the heap is a memory segment used for storing the dynamic allocation of the process during running, and the size of the memory segment is not fixed and can be expanded or reduced dynamically; the stack is also called a stack, and is a local variable temporarily created by a user storage program, when a function is called, the parameter of the function is pressed into a process stack initiating the call, and after the call is finished, the return value of the function is also stored back into the stack.
5. The method according to claim 1, wherein in S300, the value range of the process priority is [0,31 ]; smaller process priority values indicate higher process priorities, and larger process priority values indicate lower process priorities.
6. The method according to claim 1, wherein in S300, the method for calculating the data hit rates of the data in the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file comprises:
s301: extracting a first N-bit binary number from data of a dynamically allocated memory segment in the stack of the process as a first comparison sequence; the value range of N is [50,1000 ];
s302: respectively extracting first N-bit binary numbers from each data in the pre-read file to serve as a plurality of second comparison sequences;
s303: calculating the data hit rates of the first and second comparison sequences;
the formula for calculating the data hit rate H is:
7. A process scheduling system for an industrial real-time operating system, the system comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the file pre-reading unit is used for creating a file in a proc file system of an operating system as a pre-reading file;
the process pre-reading unit is used for executing the process pre-selection unit and the data segment sequence unit when a process is newly created by the operating system, and switching to the process execution unit when no newly created process exists;
the process pre-selection unit is used for judging whether the process priority of the process is larger than or equal to the average value of the process priorities of all the processes in the running state when the operating system creates the process, and if so, calculating the data hit degrees of the dynamically allocated memory segment in the stack of the process and all the data in the pre-read file;
the data segment sequence unit is used for adding the data of the dynamically allocated memory segment in the stack of the process into the data segment sequence of the pre-read file if the data segment with the data hit degree larger than or equal to the hit threshold does not exist in the pre-read file;
and the process execution unit is used for starting processes with the corresponding process priorities from the process priorities of 0 to 31, and each process reads the data with the maximum value of the process and the data hit degree of the pre-read file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010632327.6A CN111966472B (en) | 2020-07-02 | 2020-07-02 | Process scheduling method and system of industrial real-time operating system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010632327.6A CN111966472B (en) | 2020-07-02 | 2020-07-02 | Process scheduling method and system of industrial real-time operating system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111966472A true CN111966472A (en) | 2020-11-20 |
| CN111966472B CN111966472B (en) | 2023-09-26 |
Family
ID=73361525
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010632327.6A Active CN111966472B (en) | 2020-07-02 | 2020-07-02 | Process scheduling method and system of industrial real-time operating system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111966472B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112783652A (en) * | 2021-01-25 | 2021-05-11 | 珠海亿智电子科技有限公司 | Method, device and equipment for acquiring running state of current task and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060112390A1 (en) * | 2004-11-24 | 2006-05-25 | Yoshiyuki Hamaoka | Systems and methods for performing real-time processing using multiple processors |
| CN101226487A (en) * | 2008-01-30 | 2008-07-23 | 中国船舶重工集团公司第七〇九研究所 | Method for implementing inner core level thread library based on built-in Linux operating system |
| CN101251810A (en) * | 2008-03-11 | 2008-08-27 | 浙江大学 | Method for optimizing embedded type operating system process scheduling based on SPM |
| CN101273335A (en) * | 2005-09-26 | 2008-09-24 | 英特尔公司 | Scheduling optimizations for user-level threads |
| CN101317156A (en) * | 2005-11-29 | 2008-12-03 | 英特尔公司 | Compiler-based scheduling optimizations for user-level threads |
| CN101770396A (en) * | 2008-12-29 | 2010-07-07 | 鸿富锦精密工业（深圳）有限公司 | Method and device for erasing DMI data under Linux system |
| CN101894045A (en) * | 2010-06-18 | 2010-11-24 | 阳坚 | Real-time Linux operating system |
| CN102681889A (en) * | 2012-04-27 | 2012-09-19 | 电子科技大学 | Scheduling method of cloud computing open platform |
| CN103902359A (en) * | 2014-03-31 | 2014-07-02 | 深圳创维－Rgb电子有限公司 | Android based system memory optimizing and application scheduling method and system |
| CN104038314A (en) * | 2014-05-09 | 2014-09-10 | 中煤电气有限公司 | Novel safety-monitoring networking real-time dynamic data transmission system and method |
| CN107291619A (en) * | 2017-06-21 | 2017-10-24 | 北京奇虎科技有限公司 | EMS memory occupation analysis method and device |
| CN107704363A (en) * | 2017-09-28 | 2018-02-16 | 努比亚技术有限公司 | Freeze screen monitoring method, mobile terminal and computer-readable recording medium |
| CN109840137A (en) * | 2017-11-28 | 2019-06-04 | 大唐移动通信设备有限公司 | A kind of operating system transplantation method and apparatus |
-
2020
- 2020-07-02 CN CN202010632327.6A patent/CN111966472B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060112390A1 (en) * | 2004-11-24 | 2006-05-25 | Yoshiyuki Hamaoka | Systems and methods for performing real-time processing using multiple processors |
| CN101273335A (en) * | 2005-09-26 | 2008-09-24 | 英特尔公司 | Scheduling optimizations for user-level threads |
| CN101317156A (en) * | 2005-11-29 | 2008-12-03 | 英特尔公司 | Compiler-based scheduling optimizations for user-level threads |
| CN101226487A (en) * | 2008-01-30 | 2008-07-23 | 中国船舶重工集团公司第七〇九研究所 | Method for implementing inner core level thread library based on built-in Linux operating system |
| CN101251810A (en) * | 2008-03-11 | 2008-08-27 | 浙江大学 | Method for optimizing embedded type operating system process scheduling based on SPM |
| CN101770396A (en) * | 2008-12-29 | 2010-07-07 | 鸿富锦精密工业（深圳）有限公司 | Method and device for erasing DMI data under Linux system |
| CN101894045A (en) * | 2010-06-18 | 2010-11-24 | 阳坚 | Real-time Linux operating system |
| CN102681889A (en) * | 2012-04-27 | 2012-09-19 | 电子科技大学 | Scheduling method of cloud computing open platform |
| CN103902359A (en) * | 2014-03-31 | 2014-07-02 | 深圳创维－Rgb电子有限公司 | Android based system memory optimizing and application scheduling method and system |
| CN104038314A (en) * | 2014-05-09 | 2014-09-10 | 中煤电气有限公司 | Novel safety-monitoring networking real-time dynamic data transmission system and method |
| CN107291619A (en) * | 2017-06-21 | 2017-10-24 | 北京奇虎科技有限公司 | EMS memory occupation analysis method and device |
| CN107704363A (en) * | 2017-09-28 | 2018-02-16 | 努比亚技术有限公司 | Freeze screen monitoring method, mobile terminal and computer-readable recording medium |
| CN109840137A (en) * | 2017-11-28 | 2019-06-04 | 大唐移动通信设备有限公司 | A kind of operating system transplantation method and apparatus |
Non-Patent Citations (7)
| Title |
|---|
| MENGXUE WEI等: ""Fault-tolerant scheduling of real-time tasks on heterogeneous systems"", 《2017 12TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA)》 * |
| MOHAMMAD HASANZADEH MOFRA等: ""Service level agreement based adaptive Grid superscheduling"", 《FUTURE GENERATION COMPUTER SYSTEMS》 * |
| 孙涛: ""面向动态异构众核处理器的任务调度研究"", 《中国博士学位论文全文数据库信息科技辑》 * |
| 张斌: ""Linux系统进程调度策略研究"", 《中国硕士学位论文全文数据库信息科技辑》 * |
| 张旭;顾乃杰;苏俊杰;: "一种Linux用户态实时多任务调度框架", 中国科学技术大学学报, no. 08 * |
| 沈东黎;方小卫;: "CRTX实时操作系统", 计算机研究与发展, no. 04 * |
| 王玉红;: "SCO UNIX 5.05进程管理的实现", 赤峰学院学报(自然科学版), no. 05 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112783652A (en) * | 2021-01-25 | 2021-05-11 | 珠海亿智电子科技有限公司 | Method, device and equipment for acquiring running state of current task and storage medium |
| CN112783652B (en) * | 2021-01-25 | 2024-03-12 | 珠海亿智电子科技有限公司 | Method, device, equipment and storage medium for acquiring running state of current task |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111966472B (en) | 2023-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10628169B2 (en) | Method of implementing magnetic random access memory (MRAM) for mobile system-on-chip boot | |
| US10884744B2 (en) | System and method of loop vectorization by compressing indices and data elements from iterations based on a control mask | |
| KR101583002B1 (en) | Computing system booting method and code/data pinning method thereof | |
| CN110764906B (en) | Memory recovery processing method and device, electronic equipment and storage medium | |
| CN110765031B (en) | Data storage method and device, mobile terminal and storage medium | |
| US10007605B2 (en) | Hardware-based array compression | |
| CN110941395A (en) | Dynamic random access memory, memory management method, system and storage medium | |
| KR20210017264A (en) | Memory system and operating method thereof | |
| TWI634421B (en) | Electronic apparatus for data access and data access method therefor | |
| CN111966472B (en) | Process scheduling method and system of industrial real-time operating system | |
| CN110263010B (en) | Automatic updating method and device for cache file | |
| CN110674086A (en) | Data merging method and device, electronic equipment and storage medium | |
| CN108804533B (en) | Heterogeneous big data information filtering method and device | |
| US11354130B1 (en) | Efficient race-condition detection | |
| CN112286678A (en) | Optimization method and system for accelerating storage read-write data input and output | |
| CN113490954A (en) | Neural network, operation method, and program | |
| CN111580831A (en) | Method and device for improving code running efficiency, computer equipment and storage medium | |
| CN111258733A (en) | Embedded OS task scheduling method and device, terminal equipment and storage medium | |
| CN111562983A (en) | Memory optimization method and device, electronic equipment and storage medium | |
| US20220318604A1 (en) | Sparse machine learning acceleration | |
| CN111192063A (en) | Online customer service queuing processing method and device and electronic equipment | |
| US20230064547A1 (en) | Reducing call stack usage for future object completions | |
| US20100217941A1 (en) | Improving the efficiency of files sever requests in a computing device | |
| CN111538589B (en) | Operation optimization method, device, terminal and medium for embedded OS thread blocking queue | |
| US20240119017A1 (en) | Bridge control chip and associated signal processing method |
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 |