Learn More
In this paper, a Traffic Separation mechanism (TSm) is proposed for CSMA-based networks. The TSm mechanism is intended to be used as an underlying traffic separation mechanism able to prioritize traffic in CSMA-based networks. It allows the coexistence of standard CSMA (non-modified) stations with TSm (modified) stations in the same network domain. When a(More)
We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few(More)
The development of safety-critical embedded applications in domains such as automotive or avionics is an exceedingly challenging intellectual task. This task can, however, be significantly simplified through the use of middleware that offers specialized fault-tolerant services. This middleware must provide a high assurance level that it operates correctly.(More)
Wireless Mesh Networks (WMNs) are a promising communication technology that may offer greater flexibility and reliability, when compared to traditional wireless networks. WMNs open up new applications domains, but still need to find efficient mechanisms to deal with scalability and timeliness requirements. This paper proposes a scheme for Path Selection and(More)
Keeping up with the timing constraints of real-time traffic in wireless environments is a hard task. One of the reasons is that the real-time stations have to share the same communication medium with stations that are out of the sphere-of control of the real-time architecture. That is, with stations that generate timing unconstrained traffic. The VTP-CSMA(More)
Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low(More)
Schedulability analyses, while valuable in theoretical research, cannot be used in practice to reason about the timing behaviour of a real-time system without including the overheads induced by the implementation of the scheduling algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard(More)