Generalized Elastic Scheduling

Chantem, Thidapat; Hu, Xiaobo Sharon; Lemmon, Michael

doi:10.1109/rtss.2006.24

Cited by 38 publications

(31 citation statements)

References 29 publications

(54 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we can either have all the constraints in (4) be active or all are inactive. If all the constraints in (4) are active, we have (13) which contradicts the assumption that the resultant task set is schedulable. If all the constraints in (4) are inactive, (12) requires that µ 0 > 0, which contradicts the assumption that constraint (2) is inactive.…”

Section: Period Selection For the Basic Task Modelmentioning

confidence: 93%

See 1 more Smart Citation

Generalized Elastic Scheduling for Real-Time Tasks

Chantem

Lemmon

2009

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-The elastic task model is a powerful model for adapting periodic real-time systems in the presence of uncertainty. This paper generalizes the existing elastic scheduling approach in several directions. It reveals that the original task compression algorithm in fact solves a quadratic programming problem that seeks to minimize the sum of the squared deviation of a task's utilization from initial desired utilization. This finding indicates that the task compression algorithm may be applied to efficiently solve other similar types of problems that often arise in real-time applications. In particular, an iterative approach is proposed to solve the task compression problem for real-time tasks with deadlines less than respective periods. Furthermore, the framework is generalized to adjust task deadlines instead of task periods.

show abstract

Section: Period Selection For the Basic Task Modelmentioning

confidence: 93%

“…Based on our previous findings in [13], this paper generalizes the existing elastic scheduling approach in several directions. First, we re-examine the problem of period determination in the elastic task model and show that the task compression algorithm in [10] in fact solves a quadratic programming (QP) problem.…”

mentioning

confidence: 99%

Generalized Elastic Scheduling for Real-Time Tasks

Chantem

Lemmon

2009

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…With respect to controller design, the literature does offer quite a few works that perform offline timing and control analysis together (e.g., [4,5,6,7,25]). However, as the name suggests, offline methods lead to overly conservative designs, and they are unsuitable to be employed in real-time as well as in conjunction with the MPC design [13,19].These are usually performed using computer simulations for all time stamps based on the employed scheduling algorithm.…”

Section: Review Of Literaturementioning

confidence: 99%

“…However, the current current approaches have significant drawbacks. They either perform joint offline design on timing and control, hence inapplicable for online employment [7,11]; or rely on precise knowledge on the timing information of software tasks in the remote sender node, which is ill-suited for CAN where nodes are unsynchronized [19].…”

Section: Introductionmentioning

confidence: 99%

Online message delay prediction for model predictive control over controller area network

Rao

Zeng

2017

2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

View full text Add to dashboard Cite

Today's Cyber-Physical Systems (CPS) are typically distributed over several computing nodes communicating by way of shared buses such as Controller Area Network (CAN). Their control performance gets degraded due to variable delays (jitters) incurred by messages on the shared CAN bus due to contention and network overhead. This work presents a novel online delay prediction approach that predicts the message delay at runtime based on real-time traffic information on CAN. It leverages the proposed method to improve control quality, by compensating for the message delay using the Model Predictive Control (MPC) algorithm in designing the controller. By simulating an automotive Cruise Control system and a DC Motor plant in a CAN environment, it goes on to demonstrate that the delay prediction is accurate, and that the MPC design which takes the message delay into consideration, performs considerably better. It also implements the proposed method on an 8-bit 16MHz work goes on to demonstrate that the delay prediction is accurate, and that the MPC design which takes the message delay into consideration, performs considerably better. It also implements the proposed approach on a low end microcontroller (8bit, 16MHz ATmega328P) and measures the time taken for predicting the delay for each message (execution overhead).The obtained results clearly indicate that the method is computationally feasible for use in a real-time scenario.To my parents, my sister, and my grandparents for the unconditional love and support.iv I would like to extend my special thanks to Dr. Anton Cervin (Lund University) for clarifying queries about TrueTime and Dr. Liuping Wang (RMIT University) for the discussions on MPC which proved invaluable in my research.

show abstract

“…The work by Buttazzo et al [15] and its generalization in [16] present an elastic work model based on a tasks defined using a tuple (C, T, T min , T max , e) where T is the period that the task requires, while T min and T max define the max and min periods that a task can accept. Our transformations allows us to serve workloads under completely different (C, T ) server supplied resources.…”

Section: Related Workmentioning

confidence: 99%

A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

Ishakian

Bestavros

Kfoury

2010

2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Abstract-Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent. Having the flexibility to transform SLAs from one form to another in a manner that is provably safe would enable hosting solutions to achieve significant efficiencies. This paper demonstrates the promise of such an approach by proposing a type-theoretic framework for the representation and safe transformation of SLAs. Based on that framework, the paper describes a methodical approach for the inference of efficient and safe mappings of periodic, real-time tasks to the physical and virtual hosts that constitute a hierarchical scheduler. Extensive experimental results support the conclusion that the flexibility afforded by safe SLA transformations has the potential to yield significant savings.

show abstract

Generalized Elastic Scheduling

Abstract: The elastic task model [9]

Cited by 38 publications

References 29 publications

Generalized Elastic Scheduling for Real-Time Tasks

Generalized Elastic Scheduling for Real-Time Tasks

Online message delay prediction for model predictive control over controller area network

A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

Contact Info

Product

Resources

About