Providing Real-Time Applications With Graceful Degradation of QoS and Fault Tolerance According to&lt;tex&gt;$(m, k)$&lt;/tex&gt;-Firm Model

Li, J.; Song, Ye-Qiong; Simonot-Lion, Françoise

doi:10.1109/tii.2006.875511

Cited by 39 publications

(22 citation statements)

References 15 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of providing some guarantee for cycling tasks assuming environments where eventual discards in periodic activations may occur has been addressed by a considerable amount of work [1,9,[17][18][19][20][21][22][23][24][25][26]. In general, these studies attempt to develop scheduling strategies that can offer some guarantee for tasks, considering their tolerance to periodic activation losses.…”

Section: Related Workmentioning

confidence: 99%

“…Some of them propose incremental improvements to the DBP in order to reduce the number of dynamic failures [25,26]; other works propose schedulability tests aiming to guarantee that the tasks accepted in the system will not have any (m,k)-firm constraints violation [1,9,[17][18][19]24].…”

Section: Related Workmentioning

confidence: 99%

“…In [1] is a proposed sufficient schedulability analysis based on a classical test [27] for periodic and sporadic http://jwcn.eurasipjournals.com/content/2013/1/222 real-time tasks. The work considers a non-preemptive scheduling based on DBP priority assignment algorithm.…”

Section: Related Workmentioning

confidence: 99%

“…In the last few years, there has been a growth in the use of wireless technologies in application domains that require a trustworthy quality of service (QoS) [1][2][3][4][5][6][7][8][9]. It is expected that, in the near future, the availability of wireless network solutions will create a de facto standard for wireless communication in industrial environments.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

(m,k)-firm pattern spinning to improve the GTS allocation of periodic messages in IEEE 802.15.4 networks

Semprebom

Montez

Vasques

2013

J Wireless Com Network

View full text Add to dashboard Cite

The IEEE 802.15.4 standard provides a flexible communication support for low-rate wireless personal area networks) applications. When active, the beacon-enabled mode provides a real-time communication to the supported application by adopting a guaranteed time slot (GTS) mechanism. However, this mechanism permits only up to seven real-time communicating devices. One way to deal with this limitation is to share the communication opportunities among the periodic tasks, by skipping some of the task activations in a controlled way. One of the widely accepted periodic task models that allows skips in periodic activations is the (m,k)-firm model. Motivated by this problem, this paper proposes the use of a dynamic GTS scheduling approach based on the (m,k)-firm task model, to deal with the GTS starvation problem. The proposed scheduling approach is based on pre-defined spins of the originally defined (m,k)-firm pattern. The use of an exact schedulability analysis test ensures that for each admitted message stream, at least m messages will be transmitted within each window of k consecutive deadlines. The schedulability analysis may be executed in polynomial time and therefore can be used as an online admission test for GTS requests. The effectiveness of the approach has been assessed both by a set of simulations and an experimental evaluation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

(m,k)-firm pattern spinning to improve the GTS allocation of periodic messages in IEEE 802.15.4 networks

Semprebom

Montez

Vasques

2013

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…We present a model based on (m,k)-firm model [5][6][7][8] to take into account the congestion of systems workloads in companies.…”

Section: Introductionmentioning

confidence: 99%

EE-(m,k)-firm: Operations Management Approach In Enterprise Environment

Alaya¹

2016

Ind Eng Manage

View full text Add to dashboard Cite

Task management is of a paramount importance because of the daily execution of more or less urgent and important tasks. In this paper, we propose a policy to indicate the necessary tasks and calculate their ranking, using a compromise between the available resources and the quality of service (QoS) granularity in the same task type. We applied a guaranteed technique in order to achieve an intelligent loss of tasks according to the importance of each task. A dynamicity of constraints was then used to attain an increase of availability, performance, reliability and system dependability. The results obtained from the proposed policy reveal that this type of policy can be extremely valuable for companies that wish to focus their efforts and resources to guarantee a satisfactory QoS for their clients.

show abstract