CN105988867B - Rate group scheduling method based on time-sharing partition operating system - Google Patents
Rate group scheduling method based on time-sharing partition operating system Download PDFInfo
- Publication number
- CN105988867B CN105988867B CN201510045296.3A CN201510045296A CN105988867B CN 105988867 B CN105988867 B CN 105988867B CN 201510045296 A CN201510045296 A CN 201510045296A CN 105988867 B CN105988867 B CN 105988867B
- Authority
- CN
- China
- Prior art keywords
- rate group
- tasks
- scheduling
- rate
- time
- 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
Landscapes
- Control By Computers (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention relates to a rate group scheduling algorithm based on a time-sharing partition operating system. The scheduling unit of the algorithm is a rate group, and the rate group has period and priority attributes. The period of the rate group is multiple of the main frame, and tasks with the same period are in the same rate group. The shorter periodic rate group has higher priority and any other rate group can be preempted. And scheduling the tasks of the rate group according to the requirement of the rate group period, and sequentially executing the running sequence of each task in the same rate group according to the registered sequence. Tasks registered to the rate group are divided into periodic tasks and background tasks, the periodic tasks are required to be completed in the period of the periodic tasks, and the background tasks are not required to be completed in the period of the corresponding rate group. Which rate group is scheduled is determined based on a frame count provided by the time-partitioned operating system. The algorithm meets the requirement of flight control application and provides a high-reliability and high-real-time task scheduling mechanism for the flight control tasks in the partitions.
Description
Technical Field
The invention relates to a rate group scheduling algorithm based on a time-sharing partition operating system.
Description of the background
At present, in the flight control field, a time-sharing partition operating system is mostly used for improving reliability, and a task scheduling algorithm in a partition based on the time-sharing partition operating system is required to be provided aiming at the characteristics of tasks in the flight control field.
Disclosure of Invention
The invention comprises the following specific functional contents:
(1) the rate set has period and priority attributes;
(2) the rate set has three states: a waiting state, a ready state and a running state;
(3) tasks registered in the rate group are divided into periodic tasks and background tasks;
(4) the rate group scheduling algorithm is realized through a time scheduling table mechanism and a virtual interrupt mechanism provided by a time-sharing partition operating system.
Detailed Description
1. The rate set having period and priority attributes
The rate set is run on a periodic basis, the period of the rate set being a multiple of the primary frame. The primary frame is a concept in a time schedule of a time-sharing partition operating system, the time schedule is configured according to the time of the primary frame, the same primary frame is repeatedly executed during scheduling, one partition can have a plurality of time windows in the primary frame, and the time schedule is shown in the attached figure 1 of the specification.
The rate groups have priorities, the fastest rate group has the highest priority, and any other rate group can be preempted. The smaller the period, the higher the priority of the rate group.
2. Rate group status
The rate set has three states, which are described in detail below:
(1) the waiting state represents that the rate group waits for the next period to come;
(2) the ready state indicates that a rate group running period comes;
(3) the running state indicates that there is a running task in the rate set.
3. The tasks are divided into periodic tasks and background tasks
The tasks in each rate set share a separate stack, and different rate sets use different stacks. The tasks registered to the rate group are divided into periodic tasks and background tasks, and are specifically described as follows:
(1) and (3) periodic tasks: tasks in the same period are registered to the same rate group, the periodic tasks are executed and completed in the period of the rate group, when one rate group is scheduled to run again, the tasks running at the previous time are not all completed, and an overtime fault is triggered at the moment;
(2) background tasks: all background tasks are registered to the same rate group, and the background tasks do not need to be completed in the period of the corresponding rate group. When all background tasks are executed, the corresponding rate group is scheduled again next time. The rate group in which the background task is located has the lowest priority.
4. Implementing rate group scheduling algorithms through a time schedule mechanism and virtual interrupt mechanism provided by a time-division partition operating system
Time schedule scheduling is a scheduling algorithm provided by a time-sharing partition operating system for a partition, in which algorithm the operating system schedules the partition according to a time schedule configured by a user, and with respect to the time schedule, see fig. 1 of the specification.
The virtual interrupt is an interrupt exception handling mechanism provided by the time-sharing partition operating system for the partition, and is divided into an external interrupt, an exception, a tick interrupt and a service interrupt. The inter-partition may communicate through a virtual service interrupt.
The task rate group scheduling algorithm in the partition is realized based on a time scheduling table mechanism and a virtual interrupt mechanism provided by a time-sharing partition operating system. And when the time-sharing partition operating system notifies the time window, sending a partition window switching service interrupt to the partition of the current time window. The partition implements rate group scheduling in a partition window switching service interrupt handler.
The partition window switching service interrupt handler mainly completes the following functions:
(1) enabling a partition window switch service interrupt for the partition;
(2) checking whether the previous shooting has an interrupted speed group or not, and if so, calling fault processing;
(3) acquiring current system frame count, and setting a corresponding rate group as a ready state;
(4) scheduling the rate group according to the rate group priority, if the priority of the beat ready rate group is lower than the interrupted rate group, setting the beat ready rate group as a waiting state, and abandoning the beat to run; otherwise, setting the beat ready rate set as a running state, running the tasks in the rate set according to the registration sequence, completing the running of the tasks, and setting the beat ready rate set as a waiting state.
See figure 2 of the specification for rate group task scheduling flow.
Drawings
In the drawings of the specification: FIG. 1 is a time schedule; fig. 2 is a rate group task scheduling flow.
Claims (1)
1. A method for scheduling rate group based on time-sharing partition operating system, the method completes one-time complete function scheduling, comprising the following steps:
(1) the rate group has period and priority attribute, the period of the rate group is multiple of the main frame, and the tasks in the same period are in the same rate group; the rate group with shorter period has higher priority, and any other rate group can be preempted; scheduling the tasks of the rate group according to the requirement of the period of the rate group, and sequentially executing the running sequence of each task in the same rate group according to the registered sequence;
(2) the rate set has three states: a waiting state, a ready state and a running state;
(3) tasks registered in the rate group are divided into periodic tasks and background tasks, the periodic tasks are required to be completed in the period of the periodic tasks, and the background tasks are not required to be completed in the period of the corresponding rate group;
(4) the method for realizing rate group scheduling through a time scheduling table mechanism and a virtual interrupt mechanism provided by a time-sharing partition operating system is characterized in that the time scheduling table mechanism is used for scheduling partitions according to a time scheduling table configured by a user, the virtual interrupt mechanism is used for switching partitions through virtual service interrupt, and the rate group scheduling method comprises the following steps: when the time-sharing partition operating system carries out time scheduling and partition scheduling switching, a partition window switching service interrupt is sent to a partition of a current time window; after the partition which obtains the running opportunity after switching obtains the partition window switching service interrupt, rate group scheduling is realized in a partition window switching service interrupt processing program;
the implementing rate group scheduling in the partition window switching service interrupt handler includes:
(1) enabling a partition window switch service interrupt for the partition obtaining the running opportunity;
(2) checking whether the previous shooting has an interrupted speed group or not, and if so, calling fault processing;
(3) acquiring current system frame count, and setting a corresponding rate group as a ready state;
(4) scheduling the rate group according to the rate group priority, if the priority of the beat ready rate group is lower than the interrupted rate group, setting the beat ready rate group as a waiting state, and abandoning the beat to run; otherwise, setting the beat ready rate set as a running state, running the tasks in the rate set according to the registration sequence, completing the running of the tasks, and setting the beat ready rate set as a waiting state.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510045296.3A CN105988867B (en) | 2015-01-29 | 2015-01-29 | Rate group scheduling method based on time-sharing partition operating system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510045296.3A CN105988867B (en) | 2015-01-29 | 2015-01-29 | Rate group scheduling method based on time-sharing partition operating system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105988867A CN105988867A (en) | 2016-10-05 |
CN105988867B true CN105988867B (en) | 2020-01-21 |
Family
ID=57034273
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510045296.3A Active CN105988867B (en) | 2015-01-29 | 2015-01-29 | Rate group scheduling method based on time-sharing partition operating system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105988867B (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107506234B (en) * | 2017-07-03 | 2020-04-24 | 北京东土科技股份有限公司 | Virtual machine scheduling method and device |
CN108241308A (en) * | 2017-12-08 | 2018-07-03 | 中国航空工业集团公司成都飞机设计研究所 | A kind of run time control method based on timesharing subregion embedded software |
CN112379977A (en) * | 2020-07-10 | 2021-02-19 | 中国航空工业集团公司西安飞行自动控制研究所 | Task-level fault processing method based on time triggering |
CN112711467B (en) * | 2020-12-17 | 2023-10-10 | 北京科银京成技术有限公司 | Partition timeout processing method, partition timeout processing device, computer equipment and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101452404A (en) * | 2008-12-09 | 2009-06-10 | 中兴通讯股份有限公司 | Task scheduling apparatus and method for embedded operating system |
CN103049318A (en) * | 2011-10-11 | 2013-04-17 | 北京科银京成技术有限公司 | Virtual suspension algorithm of subregion operation system |
CN103049311A (en) * | 2011-10-11 | 2013-04-17 | 北京科银京成技术有限公司 | Integration scheduling algorithm of subregion operation system |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9361156B2 (en) * | 2005-03-14 | 2016-06-07 | 2236008 Ontario Inc. | Adaptive partitioning for operating system |
-
2015
- 2015-01-29 CN CN201510045296.3A patent/CN105988867B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101452404A (en) * | 2008-12-09 | 2009-06-10 | 中兴通讯股份有限公司 | Task scheduling apparatus and method for embedded operating system |
CN103049318A (en) * | 2011-10-11 | 2013-04-17 | 北京科银京成技术有限公司 | Virtual suspension algorithm of subregion operation system |
CN103049311A (en) * | 2011-10-11 | 2013-04-17 | 北京科银京成技术有限公司 | Integration scheduling algorithm of subregion operation system |
Also Published As
Publication number | Publication date |
---|---|
CN105988867A (en) | 2016-10-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105988867B (en) | Rate group scheduling method based on time-sharing partition operating system | |
Stephens et al. | Loom: Flexible and efficient {NIC} packet scheduling | |
CN107291547B (en) | Task scheduling processing method, device and system | |
Panda et al. | An effective round robin algorithm using min-max dispersion measure | |
US9575691B2 (en) | Scheduling user requests in a distributed resource system having a plurality of schedulers and coordinators | |
Delgado et al. | Kairos: Preemptive data center scheduling without runtime estimates | |
CN107005494B (en) | Apparatus and method for buffering data in a switch | |
EP2701074A1 (en) | Method, device, and system for performing scheduling in multi-processor core system | |
US20080235695A1 (en) | Resource allocation system for jobs, resource allocation method and resource allocation program for jobs | |
CN106293919A (en) | The built-in tasks dispatching device of a kind of Time Triggered and method | |
KR20130050661A (en) | Task scheduling method for real time operating system | |
Sindhu et al. | An optimum multilevel CPU scheduling algorithm | |
CN111143045B (en) | Task scheduling method and device of intelligent home operating system and storage medium | |
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 | |
WO2015052501A1 (en) | Scheduling function calls | |
CN106445659B (en) | A kind of spacecraft periodically blendes together Random Task dispatching method | |
WO2014154322A1 (en) | Scheduling | |
CN103049311A (en) | Integration scheduling algorithm of subregion operation system | |
Bandarupalli et al. | A Novel CPU Scheduling Algorithm–Preemptive & Non-Preemptive | |
EP3121716A1 (en) | Method and apparatus for hosting a multitasking guest on a host system | |
CN103207596A (en) | Method for synchronous execution of programs in redundant automation system | |
Srivastav et al. | Fair priority Round Robin with dynamic time quantum: FPRRDQ | |
Nosrati et al. | Task scheduling algorithms introduction | |
CN114661415A (en) | Scheduling method and computer system | |
CN103064727A (en) | Hard real-time hybrid task dispatching method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
DD01 | Delivery of document by public notice |
Addressee: Beijing Keyin Jingcheng Technology Co., Ltd. Document name: Notification to Go Through Formalities of Registration |
|
DD01 | Delivery of document by public notice | ||
GR01 | Patent grant | ||
GR01 | Patent grant |