Designing with Rate Monotonic Analysis

Klein, Mark; Ralya, Thomas; Pollak, Bill; Obenza, Ray; Harbour, Michael González

doi:10.1007/978-1-4615-2796-1_9

Cited by 10 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we present experiments conducted to evaluate the performance of our proposed methods. Since there is no similar previous research about stealing mechanisms in industrial WSNs, we compare our methods (OBSSA and SfSA) with the traditional RM scheme without stealing [ 28 ] and with the shortest path Dijkstra algorithm [ 29 ] in terms of both the schedulability ratio and the number of stolen flows. The schedulability ratio can be obtained by

, where Z is the number of executions, and z is the number of success executions.…”

Section: Methodsmentioning

confidence: 99%

Scheduling for Emergency Tasks in Industrial Wireless Sensor Networks

Xia

Jin

Kong

et al. 2017

Sensors

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are widely applied in industrial manufacturing systems. By means of centralized control, the real-time requirement and reliability can be provided by WSNs in industrial production. Furthermore, many approaches reserve resources for situations in which the controller cannot perform centralized resource allocation. The controller assigns these resources as it becomes aware of when and where accidents have occurred. However, the reserved resources are limited, and such incidents are low-probability events. In addition, resource reservation may not be effective since the controller does not know when and where accidents will actually occur. To address this issue, we improve the reliability of scheduling for emergency tasks by proposing a method based on a stealing mechanism. In our method, an emergency task is transmitted by stealing resources allocated to regular flows. The challenges addressed in our work are as follows: (1) emergencies occur only occasionally, but the industrial system must deliver the corresponding flows within their deadlines when they occur; (2) we wish to minimize the impact of emergency flows by reducing the number of stolen flows. The contributions of this work are two-fold: (1) we first define intersections and blocking as new characteristics of flows; and (2) we propose a series of distributed routing algorithms to improve the schedulability and to reduce the impact of emergency flows. We demonstrate that our scheduling algorithm and analysis approach are better than the existing ones by extensive simulations.

show abstract

, where Z is the number of executions, and z is the number of success executions.…”

Section: Methodsmentioning

confidence: 99%