A capacity sharing and stealing strategy for open real-time systems

Nogueira, Luís; Pinho, Luís Miguel

doi:10.1016/j.sysarc.2010.02.003

Cited by 9 publications

(8 citation statements)

References 33 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, hard real-time tasks can miss deadlines in overload conditions with these algorithms. In traditional real-time systems, there are many mixed scheduling algorithms based on resource reservation strategies to schedule hard periodic tasks and soft aperiodic tasks [27], [28], [29], [30]. These algorithms are based on reserving a fraction of the processor time to each task using the EDF algorithm.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Reservation-Based Scheduling for Automotive DSMS under High Overload Condition

Rho

Azumi

Yamaguchi

et al. 2016

Journal of Information Processing

View full text Add to dashboard Cite

Recent automotive systems require various data, including data from on-board sensors and external sources to recognize environmental conditions. As the amount of sensor data used in automotive systems increases, processes that use such data become increasingly complicated. In addition, similar data processing can be duplicated over multiple applications. To address these issues, a data stream management system (DSMS) for automotive systems based on a data integration architecture has been developed. However, hard real-time deadlines cannot be guaranteed due to unpredictable load changes caused by data streams. For example, the arrival time and CPU utilization requested by data streams from vehicle-to-vehicle communications change rapidly depending on environmental conditions. We propose the reservation-based operator path earliest deadline first (ROP-EDF) scheduling algorithm for an automotive DSMS under overload conditions. The proposed algorithm reserves processor time preferentially for hard real-time tasks so that tasks can meet deadlines under overload conditions. ROP-EDF can be used for load testing on a single processor system. Experimental results show the effectiveness of the proposed algorithm compared with existing algorithms relative to the deadline miss ratio under overload conditions.

show abstract

Section: Related Workmentioning

confidence: 99%

“…However, the existing algorithms based on resource reservation strategies [27], [28], [29], [30] assume that a single task has only one deadline or period. Consequently, these algorithms cannot handle tasks with multiple deadlines directly.…”

Section: Related Workmentioning

confidence: 99%

Reservation-Based Scheduling for Automotive DSMS under High Overload Condition

Rho

Azumi

Yamaguchi

et al. 2016

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…In [46], we provide a complete description of the server-based schedulers used in the CooperatES framework, simultaneously dealing with capacity sharing, stealing and exchanging. Hard schedulability guarantees can be provided either for independent and interdependent task sets, even when hard and soft real-time tasks do share resources and exhibit precedence constraints.…”

Section: The Cooperates Frameworkmentioning

confidence: 99%

“…Note that if the system adapts too late to the new resource requirements, it may not be useful and may even be disadvantageous. This idea has been formalised using the concepts of anytime QoS optimisation algorithms, in which there are a range of acceptable solutions with varying qualities, adapting the distributed service allocation to the available deliberation time that is dynamically imposed as a result of emerging environmental conditions [46]. Nodes start by negotiating partial, acceptable service proposals that are latter refined if time permits, in contrast to a traditional QoS optimisation approach that either runs to completion or is not able to provide a useful solution.…”

Section: The Cooperates Frameworkmentioning

confidence: 99%

A feedback-based decentralised coordination model for distributed open real-time systems

Nogueira

Pinho

Coelho

2012

Journal of Systems and Software

Self Cite

View full text Add to dashboard Cite

Moving towards autonomous operation and management of increasingly complex open distributed real-time systems poses very significant challenges. This is particularly true when reaction to events must be done in a timely and predictable manner while guaranteeing Quality of Service (QoS) constraints imposed by users, the environment, or applications. In these scenarios, the system should be able to maintain a global feasible QoS level while allow-ing individual nodes to autonomously adapt under different constraints of resource availability and input quality.This paper shows how decentralised coordination of a group of autonomous interdependent nodes can emerge with little communication, based on the robust self-organising principles of feedback. Positive feedback is used to reinforce the selection of the new desired global service solution, while neg-ative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes.The proposed protocol is general enough to be used in a wide range of scenarios characterised by a high degree of openness and dynamism where coordination tasks need to be time dependent. As the reported results demon-strate, it requires less messages to be exchanged and it is faster to achieve a globally acceptable near-optimal solution than other available approaches. AbstractMoving towards autonomous operation and management of increasingly complex open distributed real-time systems poses very significant challenges. This is particularly true when reaction to events must be done in a timely and predictable manner while guaranteeing Quality of Service (QoS) constraints imposed by users, the environment, or applications. In these scenarios, the system should be able to maintain a global feasible QoS level while allowing individual nodes to autonomously adapt under different constraints of resource availability and input quality. This paper shows how decentralised coordination of a group of autonomous interdependent nodes can emerge with little communication, based on the robust self-organising principles of feedback. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes.The proposed protocol is general enough to be used in a wide range of scenarios characterised by a high degree of openness and dynamism where coordination tasks need to be time dependent. As the reported results demonstrate, it requires less messages to be exchanged and it is faster to achieve a globally acceptable near-optimal solution than other available approaches.

show abstract

“…Other CPU schedulers can also be used, like the Capacity Sharing and Stealing scheduler (CSS) proposed in [13]. For the network scheduling, any scheduling algorithm with similar characteristics can also be used, like the ones based on the Flexible Time-Triggered approach [14].…”

Section: B Resource Managementmentioning

confidence: 99%

On the use of code mobility mechanisms in real-time systems

Ferreira

Nogueira

2011

SIGBED Rev.

Self Cite

View full text Add to dashboard Cite

Applications with soft real-time requirements can benefit from code mobility mechanisms, as long as those mechanisms support the timing and Quality of Service requirements of applications. In this paper, a generic model for code mobility mechanisms is presented. The proposed model gives system designers the necessary tools to perform a statistical timing analysis on the execution of the mobility mechanisms that can be used to determine the impact of code mobility in distributed real-time applications.Abstract -A pplications with soft real-time requirements can benefit from code mobility mechanisms, as long as those mechanisms support the timing and Q uality of Service requirements. In this paper, a generic model for code mobility mechanisms is presented. T he proposed model gives system designers the necessary tools to perform a statistical timing analysis on the execution of the mobility mechanisms that can be used to deter mine the impact of code mobility in distributed real-time applications.

show abstract

A capacity sharing and stealing strategy for open real-time systems

Cited by 9 publications

References 33 publications

Reservation-Based Scheduling for Automotive DSMS under High Overload Condition

Reservation-Based Scheduling for Automotive DSMS under High Overload Condition

A feedback-based decentralised coordination model for distributed open real-time systems

On the use of code mobility mechanisms in real-time systems

Contact Info

Product

Resources

About