Optimal reward-based scheduling for periodic real-time tasks

Aydın, Hakan; Melhem, Rami; Mossé, Daniel; Mejía-Álvarez, Pedro

doi:10.1109/12.908988

Cited by 114 publications

(15 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…i and d i are the start time and the deadline of task τ i , respectively. l i is the period of task τ i , which is also equal to the scheduling horizon H. We introduce a linear QoS function f i (o i ) for each task τ i , where the generated QoS increases uniformly with the number of optional cycles, decided for actual execution [5].…”

Section: Node Graphmentioning

confidence: 99%

See 1 more Smart Citation

Real-Time Imprecise Computation Tasks Mapping for DVFS-Enabled Networked Systems

Kritikakou²,

Sentieys³

et al. 2021

IEEE Internet Things J.

View full text Add to dashboard Cite

Networked systems are useful for a wide range of applications, many of which require distributed and collaborative data processing to satisfy real-time requirements. On the one hand, networked systems are usually resource constrained, mainly regarding the energy supply of the nodes and their computation and communication abilities. On the other hand, many realtime applications can be executed in an imprecise way, where an approximate result is acceptable as long as the baseline Quality-of-Service (QoS) is satisfied. Such applications can be modeled through Imprecise Computation (IC) tasks. To achieve a better trade-off between QoS and limited system resources, while meeting application requirements, the IC-tasks must be efficiently mapped to the system nodes. To tackle this problem, we firstly construct an IC-tasks mapping problem that aims to maximize system QoS subject to real-time and energy constraints. Dynamic Voltage and Frequency Scaling (DVFS) and multi-path routing are explored to further enhance real-time performance and reduce energy consumption. Secondly, based on the problem structure, we propose an optimal approach to perform IC-tasks mapping and prove its optimality. Furthermore, to enhance the scalability of the proposed approach, we present a heuristic IC-tasks mapping method with low computation time. Finally, the simulation results demonstrate the effectiveness of the proposed methods in terms of the solution quality and the computation time.

show abstract

Section: Node Graphmentioning

confidence: 99%

“…In many application domains [5], such as multimedia processing, mobile target tracking, real-time heuristic search, information gathering and control engineering, an approximate result, obtained before the deadline, is usually acceptable. For example, in video streaming, frames with a lower quality are better than totally missing frames.…”

Section: Introductionmentioning

confidence: 99%

Real-Time Imprecise Computation Tasks Mapping for DVFS-Enabled Networked Systems

Kritikakou²,

Sentieys³

et al. 2021

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…• Task execution order is known. • We also determine for a task t i : (1) initial processor frequency of task execution, denoted as f ti , (2) worstcase execution time including mandatory and optional parts, (3) starting time, and (4) the statically determined (initial) optional cycle o i [6], [17]. The dynamic scheduling algorithm aims at further enhancing the execution quality of IC tasks by making use of online slack time τ s and slack energy E s .…”

Section: Problem Formulationmentioning

confidence: 99%

“…We have formally proved that the whole slack should be distributed to the largest QoS-gradient descendant tasks, and proposed an intra-task voltage scaling scheme [5]. Aydin et al [6] provide an optimal static scheduling solution using convex programming. The above works target at single processor systems, while we explore multiprocessor scenarios.…”

Section: Related Workmentioning

confidence: 99%

“…As adaptability is recognized as the future trend of embedded systems, application QoS flexibility has drawn increasing interest in both research [1], [2], [4]- [6] and real-life application developments [9]- [12]. The Imprecise-Computation (IC) model [1], [2], [17], by defining mandatory and optional execution portions of a task, can realize execution quality adaptation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Scheduling of Imprecise-Computation Tasks on Real-Time Embedded Multiprocessors

Veeravalli

et al. 2013

2013 IEEE 16th International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

Adaptability as an emerging design trend for embedded systems has been of increasing interest. As the representative QoS-adaptable application/software model, ImpreciseComputation (IC) gains growing attentions on its ability to provide scalable execution quality by trading-off system resources. Tight coupling between application temporal characteristics and execution quality makes scheduling imperative. While existing QoS-aware scheduling methods are applicable for uniprocessor scenarios, few efforts address the multiprocessor problem. Moreover, significant leakage contribution to energy consumption, due to advanced silicon processing technology, has further complicated the scheduling problem.In this paper, we present a dynamic scheduling algorithm for IC-modeled tasks on real-time embedded multiprocessor systems, aiming at maximizing runtime QoS under timing and energy constraints. Based on the idea of runtime slack reclamation, we firstly analyze the key factors that affect the QoS optimality during slack distribution. The optimality analysis, then, serves as a guideline for a dual-phase slack receiver selection scheme that identifies the best slack receiver candidates. Compared to state-of-the-art dynamic algorithms, our approach can achieve 54.9% more QoS increase with negligible runtime overhead.

show abstract

Fault‐tolerant procedures for redundant computer systems

Samet

2008

Quality & Reliability Eng

View full text Add to dashboard Cite

Real-time computer systems deployed in life-critical control applications must be designed to meet stringent reliability specifications. The minimum acceptable degree of reliability for systems of this type is '7 nines', which is not generally achieved. This paper aims at contributing to the achievement of that degree of reliability. To this end, this paper proposes a classification scheme of the fault-tolerant procedures for redundant computer systems (RCSs). The proposed classification scheme is developed on the basis of the number of counteracted fault types. Table I is created to relate the characteristics of the RCSs to the characteristics of the fault-tolerant procedures. A selection algorithm is proposed, which allows designers to select the optimal type of fault-tolerant procedures according to the system characteristics and capabilities. The fault-tolerant procedure, which is selected by this algorithm, provides the required degree of reliability for a given RCS. According to the proposed graphical model only a part of the fault-tolerant procedure is executed depending on the absence or presence (type and sort) of faults. The proposed methods allow designers to counteract Byzantine and non-Byzantine fault types during degradation of RCSs from N to 3, and only the non-Byzantine fault type during degradation from 3 to 1 with optimal checkpoint time period.

show abstract

Optimal reward-based scheduling for periodic real-time tasks

Abstract: Abstract

Cited by 114 publications

References 25 publications

Real-Time Imprecise Computation Tasks Mapping for DVFS-Enabled Networked Systems

Real-Time Imprecise Computation Tasks Mapping for DVFS-Enabled Networked Systems

Dynamic Scheduling of Imprecise-Computation Tasks on Real-Time Embedded Multiprocessors

Fault‐tolerant procedures for redundant computer systems

Contact Info

Product

Resources

About