Scheduling non-preemptive hard real-time tasks with strict periods

Marouf, Mohamed; Sorel, Yves

doi:10.1109/etfa.2011.6059014

Cited by 25 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We assume a time-triggered scheduler, which assigns a constant phase to each time-triggered task τi, presented in [9,10] and explicitly in [5] without considering NoCs. A phase determines the a priori known time shift between the start of a task and its arrival time.…”

Section: Time-triggered Constant Phase (Ttcp) Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Sporadic Task Handling in Time-Triggered Systems

Freier

Chen

2016

Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

Scheduling of real-time applications is an important research topic. We consider a large-scale application consisting of 100-1000 tasks with inter-task communications, which can be represented by a task graph. For scheduling these applications, previous research results have shown that the timetriggered scheduling approach is capable to effectively utilize real-time platforms. However, the time-triggered scheduling approach only supports periodically activated tasks. Sporadic (aperiodic) tasks, which are also common in industrial applications, require additional treatments in time-triggered approaches.In this paper, we present a method to handle the sporadic tasks (that are not periodic) by shifting the time-triggered schedule. This method improves the responsiveness of the real-time sporadic tasks, whereas the schedule of the timetriggered tasks remains feasible. We define a time-triggered server to handle sporadic events and reserve time slots to ensure a safe recovery of the delayed time-triggered schedule. If a sporadic task arrives, this task starts its execution during the time-triggered server slot and the current time-triggered schedule is shifted. This paper provides the feasibility analysis for the time-triggered and the sporadic tasks under this slot shifting method. We determine time-triggered scheduling parameters to maximize the performance of the timetriggered server. Experiments confirm higher reachable system utilization by using our slot shifting approach.

show abstract

Section: Time-triggered Constant Phase (Ttcp) Schedulingmentioning

confidence: 99%

“…For scheduling these applications, time-triggered scheduling approaches are capable to effectively utilize a single-core platform [10] or a manycore platform [5], in which the cores are connected by a Network-on-Chip (NoC) platform. The time-triggered scheduling specifies a schedule table and applies this table for task scheduling.…”

Section: Introductionmentioning

confidence: 99%

Sporadic Task Handling in Time-Triggered Systems

Freier

Chen

2016

Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

show abstract

“…So far, non-preemptive real-time scheduling has received considerably less attention in the research community, compared to preemptive real-time scheduling. Marouf et al [14] present a schedulability analysis in the case of non-preemptive tasks with strict periods. Besides, little work related to non-preemptive realtime scheduling in a sensor node platform has been found in the literature.…”

Section: Introductionmentioning

confidence: 99%

Performance study of real-time scheduling schemes in configurable component-based sensor node platforms

Tak

Kim

et al. 2014

Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

This paper presents a performance evaluation of real-time scheduling schemes in configurable component-based sensor node platforms from two perspectives: a configurable component-based sensor node platform and a scheduling scheme for a mix of periodic and aperiodic tasks running on the sensor node platform. We consider two different types of configurable component-based sensor node platforms: event-driven and multi-tasking sensor node platforms. The basic components of these two configurable component-based sensor node platforms are tasks. Tasks are classified to have periodic and aperiodic properties. Periodic tasks need to be processed in a timely fashion and delivered to meet their deadlines, while aperiodic tasks need to be quickly processed for fast responses without missing any periodic task deadlines. Consequently, we present two different scheduling schemes for event-based and multi-tasking sensor node platforms, which attempt to meet the timing constraints of periodic tasks and improve the response time of aperiodic tasks. The experimental evaluation showed that the proposed scheduling schemes yielded efficient performance in terms of the minimal deadline miss ratio of periodic tasks and a fast average response time for aperiodic tasks.

show abstract

“…However, non-preemptive scheduling is worthy of being considered because non-preemptive scheduling algorithms are easier to implement than preemptive scheduling algorithms, and can exhibit lower overhead at run-time. Marouf et al [11] present a schedulability analysis in the case of non-preemptive tasks with strict periods. Besides, little work related to energyaware non-preemptive real-time scheduling has been found in the literature.…”

Section: Introductionmentioning

confidence: 99%

A Study on Real-Time Scheduling for Low-Power Sensor Node Platforms

Tak

Kim

2012

2012 IEEE 12th International Conference on Computer and Information Technology

View full text Add to dashboard Cite

This paper presents a technique to integrate energyaware real-time scheduling into sensor node platforms from the perspective of the combined periodic (or time-bounded) and aperiodic (or time-unbounded) scheduling policy. In the scheduling policy, the first objective is to meet the timing constraints of periodic tasks as well as to improve the response time of aperiodic tasks. The second objective is to minimize the energy consumption in a battery-powered sensor node without missing the timing constraints of periodic tasks. Experiments showed that the proposed scheduling technique achieved efficient performance in terms of the minimal deadline miss ratio of periodic tasks, a fast average response time of aperiodic tasks, and low power consumption.

show abstract

Scheduling non-preemptive hard real-time tasks with strict periods

Abstract: To cite this version:Mohamed Marouf, Yves Sorel. Scheduling non-preemptive hard real-time tasks with strict periods. ETFA '11 -16th

Cited by 25 publications

References 10 publications

Sporadic Task Handling in Time-Triggered Systems

Sporadic Task Handling in Time-Triggered Systems

Performance study of real-time scheduling schemes in configurable component-based sensor node platforms

A Study on Real-Time Scheduling for Low-Power Sensor Node Platforms

Contact Info

Product

Resources

About