CN110109743A - A kind of real-time process dispatching method - Google Patents
A kind of real-time process dispatching method Download PDFInfo
- Publication number
- CN110109743A CN110109743A CN201910386941.6A CN201910386941A CN110109743A CN 110109743 A CN110109743 A CN 110109743A CN 201910386941 A CN201910386941 A CN 201910386941A CN 110109743 A CN110109743 A CN 110109743A
- Authority
- CN
- China
- Prior art keywords
- time
- real
- time process
- task
- scheduling table
- 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
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
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a kind of real-time process dispatching method, which comprises is pre-configured with time scheduling table, the time scheduling table includes switch mode, dispatching sequence, kernel tasks whether allowed to participate in the attribute dispatched;Timesharing scheduling is carried out to real-time process according to the time scheduling table;The time scheduling table is switched over according to the time scheduling table switch mode.
Description
Technical field
The invention belongs to computer system software professional skill fields, specifically propose a kind of real-time process based on timetable
Dispatching method.
Background technique
Real-time process scheduling in embedded system generallys use preemptive policy priority-based, supports same priority
Round-robin strategy.Although real-time process scheduling has predictability under this kind of scheduling strategy, it cannot be guaranteed that scheduling
The time determinability of real-time process, critical system higher for security requirement then carry out the execution time of real-time process
Stringent control needs a kind of real-time process scheduling strategy that the time determines, meets real-time process in critical system and executes the time
Control requirement, improve the predictability of system operation time.
Summary of the invention
Purpose: a kind of real-time process dispatching method that the time determines is realized.
In a first aspect, the application provides a kind of real-time process dispatching method, which comprises
It is pre-configured with time scheduling table, the time scheduling table includes switch mode, dispatching sequence, kernel whether is allowed to appoint
Business participates in the attribute of scheduling;
Timesharing scheduling is carried out to real-time process according to the time scheduling table;
The time scheduling table is switched over according to the time scheduling table switch mode.
Optionally, time window is contained at least two in a main time frame of the time scheduling table;
The time window includes prospect real-time process group and background real-time process group.
Optionally, the time scheduling table switch mode includes:
Switch after a clock TICK;
Switch after n clock TICK, the n is more than or equal to 2;
Switch at the end of actual time window;
Switching when next main time frame starts.
Optionally, the dispatching sequence specifically:
If in prospect real-time process group including real-time process, determined in prospect real-time process group in this time window
Real-time process task, and dispatch the task;
It include real-time process in background real-time process group, then in this time window if prospect real-time process group is sky
It determines the task of the real-time process in background real-time process group, and dispatches the task;
If prospect real-time process group is sky, and background real-time process group is sky, then kernel is determined in this time window
In task, and dispatch the task.
Optionally, the scheduling configuration of the time scheduling table specifically includes:
Configure the time span of each time window;
The time span of main time frame is calculated according to the time span of each window;
Whether configuration allows kernel tasks to participate in the attribute dispatched.
Optionally, whether the configuration allows kernel tasks to participate in the attribute of scheduling, specifically includes:
If configuration allows kernel tasks to participate in the attribute of scheduling in prospect real-time process group, prospect real-time process is chosen
The highest priority task and the highest priority task in kernel of real-time process in group;Higher prior is taken by comparing
Grade task is dispatched;
If configuration allows kernel tasks to participate in the attribute dispatched in background real-time process group, if prospect real-time process group
For sky, then the highest priority task for choosing the real-time process in background real-time process group and the highest priority in kernel
Task;Higher priority task is taken to dispatch by comparing.
Optionally, if highest priority task in kernel, the priority with the highest priority task in real-time process
Unanimously, then the highest priority task in kernel is selected to dispatch.
Optionally, described that the time scheduling table is switched over according to the time scheduling table switch mode, it is specific to wrap
It includes:
According to the time scheduling table to be switched mark and switching time, time dispatch list is cut in preset time point
It changes, and executes new time scheduling table.
In conclusion the present invention supports real-time process to be scheduled according to given arrangement of time, so that real-time process can
Determining time scheduling is executed according to the distribution time, improves the predictability of system action.
Detailed description of the invention
Fig. 1 is timetable real-time process Scheduling Framework schematic diagram provided by the embodiments of the present application;
Fig. 2 is timetable real-time process scheduling execution flow chart provided by the embodiments of the present application.
Specific embodiment
Realize a kind of real-time process dispatching method that the time determines.The signal of dispatching method frame is as shown in Figure 1.
Embodiment one
Real-time process dispatching method provided by the present application based on timetable is as follows:
1) critical data of time scheduling table: a time scheduling table contains at least two time window, each time window
Mouth includes prospect real-time process group, and background real-time process group, real-time process group the inside includes real-time process, the time of each window
Length, and whether allow kernel tasks to participate in the attribute dispatched in time window.
2) time scheduling table switch mode is defined, there is following switch mode respectively:
A) switch after a clock TICK;
Application software request time dispatch list switches and after a clock TICK, executes the time scheduling of application software
Table switching request.
B) switch after n clock TICK, the n is more than or equal to 2;
Application software request time dispatch list switches and after n clock TICK, executes the time scheduling of application software
Table switching request.
C) switch at the end of actual time window;
The corresponding time window of time scheduling table that the switching of application software request time dispatch list and operating system are being dispatched
After the mouth time, the time scheduling table switching request of application software is executed.
D) switching when next main time frame starts.
After the switching of application software request time dispatch list and operating system is really worked as the time scheduling table of scheduling is corresponding
Preceding main time frame (one cycle of time scheduling table), which executes, to terminate, and when next main time frame starts, it is soft to execute application
The time scheduling table switching request of part.
3) dispatching sequence for defining real-time process under timetable Scheduling Framework, since real-time process itself is not involved in tune
Degree, the entity of scheduling is the task in real-time process, and task is overall scheduling in system, and dispatching principle is by operating system
The scheduler of core determines.Dispatching sequence is as follows:
If a) in prospect real-time process group including real-time process, prospect real-time process group is determined in this time window
In real-time process task, and dispatch the task.
It include real-time process in background real-time process group, then in this time window if b) prospect real-time process group is sky
The task of real-time process in interior determining background real-time process group, and dispatch the task.
If c) prospect real-time process group be sky, and background real-time process group be sky, then in this time window determine in
Task in core, and dispatch the task.
4) scheduling configuration:
A) time span of each time window is configured;
B) time span of main time frame is calculated according to the time span of each window;
C) whether configuration allows kernel tasks to participate in the attribute dispatched,
If configuration allows kernel tasks to participate in the attribute of scheduling in prospect real-time process group, prospect real-time process is chosen
The highest priority task and the highest priority task in kernel of real-time process in group;Higher prior is taken by comparing
Grade task is dispatched;
If configuration allows kernel tasks to participate in the attribute dispatched in background real-time process group, if prospect real-time process group
For sky, then the highest priority task for choosing the real-time process in background real-time process group and the highest priority in kernel
Task;Higher priority task is taken to dispatch by comparing.
It is consistent with the priority of highest priority task in real-time process if the highest priority task in kernel, then
The highest priority task in kernel is selected to dispatch.
5) time scheduling table switches
According to the time scheduling table to be switched mark and switching time, time dispatch list is cut in preset time point
It changes, and executes new time scheduling table.
6) operation phase scheduling flow (shown in Fig. 2):
Step 1: if actual time window is over, needing switch window, jump to step 11, otherwise continue step
2。
Step 2: if including real-time process in prospect real-time process group, continuing step 3, otherwise jump to step 6.
Step 3: if configuration allows kernel tasks to participate in the attribute of scheduling in prospect real-time process group, continue step 4,
Otherwise step 5 is jumped to.
Step 4: determining the task of highest priority from the real-time process in prospect real-time process group, and determine that kernel is appointed
The task of highest priority in business, if kernel highest priority task priority is most greater than or equal to priority in real-time process
High task, it is determined that kernel tasks, and the task is dispatched, otherwise determine the task of real-time process, and dispatch the task,
Until this time window terminates, and jump to step 1.
Step 5: from the real-time process determined in the real-time process in prospect real-time process group in prospect real-time process group
Task, and dispatch the task until this time window terminates, and jumps to step 1.
Step 6: if including real-time process in background real-time process group, continuing step 7, otherwise jump to step 10.
Step 7: if configuration allows kernel tasks to participate in the attribute of scheduling in background real-time process group, continue step 8,
Otherwise step 9 is jumped to.
Step 8: determining the task of highest priority from the real-time process in background real-time process group, and determine that kernel is appointed
The task of highest priority in business, if kernel highest priority task priority is most greater than or equal to priority in real-time process
High task, it is determined that kernel tasks, and the task is dispatched, otherwise determine the task of real-time process, and dispatch the task,
Until this time window terminates, and jump to step 1.
Step 9: from the real-time process determined in the real-time process in background real-time process group in background real-time process group
Task, and dispatch the task until this time window terminates, and jumps to step 1.
Step 10: determining the kernel tasks of highest priority to dispatch, until this time window terminates, and jump to step
1。
Step 11: then being existed according to the time scheduling table to be switched mark and switching time if necessary to switch dispatch list
Preset time point switches over time dispatch list, and executes new time scheduling table, and jump to step 2, otherwise continues to hold
Time scheduling table before the trade.
In conclusion real-time process is supported to be scheduled according to given arrangement of time so that real-time process can according to point
Determining time scheduling is executed with the time, improves the predictability of system action.
Embodiment two
Use a kind of specific work steps of the real-time process dispatching method based on timetable of the present invention:
1) the time scheduling table configuration data in user's creation time dispatch list stage, formation is as follows:
2) after the creation of time scheduling table, the system time schedule table data of formation is as follows:
3) start time scheduling list scheduling, executed since operating system only allows to load a time scheduling table, herein about
Determine load time dispatch list 1.Real-time process starts to start to dispatch according to the prespecified strategy of time scheduling table.It is described below
Time scheduling table 1, the scheduling behavior of time scheduling table 2:
For time scheduling table 1:
A) 1 prospect real-time process group of window, background real-time process group includes real-time process, and kernel tasks is allowed to join
The real-time process 1 of prospect real-time process group is only chosen according to dispatching principle with the attribute of the scheduling of prospect real-time process group, it is real
The task schedule of Shi Jincheng 2, and kernel tasks is allowed to participate in scheduling.Determine real-time process 1, the highest of real-time process 2 and kernel
Priority tasks execute.
B) window 2 only have prospect real-time process group include real-time process, and allow kernel tasks participate in prospect in real time into
The attribute of the scheduling of journey group only chooses the task schedule of the real-time process 1 of prospect real-time process group according to dispatching principle, and permits
Perhaps kernel tasks participate in scheduling.The highest priority task of real-time process 1 and kernel is chosen to execute.
C) window 3 only have powerful connections real-time process group include real-time process, and allow kernel tasks participate in background in real time into
The attribute of the scheduling of journey group only chooses the task schedule of the real-time process 2 of background real-time process group according to dispatching principle, and permits
Perhaps kernel tasks participate in scheduling.The highest priority task of real-time process 2 and kernel is chosen to execute.
For time scheduling table 2:
A) it includes real-time process that window 1, which only has prospect real-time process group, according to dispatching principle, only chooses prospect real-time process
The task schedule of the real-time process 1 of group chooses the highest priority task of real-time process 1 to execute.
B) the real-time process group that only has powerful connections of window 2 includes real-time process, according to dispatching principle, only chooses background real-time process
The real-time process 2 of group, the task schedule of real-time process 3 choose real-time process 2, and the highest priority task of real-time process 3 is held
Row.
C) 3 prospect real-time process group of window, background real-time process group does not include real-time process, so window real-time process
It is not involved in scheduling.
4) switching of time scheduling table.
Application request time scheduling table switching, operating system first check for the time scheduling table being currently running whether be
Otherwise the time scheduling table to be switched, is arranged and records the time tune of this request switching if it is, this time switching in vain
Spend table mark and currently valid time scheduling table switch mode.
Meanwhile according to currently valid time scheduling table switch mode, the arrival of switching time is monitored, if switching time
It does not reach, then continues to execute current time dispatch list, if switching time reaches, carry out time scheduling table switching, and start
New time scheduling table executes.
In conclusion being related to a kind of reality based on timetable the invention belongs to computer system software professional skill field
When process scheduling method, this method be used for solve the problems, such as real-time process scheduling time determinability.A kind of reality based on timetable
When process scheduling method include 4 critical aspects: 1. define the attribute of time scheduling table window: include prospect real-time process
Group, background real-time process group, if the attributes such as scheduling of enabled kernel tasks;2. time scheduling table is supported to pass through a clock
Switch after TICK, switch after n clock TICK, the n switches at the end of being more than or equal to 2, actual time window, is next
Main time frame starts equal switch modes;3. executing time scheduling table switching action: starting to execute according to new time scheduling table.
4. real-time process is scheduled according to time scheduling table, in a time window, scheduler selects the sequence of real-time process: preceding
Scape real-time process group, background real-time process group, kernel;The enabled scheduling kernel tasks of foreground/background real-time process group are configurable on,
Kernel tasks can simultaneously participate in competition CPU with the task of real-time process at this time.
Claims (8)
1. a kind of real-time process dispatching method, which is characterized in that the described method includes:
It is pre-configured with time scheduling table, the time scheduling table includes switch mode, dispatching sequence, whether kernel tasks allowed to join
With the attribute of scheduling;
Timesharing scheduling is carried out to real-time process according to the time scheduling table;
The time scheduling table is switched over according to the time scheduling table switch mode.
2. according to the method described in claim 1, it is characterized by: including in a main time frame of the time scheduling table
At least two time windows;
The time window includes prospect real-time process group and background real-time process group.
3. according to the method described in claim 1, it is characterized by: the time scheduling table switch mode includes:
Switch after a clock TICK;
Switch after n clock TICK, the n is more than or equal to 2;
Switch at the end of actual time window;
Switching when next main time frame starts.
4. according to the method described in claim 2, it is characterized by: the dispatching sequence specifically:
If in prospect real-time process group including real-time process, the reality in prospect real-time process group is determined in this time window
The task of Shi Jincheng, and dispatch the task;
If prospect real-time process group is sky, includes real-time process in background real-time process group, then determined in this time window
The task of real-time process in background real-time process group, and dispatch the task;
If prospect real-time process group is sky, and background real-time process group is sky, then determines in kernel in this time window
Task, and dispatch the task.
5. according to the method described in claim 1, it is characterized by: the scheduling configuration of the time scheduling table specifically includes:
Configure the time span of each time window;
The time span of main time frame is calculated according to the time span of each window;
Whether configuration allows kernel tasks to participate in the attribute dispatched.
6. according to the method described in claim 5, it is characterized by: whether the configuration allows kernel tasks to participate in the category dispatched
Property, it specifically includes:
If configuration allows kernel tasks to participate in the attribute of scheduling in prospect real-time process group, choose in prospect real-time process group
Real-time process highest priority task and the highest priority task in kernel;Take higher prior in charge of a grade by comparing
Business is to dispatch;
If configuration allows kernel tasks to participate in the attribute dispatched in background real-time process group, if prospect real-time process group is
Sky, then choose the highest priority task of the real-time process in background real-time process group and the highest priority in kernel is appointed
Business;Higher priority task is taken to dispatch by comparing.
7. according to the method described in claim 6, it is characterized by: if highest priority task in kernel, with real-time process
In highest priority task priority it is consistent, then select the highest priority task in kernel to dispatch.
8. according to the method described in claim 1, it is characterized by: it is described according to the time scheduling table switch mode to described
Time scheduling table switches over, and specifically includes:
According to the time scheduling table to be switched mark and switching time, time dispatch list is switched in preset time point,
And execute new time scheduling table.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910386941.6A CN110109743B (en) | 2019-05-09 | 2019-05-09 | Real-time process scheduling method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910386941.6A CN110109743B (en) | 2019-05-09 | 2019-05-09 | Real-time process scheduling method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110109743A true CN110109743A (en) | 2019-08-09 |
CN110109743B CN110109743B (en) | 2023-07-21 |
Family
ID=67489178
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910386941.6A Active CN110109743B (en) | 2019-05-09 | 2019-05-09 | Real-time process scheduling method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110109743B (en) |
Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0441798A1 (en) * | 1988-09-13 | 1990-03-22 | Digital Equipment Corporation | Entity management system for a distributed computer system |
CA2200929A1 (en) * | 1996-03-28 | 1997-09-28 | Tadashi Takeuchi | Periodic process scheduling method |
US20060112390A1 (en) * | 2004-11-24 | 2006-05-25 | Yoshiyuki Hamaoka | Systems and methods for performing real-time processing using multiple processors |
CN103064727A (en) * | 2012-12-07 | 2013-04-24 | 中国航空工业集团公司第六三一研究所 | Hard real-time hybrid task dispatching method |
CN103885826A (en) * | 2014-03-11 | 2014-06-25 | 武汉科技大学 | Real-time task scheduling implementation method of multi-core embedded system |
CN103984596A (en) * | 2014-05-19 | 2014-08-13 | 上海微小卫星工程中心 | Dispatching method and device of satellite borne software |
CN104375893A (en) * | 2014-11-29 | 2015-02-25 | 中国航空工业集团公司第六三一研究所 | Partition scheduling method based on two-stage operating system structure |
CN105045666A (en) * | 2015-07-09 | 2015-11-11 | 西北工业大学 | Method for partition scheduling in Windows operating system environment |
CN105550027A (en) * | 2015-12-09 | 2016-05-04 | 中国航空工业集团公司西安航空计算技术研究所 | Switching method for multiple time scheduling tables based on partition operation system |
CN105629873A (en) * | 2014-11-07 | 2016-06-01 | 中国科学院沈阳计算技术研究所有限公司 | Hybrid task scheduling method suitable for numerical control system |
CN106293919A (en) * | 2016-08-12 | 2017-01-04 | 中国航空工业集团公司西安飞行自动控制研究所 | The built-in tasks dispatching device of a kind of Time Triggered and method |
KR101733534B1 (en) * | 2016-03-04 | 2017-05-24 | 국방과학연구소 | Schedulability analysys method and system for task group of hard real-time |
CN109634589A (en) * | 2018-12-07 | 2019-04-16 | 上海上实龙创智慧能源科技股份有限公司 | A kind of processing method for the automatic Realtime Alerts task of sewage treatment process |
-
2019
- 2019-05-09 CN CN201910386941.6A patent/CN110109743B/en active Active
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0441798A1 (en) * | 1988-09-13 | 1990-03-22 | Digital Equipment Corporation | Entity management system for a distributed computer system |
CA2200929A1 (en) * | 1996-03-28 | 1997-09-28 | Tadashi Takeuchi | Periodic process scheduling method |
US20060112390A1 (en) * | 2004-11-24 | 2006-05-25 | Yoshiyuki Hamaoka | Systems and methods for performing real-time processing using multiple processors |
CN103064727A (en) * | 2012-12-07 | 2013-04-24 | 中国航空工业集团公司第六三一研究所 | Hard real-time hybrid task dispatching method |
CN103885826A (en) * | 2014-03-11 | 2014-06-25 | 武汉科技大学 | Real-time task scheduling implementation method of multi-core embedded system |
CN103984596A (en) * | 2014-05-19 | 2014-08-13 | 上海微小卫星工程中心 | Dispatching method and device of satellite borne software |
CN105629873A (en) * | 2014-11-07 | 2016-06-01 | 中国科学院沈阳计算技术研究所有限公司 | Hybrid task scheduling method suitable for numerical control system |
CN104375893A (en) * | 2014-11-29 | 2015-02-25 | 中国航空工业集团公司第六三一研究所 | Partition scheduling method based on two-stage operating system structure |
CN105045666A (en) * | 2015-07-09 | 2015-11-11 | 西北工业大学 | Method for partition scheduling in Windows operating system environment |
CN105550027A (en) * | 2015-12-09 | 2016-05-04 | 中国航空工业集团公司西安航空计算技术研究所 | Switching method for multiple time scheduling tables based on partition operation system |
KR101733534B1 (en) * | 2016-03-04 | 2017-05-24 | 국방과학연구소 | Schedulability analysys method and system for task group of hard real-time |
CN106293919A (en) * | 2016-08-12 | 2017-01-04 | 中国航空工业集团公司西安飞行自动控制研究所 | The built-in tasks dispatching device of a kind of Time Triggered and method |
CN109634589A (en) * | 2018-12-07 | 2019-04-16 | 上海上实龙创智慧能源科技股份有限公司 | A kind of processing method for the automatic Realtime Alerts task of sewage treatment process |
Non-Patent Citations (1)
Title |
---|
张明 等: "基于VxWorks653分区操作系统的IMA设计与实现", 火力与指挥控制, pages 145 - 148 * |
Also Published As
Publication number | Publication date |
---|---|
CN110109743B (en) | 2023-07-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN102566974B (en) | Instruction acquisition control method based on simultaneous multithreading | |
CN101894047B (en) | Kernel virtual machine scheduling policy-based implementation method | |
CN104536827B (en) | A kind of data dispatching method and device | |
US8407387B2 (en) | Multi-thread processor and the multi-thread processor's interrupt processing method having interrupt processing that is processed by an associated hardware thread | |
US20070168082A1 (en) | Task-based robot control system for multi-tasking | |
CN104199730B (en) | A kind of single thread multi-task processing method based on synchronous i/o multiplexing mechanism | |
CN106155781B (en) | A kind of real-time task scheduling method in multiple agent platform | |
CN104536835B (en) | Self-adapting task scheduling method in a kind of Hot Spare real-time control system | |
CN103823706B (en) | A kind of plant model analog simulation real-time scheduling method based on RTLinux | |
TW201337768A (en) | Resource management in a multicore architecture | |
WO2014094516A1 (en) | Real-time multi-task scheduling method and device | |
CN101561768A (en) | Universal multitask scheduling method | |
US10271326B2 (en) | Scheduling function calls | |
CN103488531B (en) | A kind of software and hardware mixed real-time application dispatching method based on polycaryon processor and FPGA | |
CN102495804A (en) | Automatic software testing method | |
CN108563494A (en) | A kind of thread scheduling system and method for adaptive dynamic adjustment | |
CN111158875B (en) | Multi-module-based multi-task processing method, device and system | |
CN106874129B (en) | Method for determining process scheduling sequence of operating system and control method | |
CN110109743A (en) | A kind of real-time process dispatching method | |
CN101349975B (en) | Method for implementing interrupt bottom semi-section mechanism in embedded operation system | |
JP2014225137A (en) | Task scheduler, microprocessor, and task scheduling method | |
CN110502322A (en) | The triggering method and device of timer-triggered scheduler | |
JP2011243120A (en) | Job management device, job management method and job management program | |
JP2001236236A (en) | Task controller and its task scheduling method | |
Park et al. | Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems |
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 |