ALGORITHM FOR SOLVING OPTIMIZATION PROBLEMS OF PREEMPTIVE SCHEDULER
In this paper, we consider a model of the problem to determine the characteristics of the time-step computation process in hard real-time systems. We proposed a formal description of the timestep computation with preemption and its existence conditions. A necessary condition for the feasibility of the schedule was determined. We took into account the behavior of the function graphs to optimize the schedule. We analyzed the mathematical model features including the objective function and the constraints. In the paper we determined the upper and lower limits of total function variation. The possible approaches to solving the optimization problem were introduced. We proposed to solve that task by the branch and bound method. In the proposed approach the objective function is represented as the set or branches included in the method tree. We developed the algorithm to determine characteristics of the time-step computation process and give a detailed description. The performance of the algorithm was shown by test case.
discrete optimization, branch and bound, an algorithm.
Copyright (c) 2014 Y.A. Ivanov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License
Address of the journal editorial office:
Editorial office of the journal «Radio Electronics, Computer Science, Control»,
Zaporizhzhya National Technical University,
Zhukovskiy street, 64, Zaporizhzhya, 69063, Ukraine.
Telephone: +38-061-769-82-96 – the Editing and Publishing Department.
The reference to the journal is obligatory in the cases of complete or partial use of its materials.