CN110347485A - The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority - Google Patents
The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority Download PDFInfo
- Publication number
- CN110347485A CN110347485A CN201910586624.9A CN201910586624A CN110347485A CN 110347485 A CN110347485 A CN 110347485A CN 201910586624 A CN201910586624 A CN 201910586624A CN 110347485 A CN110347485 A CN 110347485A
- Authority
- CN
- China
- Prior art keywords
- vcpu
- priority
- queue
- subqueue
- ready queue
- 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.)
- Pending
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
-
- 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
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
Abstract
The present invention discloses a kind of multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority, when for having run various partition operating systems on the multilevel security OS based on MILS framework, real time partitioned the problem of needing to guarantee its hard real-time, the multiple physical cpus of the present invention share the same ready queue, priority used by ready queue is to distribute to the fixed priority of each VCPU, fixed priority can value range be 0 arrive N-1, according to priority can value range, ready queue is divided into N number of subqueue, each subqueue represents a priority, ready queue is arranged from small to large according to the size of subqueue numerical priority value, i.e. numerical value is smaller, indicate that its priority is higher, then closer to the head of the queue of ready queue；The fixed priority of all VCPU in each subqueue is equal, is ranked up according to its time for reaching ready queue, ensure that the real-time task in hard real time subregion can be timely completed.
Description
Technical field
The invention belongs to secure operating system field, in particular to a kind of multilevel security OS of MILS framework is appointed
Business dispatching technique.
Background technique
Operating system is the computer program for managing and controlling computer hardware and software resource, is that operation other application is soft
The anti-danger of the basic software of part, operating system itself plays a crucial role the information security of user.With
For " WannaCry " virus, key problem, that is, local computer performs external trojan horse program, therefore, from operating system
Angle for, if operating system itself has forced symmetric centralization function, that is, the operation of external program can be effectively prevented,
Secondly, " WannaCry " virus can be propagated rapidly in campus network by file sharing network port, this shows between system
Communication path and dangerous, similar security threat can be effectively prevent by the trusted communications path mechanism of operating system.By
This is as it can be seen that the research to secure operating system is extremely urgent, multiple individual secure grade (Multiple Independent
Levels of Security and Safety, MILS) framework be by Idaho university, the U.S. Jim teach et al. proposed
A kind of multilevel security framework based on safe separating type kernel, the framework are flat in the same hardware based on isolated thought
The subregion of multiple isolated different safety class is constructed on platform, the data between subregion are completely isolated, and each subregion can only be certainly
Run in oneself address space, and the communication between subregion is uniformly controlled by separation kernel, the framework at present by
As the effective means of the high trusted operating system of building, and adopted by the military systems of multiple countries such as the U.S. and Britain
With.
In order to improve the equipment response speed of " client " operating system, the multilevel security OS under MILS framework is studied
Dispatching algorithm be of great significance.
Summary of the invention
In order to solve the above technical problems, the present invention proposes a kind of multi-level fusion of multicore preemptive type based on fixed priority
Real-time scheduling method guarantees that the real-time task in hard real time subregion can be timely completed.
The technical solution adopted by the present invention are as follows: the multi-level fusion Real-Time Scheduling side of the multicore preemptive type based on fixed priority
Method, comprising:
S1, schedule level one: the dispatching algorithm of credible separation multicore preemptive type of the kernel based on fixed priority is to " client "
The VCPU of operating system is dispatched；
S2, second-level dispatching: scheduling of " client " operating system to itself task.
The dispatching algorithm of the multicore preemptive type based on fixed priority, specifically: multiple physical cpus are shared same
Ready queue, priority used by ready queue are to distribute to the fixed priority of each VCPU, fixed priority can
Value range is 0 to arrive N-1, according to priority can value range, ready queue is divided into N number of subqueue, each subqueue generation
One priority of table, ready queue are arranged from small to large according to the size of subqueue numerical priority value, i.e., numerical value is smaller, table
Show that its priority is higher, then closer to the head of the queue of ready queue；The fixed priority of all VCPU in each subqueue is equal,
It is ranked up according to its time for reaching ready queue.
The dispatching algorithm of the multicore preemptive type based on fixed priority realize process include it is following step by step:
Whether A1, the opportunity for first determining whether scheduling, i.e. judgement currently should switch VCPU, if do not switched, return is worked as
Preceding VCPU is continued to run, and otherwise, N number of subqueue of ready queue is successively traversed according to the sequence of priority from high to low, is found
The ready subqueue of first non-empty, and obtain the head of the queue VCPU of subqueue；
The priority of the VCPU obtained in A2, comparison step A1 and the priority for the VCPU being currently running, if worked as
The priority of preceding VCPU is higher, then returns to current VCPU and continue to run, and otherwise, obtains from deleting in step A1 in ready queue
VCPU, and return to the VCPU and run；
If A3, there is no VCPU to need to run on the physical cpu at this time, idle_vcpu is run, into suspend mode；Wherein,
Idle_vcpu is that a special VCPU then runs idle_vcpu as the VCPU that PCPU can be run without other.
Further include: interruption queue, the interruption injection mark both greater than 0 of all VCPU in interruption queue, when it has been handled
After all interrupt requests, then it is deleted from interruption queue, be inserted into ready queue.
Each VCPU distributes an interruption injection mark, interrupts the also untreated interruption of the VCPU of injection identification record and asks
The quantity asked when interrupting every time for VCPU injection, is then interrupted injection mark plus one, and after the completion of interrupt requests processing, then
It is interrupted injection mark and subtracts one.
Beneficial effects of the present invention: the present invention uses the level-one of the dispatching algorithm of the multicore preemptive type based on fixed priority
Dispatching algorithm focuses on the hard real time demand of single subregion, it is ensured that the real-time task in hard real time subregion can be timely completed；
On this basis, the invention also provides the dynamic dispatching algorithms based on device request, improve the response speed of equipment, to meet
The time limit demand of equipment response.
Detailed description of the invention
Fig. 1 is the general frame of the real-time two-level scheduler mechanism of the synthesis provided in an embodiment of the present invention based on MILS framework；
Fig. 2 is the ready queue of single PCPU provided in an embodiment of the present invention；
Fig. 3 is the dispatching algorithm flow chart of the multicore preemptive type provided in an embodiment of the present invention based on fixed priority；
Fig. 4 is interruption queue provided in an embodiment of the present invention and ready queue.
Specific embodiment
For convenient for those skilled in the art understand that technology contents of the invention, with reference to the accompanying drawing to the content of present invention into one
Step is illustrated.
In the multilevel security OS based on MILS framework, a variety of heterogeneous operating system can be run in subregion,
For example Windows, Linux, uC/OS, VxWorks etc., interior " client " operating system run of these subregions have respective
Business scheduler, therefore, VCPU (the Virtual Central of task dispatcher and credible separation kernel inside these subregions
Processing Unit) scheduler together constitutes the two-level scheduler of MILS.The real-time two-level scheduler of synthesis based on MILS framework
The general frame of mechanism is as shown in Figure 1, the main body that wherein participates in two-level scheduler is specifically included that and run in " client " operating system
Task task, " client " operating system task dispatcher and distribute to " client " operating system in subregion VCPU and
The VCPU scheduler of credible separation kernel.
As shown in Figure 1, from the bottom up, the task in subregion will obtain physical cpu resource to run needs by as follows
Two-level scheduler process:
1) schedule level one: credible separation dispatching algorithm of the kernel based on earliest Deadline First is to " client " operating system
VCPU scheduling, scheduling basic unit be VCPU, the resource of competition is all PCPU (Physical of hardware platform
Central Processing Unit)；
2) second-level dispatching: the basic unit of scheduling of " client " operating system to itself task, scheduling is task, competition
Resource be then allocated to all VCPU of this subregion.
For the second-level dispatching device in each subregion, due to the difference of " client " operating system of operation, the tune taken
Degree algorithm is also different, for example O (1) dispatching algorithm and CFS (Completely Fair Schedule) of linux system are calculated
Method, RM (Rate Monotonic) dispatching algorithm of real time operating system and EDF (Earliest Deadline First) scheduling
Algorithm etc., the uses of these dispatching algorithms depend on the different application demand of built-in system, simultaneously with the relationship of MILS framework itself
It is not close, therefore, in multi-level fusion Real-Time Scheduling mechanism of the invention, mainly from the angle of the schedule level one of credible separation kernel
Degree goes to consider.
In the credible separation kernel of MILS framework, the purpose of schedule level one device is, according to certain dispatching algorithm, from VCPU
A most suitable VCPU is picked out in ready queue, it is made to occupy PCPU resource.Dispatching algorithm here is answered according to different
Will be different with demand, as shown in Figure 1, the real-time two-level scheduler mechanism of synthesis in the present invention mainly provides: based on fixation
The dispatching algorithm of the multicore preemptive type of priority focuses on the hard real time demand of single subregion, it is ensured that in hard real time subregion
Real-time task can be timely completed.
When having run various partition operating systems on the multilevel security OS based on MILS framework, such as
Linux, windows, VxWorks etc., in this case, the real time partitioned needs of the real time operating systems such as operation VxWorks
Guarantee its hard real-time, in the dispatching algorithm of the multicore preemptive type based on fixed priority, multiple physical cpus share it is same just
Thread queue, priority used by ready queue are to distribute to the fixed priority of each VCPU, and fixed priority can use
Being worth range is 0 to N-1, and the schematic diagram of ready queue is as shown in Figure 2.According to priority can value range, ready queue divide
For N number of subqueue, each subqueue represents a priority, ready queue according to subqueue numerical priority value size from it is small to
It is arranged greatly, i.e., numerical value is smaller, indicates that its priority is higher, then in the head of the queue of ready queue, each subqueue
The fixed priority of all VCPU is equal, they are ranked up according to its time for reaching ready queue, to guarantee first first
Service.
As shown in figure 3, the multicore of the invention based on fixed priority can preemption scheduling algorithm in each triggering scheduling
When execution process it is as follows:
1) opportunity of scheduling is first determined whether, i.e. whether judgement currently should switch VCPU, if do not switched, return current
VCPU is continued to run, and otherwise, N number of subqueue of ready queue is successively traversed according to the sequence of priority from high to low, finds
The ready subqueue of one non-empty, and obtain the head of the queue VCPU of subqueue；
2) priority and the priority for the VCPU being currently running for comparing the VCPU obtained in 1), if current VCPU
Priority it is higher, then return to current VCPU and continue to run, otherwise, deleted from ready queue and obtain VCPU in 1), and returned
It returns the VCPU and runs；
3) if no VCPU needs to run on the PCPU at this time, idle_vcpu is run, into suspend mode.
On the multilevel security OS based on MILS framework, there is no device drives in credible separation kernel, therefore, when
When external equipment generates physical discontinuity, credible separation kernel then directlys adopt the mode for interrupting injection after capturing the interrupt requests
Interrupt requests are injected to the VCPU of corresponding subregion, if scheduler uses three kinds of dispatching algorithms of front, if the VCPU is just
It is running, then can directly carry out interrupt response, still, if the VCPU is not run, must wait until VCPU quilt next time
It just can be carried out interrupt response when scheduling, this has seriously affected the response speed of equipment.Therefore, the present invention is being based on round-robin
Dispatching algorithm on the basis of, provide a kind of aided algorithm that can satisfy device request response time requirement, i.e., based on setting
The dynamic dispatching algorithm of standby request.
The main thought of dynamic dispatching algorithm based on device request are as follows: in the base of the dispatching algorithm based on round-robin
On plinth, priority scheduling has the VCPU of " client " operating system of device request, if synchronization has multiple " clients " to operate system
System requires processing equipment request, then the VCPU of these " client " operating systems is scheduled according to former dispatching algorithm, to protect
Demonstrate,prove the real-time of zone devices response.
In order to which priority scheduling has the VCPU of device request, the dynamic dispatching algorithm based on device request is each VCPU distribution
One interruption injection mark, interrupts the injection identification record quantity of the also untreated interrupt requests of the VCPU, is every time
When VCPU injection is interrupted, then injection mark plus one are interrupted, and after the completion of interrupt requests processing, then interrupted injection mark
Subtract one.According to this mark, on the basis of the ready queue of other dispatching algorithms, additionally increases an interruption queue, interrupt
The interruption injection mark both greater than 0 of all VCPU in queue, after it has handled all interrupt requests, then by it from interruption
It is deleted in queue, is inserted into ready queue.
As shown in figure 4, the interruption injection mark irq_flag of all VCPU in interruption queue is both greater than 0, and ready team
The irq_flag of all VCPU in column is equal to 0, and interruption queue is all adjusted as priority used by ready queue for original
Spend the priority of algorithm.When the interrupt requests of some VCPU in interruption queue all have been processed, then insert it into ready
Queue, and when some VCPU in ready queue is by injection interrupt requests, then it is deleted from ready queue, is inserted into
Interruption queue.
Under normal conditions, when PCPU, which is triggered, to be dispatched, VCPU is preferentially selected from interruption queue, then considers further that ready team
VCPU in column, when having run real time partitioned in system, although the VCPU of non real-time subregion is in interruption queue,
It is that its priority still is below the real time partitioned VCPU in ready queue, therefore, generally speaking, when PCPU is scheduled
When, in interruption queue and belong to real-time/non-real time subregion VCPU priority, higher than in ready queue and belonging to reality
When/non real-time subregion VCPU, regardless of which queue VCPU is in, the priority of real time partitioned VCPU is unconditionally higher than non-
Real time partitioned VCPU.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.For ability
For the technical staff in domain, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made
Any modification, equivalent substitution, improvement and etc. should be included within scope of the presently claimed invention.
Claims (5)
1. the multi-level fusion real-time scheduling method of the multicore preemptive type based on fixed priority characterized by comprising
S1, schedule level one: the dispatching algorithm of credible separation multicore preemptive type of the kernel based on fixed priority operates " client "
The VCPU of system is dispatched；
S2, second-level dispatching: scheduling of " client " operating system to itself task.
2. the multi-level fusion real-time scheduling method of the multicore preemptive type according to claim 1 based on fixed priority,
It is characterized in that, the dispatching algorithm of the multicore preemptive type based on fixed priority, specifically: multiple physical cpus are shared same
A ready queue, priority used by ready queue are to distribute to the fixed priority of each VCPU, fixed priority
Can value range be 0 to arrive N-1, according to priority can value range, ready queue is divided into N number of subqueue, each subqueue
A priority is represented, ready queue is arranged from small to large according to the size of subqueue numerical priority value, i.e., numerical value is smaller,
Indicate that its priority is higher, then closer to the head of the queue of ready queue；The fixed priority phase of all VCPU in each subqueue
Deng, according to its reach ready queue time be ranked up.
3. the multi-level fusion real-time scheduling method of the multicore preemptive type according to claim 2 based on fixed priority,
Be characterized in that, the dispatching algorithm of the multicore preemptive type based on fixed priority realize process include it is following step by step:
Whether A1, the opportunity for first determining whether scheduling, i.e. judgement currently should switch VCPU, if do not switched, return current
VCPU is continued to run, and otherwise, N number of subqueue of ready queue is successively traversed according to the sequence of priority from high to low, finds
The ready subqueue of one non-empty, and obtain the head of the queue VCPU of subqueue；
The priority of the VCPU obtained in A2, comparison step A1 and the priority for the VCPU being currently running, if currently
The priority of VCPU is higher, then returns to current VCPU and continue to run, otherwise, from what is obtained in deletion step A1 in ready queue
VCPU, and return to the VCPU and run；
If A3, there is no VCPU to need to run on the physical cpu at this time, idle_vcpu is run, into suspend mode；Wherein,
Idle_vcpu is that a special VCPU then runs idle_vcpu as the VCPU that PCPU can be run without other.
4. the multi-level fusion real-time scheduling method according to claim 3 based on round-robin, which is characterized in that also wrap
Include: interruption queue, the interruption injection mark both greater than 0 of all VCPU in interruption queue are asked when it has handled all interruptions
After asking, then it is deleted from interruption queue, be inserted into ready queue.
5. the multi-level fusion real-time scheduling method according to claim 4 based on round-robin, which is characterized in that each
VCPU distributes an interruption injection mark, interrupts the injection identification record quantity of the also untreated interrupt requests of the VCPU, often
When the secondary injection interruption for VCPU, then injection mark plus one are interrupted, and after the completion of interrupt requests processing, then interrupted injection
Mark subtracts one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910586624.9A CN110347485A (en) | 2019-07-01 | 2019-07-01 | The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910586624.9A CN110347485A (en) | 2019-07-01 | 2019-07-01 | The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110347485A true CN110347485A (en) | 2019-10-18 |
Family
ID=68177518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910586624.9A Pending CN110347485A (en) | 2019-07-01 | 2019-07-01 | The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110347485A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111414626A (en) * | 2020-04-01 | 2020-07-14 | 中国人民解放军国防科技大学 | TEE extension-based real-time guaranteeing method and system |
| CN111506397A (en) * | 2020-01-21 | 2020-08-07 | 广东工业大学 | Monotonic rate priority scheduling method based on linux real-time operating system |
| CN111796921A (en) * | 2020-06-30 | 2020-10-20 | 西安微电子技术研究所 | Embedded multi-core operating system scheduling method, scheduling device, electronic equipment and storage medium |
| CN112596891A (en) * | 2021-03-03 | 2021-04-02 | 南京信息工程大学 | Multi-task management method combining time slice rotation with extended interruption |
| CN113726682A (en) * | 2021-08-30 | 2021-11-30 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limit strategy |
| CN114911539A (en) * | 2022-05-17 | 2022-08-16 | 武汉深之度科技有限公司 | Starting method of running system and computing equipment |
| CN115098430A (en) * | 2022-06-27 | 2022-09-23 | 西安电子科技大学 | Inter-core communication priority scheduling method based on AMP architecture |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101894047A (en) * | 2010-06-24 | 2010-11-24 | 北京航空航天大学 | Kernel virtual machine scheduling policy-based implementation method |
-
2019
- 2019-07-01 CN CN201910586624.9A patent/CN110347485A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101894047A (en) * | 2010-06-24 | 2010-11-24 | 北京航空航天大学 | Kernel virtual machine scheduling policy-based implementation method |
Non-Patent Citations (1)
| Title |
|---|
| 杨姗: "基于MILS架构多级安全操作系统的若干关键技术研究", 《中国优秀硕士学位论文全文数据库信息科技辑（月刊）》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111506397B (en) * | 2020-01-21 | 2023-04-28 | 广东工业大学 | Monotonic rate priority scheduling method based on linux real-time operating system |
| CN111506397A (en) * | 2020-01-21 | 2020-08-07 | 广东工业大学 | Monotonic rate priority scheduling method based on linux real-time operating system |
| CN111414626A (en) * | 2020-04-01 | 2020-07-14 | 中国人民解放军国防科技大学 | TEE extension-based real-time guaranteeing method and system |
| CN111414626B (en) * | 2020-04-01 | 2023-09-26 | 中国人民解放军国防科技大学 | Real-time guaranteeing method and system based on TEE expansion |
| CN111796921A (en) * | 2020-06-30 | 2020-10-20 | 西安微电子技术研究所 | Embedded multi-core operating system scheduling method, scheduling device, electronic equipment and storage medium |
| CN111796921B (en) * | 2020-06-30 | 2023-05-30 | 西安微电子技术研究所 | Scheduling method and scheduling device for embedded multi-core operating system, electronic equipment and storage medium |
| CN112596891A (en) * | 2021-03-03 | 2021-04-02 | 南京信息工程大学 | Multi-task management method combining time slice rotation with extended interruption |
| CN112596891B (en) * | 2021-03-03 | 2021-06-11 | 南京信息工程大学 | Multi-task management method combining time slice rotation with extended interruption |
| CN113726682A (en) * | 2021-08-30 | 2021-11-30 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limit strategy |
| CN113726682B (en) * | 2021-08-30 | 2024-05-31 | 北京天空卫士网络安全技术有限公司 | Data transmission method and device based on speed limiting strategy |
| CN114911539A (en) * | 2022-05-17 | 2022-08-16 | 武汉深之度科技有限公司 | Starting method of running system and computing equipment |
| CN114911539B (en) * | 2022-05-17 | 2024-05-14 | 武汉深之度科技有限公司 | Starting method of running system and computing equipment |
| CN115098430A (en) * | 2022-06-27 | 2022-09-23 | 西安电子科技大学 | Inter-core communication priority scheduling method based on AMP architecture |
| CN115098430B (en) * | 2022-06-27 | 2024-03-19 | 西安电子科技大学 | Inter-core communication priority scheduling method based on AMP architecture |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110347485A (en) | The multi-level fusion real-time scheduling method of multicore preemptive type based on fixed priority | |
| US7251815B2 (en) | Multiple virtual machines sharing processor and work queue in memory having program/dispatch functions for assigning and accessing work items while the virtual machine was not idle | |
| Thuel et al. | Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing | |
| Lakshmanan et al. | Coordinated task scheduling, allocation and synchronization on multiprocessors | |
| US5758184A (en) | System for performing asynchronous file operations requested by runnable threads by processing completion messages with different queue thread and checking for completion by runnable threads | |
| US5452452A (en) | System having integrated dispatcher for self scheduling processors to execute multiple types of processes | |
| Wieder et al. | Efficient partitioning of sporadic real-time tasks with shared resources and spin locks | |
| US9697041B2 (en) | Method for dynamic interrupt balanced mapping based on current scheduling states of VCPUs | |
| US20140373021A1 (en) | Assigning and Scheduling Threads for Multiple Prioritized Queues | |
| Al-bayati et al. | Enhanced partitioned scheduling of mixed-criticality systems on multicore platforms | |
| CN110321212A (en) | Multi-level fusion real-time scheduling method based on earliest Deadline First | |
| Kim et al. | vMPCP: A synchronization framework for multi-core virtual machines | |
| Behera et al. | A new dynamic round robin and SRTN algorithm with variable original time slice and intelligent time slice for soft real time systems | |
| Leyva-del-Foyo et al. | Integrated task and interrupt management for real-time systems | |
| CN110347507A (en) | Multi-level fusion real-time scheduling method based on round-robin | |
| Lehoczky et al. | Scheduling periodic and aperiodic tasks using the slack stealing algorithm | |
| McKenney | ‘Real time’vs.‘real fast’: How to choose? | |
| Rocha et al. | A QoS aware non-work-conserving disk scheduler | |
| Saranya et al. | Dynamic partitioning based scheduling of real-time tasks in multicore processors | |
| Horowitz | A run-time execution model for referential integrity maintenance | |
| Pathan | Unifying fixed-and dynamic-priority scheduling based on priority promotion and an improved ready queue management technique | |
| Parmer | The case for thread migration: Predictable IPC in a customizable and reliable OS | |
| Garg | Real-time linux kernel scheduler | |
| KR100848323B1 (en) | Method for enhancing real time response in embedded OS kernel | |
| Nosrati et al. | Task scheduling algorithms introduction |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20191018 |
|
| WD01 | Invention patent application deemed withdrawn after publication |