Reply to “Comments on ‘Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints”’ [Automatica 45 (2009) 2597–2604]

Automatica ◽  
2017 ◽  
Vol 82 ◽  
pp. 335
Author(s):  
Seong-Jin Park ◽  
Jung-Min Yang
Keyword(s):  
Real Time ◽  
Supervisory Control ◽  
Resource Constraints ◽  
Sporadic Tasks ◽  
Real Time Scheduling ◽  
Time Scheduling

A REAL-TIME SCHEDULING ALGORITHM FOR TASKS WITH RESOURCE CONTENTION ON A MULTIPROCESSOR

1994 ◽  
Vol 04 (03) ◽  
pp. 243-253
Author(s):  
DAL-SOO RYANG ◽  
KYU HO PARK
Keyword(s):  
Real Time ◽  
General Model ◽  
Resource Constraints ◽  
Scheduling Algorithm ◽  
Search Space ◽  
Real Time Scheduling ◽  
Multiple Processors ◽  
Time Scheduling ◽  
Two Measures ◽  
The Impact

Our scheduling algorithm is based on a general model with timing and resource constraints which permits OR requests. In order to keep run-time costs low, we propose an algorithm that does not search the whole search space. This paper defines two measures, survivability and impact, for scheduling tasks conflicted for some resources. The survivability is a metric to show how urgent a task is, and how constrained it is by its resources. The impact of a resource for a task measures how much other tasks are influenced by the allocation of the resource to the task. Our scheduling algorithm uses the survivability to schedule tasks on multiple processors. After a task is picked out to be run in a time slice using the survivability, the least impact resources are allocated from several alternative resources.

Sign in / Sign up

Export Citation Format

Share Document