# Optimal harmonic period assignment: complexity results and approximation algorithms

Research output: Contribution to journal › Article

### Standard

**Optimal harmonic period assignment : complexity results and approximation algorithms.** / Mohaqeqi, Morteza; Nasri, Mitra; Xu, Yang; Cervin, Anton; Årzén, Karl Erik.

Research output: Contribution to journal › Article

### Harvard

*Real-Time Systems*, vol. 54, no. 4, pp. 830-860. https://doi.org/10.1007/s11241-018-9304-0

### APA

*Real-Time Systems*,

*54*(4), 830-860. https://doi.org/10.1007/s11241-018-9304-0

### CBE

### MLA

*Real-Time Systems*. 2018, 54(4). 830-860. https://doi.org/10.1007/s11241-018-9304-0

### Vancouver

### Author

### RIS

TY - JOUR

T1 - Optimal harmonic period assignment

T2 - Real-Time Systems

AU - Mohaqeqi, Morteza

AU - Nasri, Mitra

AU - Xu, Yang

AU - Cervin, Anton

AU - Årzén, Karl Erik

PY - 2018

Y1 - 2018

N2 - Harmonic periods have wide applicability in industrial real-time systems. Rate monotonic (RM) is able to schedule task sets with harmonic periods up to 100% utilization. Also, if there is no release jitter and execution time variation, RM and EDF generate the same schedule for each instance of a task. As a result, all instances of a task are interfered by the same amount of workload. This property decreases the jitters that happen during sampling and actuation of the tasks, and hence, it increases the quality of service in control systems. In this paper, we consider the problem of optimal period assignment where the periods are constrained to be harmonic and the task set is required to be feasible. We study two variants of this problem. In the first one, the objective is to maximize the system utilization, while in the second one, the goal is to minimize the total weighted sum of the periods. First, we assume that an interval is determined a priori for each task from which its period can be selected. We show that both variants of the problem are (at least) weakly NP-hard. This is shown by reducing the NP-complete number partitioning problem to the mentioned harmonic period assignment problems. Afterwards, we consider a variant of the second problem in which the periods are not restricted to a special interval. We present two approximation algorithms with polynomial-time complexity for this problem and show that the maximum relative error of these algorithms is bounded by a factor of 1.125. Our evaluations show that, on the average, results of the approximation algorithms are very close to an optimal solution.

AB - Harmonic periods have wide applicability in industrial real-time systems. Rate monotonic (RM) is able to schedule task sets with harmonic periods up to 100% utilization. Also, if there is no release jitter and execution time variation, RM and EDF generate the same schedule for each instance of a task. As a result, all instances of a task are interfered by the same amount of workload. This property decreases the jitters that happen during sampling and actuation of the tasks, and hence, it increases the quality of service in control systems. In this paper, we consider the problem of optimal period assignment where the periods are constrained to be harmonic and the task set is required to be feasible. We study two variants of this problem. In the first one, the objective is to maximize the system utilization, while in the second one, the goal is to minimize the total weighted sum of the periods. First, we assume that an interval is determined a priori for each task from which its period can be selected. We show that both variants of the problem are (at least) weakly NP-hard. This is shown by reducing the NP-complete number partitioning problem to the mentioned harmonic period assignment problems. Afterwards, we consider a variant of the second problem in which the periods are not restricted to a special interval. We present two approximation algorithms with polynomial-time complexity for this problem and show that the maximum relative error of these algorithms is bounded by a factor of 1.125. Our evaluations show that, on the average, results of the approximation algorithms are very close to an optimal solution.

KW - Hard real-time

KW - Harmonic tasks

KW - Period assignment

KW - Real-time schedulability

UR - http://www.scopus.com/inward/record.url?scp=85045043554&partnerID=8YFLogxK

U2 - 10.1007/s11241-018-9304-0

DO - 10.1007/s11241-018-9304-0

M3 - Article

VL - 54

SP - 830

EP - 860

JO - Real-Time Systems

JF - Real-Time Systems

SN - 1573-1383

IS - 4

ER -