?
Effective Scheduling of Strict Periodic Task Sets with Given Permissible Periods in RTOS
P. 214–222.
Zelenov S. V., Zelenova S.
In the paper, we suggest new approach to schedulability problem for strict periodic tasks (a periodic task is strict if it must be started in equal intervals of time – task’s period). Given permissible tasks’ periods, our approach allows to obtain quickly all schedulable sets of tasks with such periods and to build immediately a conflict-free schedule for each obtained set. The approach is based on mathematical methods of graph theory and number theory. We illustrate the approach by a number of examples and present current practical results.
In book
Vol. 11964: Perspectives of System Informatics. , Springer, 2019.
Makogon A., Oleg Sukhoroslov, , in: Supercomputing. 10th Russian Supercomputing Days, RuSCDays 2024, Moscow, Russia, September 23–24, 2024, Revised Selected Papers, Part I* 1.: Springer, 2025. P. 300–318.
Resource allocation and scheduling algorithms play a crucial role in operation of modern computing clusters. The algorithms used and their settings can significantly impact cluster utilization, application performance, and user experience. This area of research requires the use of simulators to quickly test a hypothesis or conduct comparative testing of different algorithms. This paper presents ...
Added: February 22, 2025
Saleh H., IEEE, 2023.
Estimating depth is necessary to understand and navigate the environment surrounding us. Over the years, many active sensors have been developed to measure depth, but they are expensive and require additional space for mounting. A cheaper alternative is estimating depth from a single RGB image taken by an ordinary monocular camera, which can be placed ...
Added: November 30, 2023
A. Lazarev, N. Pravdivets, Grishin E. et al., , in: 13th Multiconference on Control Problems (MCCP 2020) 6-8 October 2020, Saint Petersburg, RussiaVol. 1864.: IOP Publishing, 2021. Ch. 012057.
Added: December 16, 2022
Lazarev A. A., Lemtyuzhnikova D. V., Tyunyatkin A. A. et al., IFAC-PapersOnLine 2022 Vol. 55 No. 10 P. 2881–2886
This research extends the interpolation approach to approximating the objective function value for the minimization maximum lateness problem. The interpolation approach is defined using a special objective function Lmax(α), which is proven to be continuous and depends only on α transform coefficient. Such a function is proven to be monotonically increasing, and this property is ...
Added: December 5, 2022
Oleg Sukhoroslov, Maxim Gorokhovskii, Roman Ilgovskiy et al., , in: Материалы IV Международного семинара по информационным, вычислительным и управляющим системам для распределенных сред (ICCS-DE 2022).: Иркутск: ИДСТУ СО РАН, 2022. P. 79–96.
Resource management is a critical part of modern large-scale distributed systems and an active area of research. The diversity of systems, workloads and requirements have lead to many domain-specific problem statements, solutions and simulation tools proposed by researchers, which are hard to compare and reuse. In this paper, an overview of related resource management problems ...
Added: October 30, 2022
Mukosey A., Semenov A., Lobachevskii Journal of Mathematics 2022 Vol. 43 P. 873–881
In this paper we address the problem of node allocation for high performance computer systems based on the Angara interconnect with the torus topology. Most allocation strategies for the torus topologies assume redundancy, i.e. for a user job it is possible to allocate more nodes than required. We propose the new node allocation algorithm for ...
Added: October 26, 2022
Mylnikov L., Computers & Industrial Engineering 2022 Vol. 163 Article 107807
The problem investigated in the paper is very timely due to the necessity to increase planning and management efficiency of production systems as new innovation products come to the market on a regular basis. This task may be achieved if we upgrade the formalization level by the description of processes which a production system performs to create a ...
Added: October 5, 2022
Suleykin A., Peter B. Panfilov, , in: 2022 8th International Conference on Control, Decision and Information Technologies (CoDIT).: IEEE, 2022. P. 1495–1500.
In this work, benchmarking of production plan processing applications based on data storage and analytics solutions using open source technologies was performed. The functional and component architecture of a digital framework for processing production plan files is presented, with special attention to the performance analysis of data processing based on the measurement of processing time ...
Added: September 23, 2022
Sukhoroslov O. V., The Journal of Supercomputing 2021 No. 77 P. 7989–8012
Workflows that consume and produce large amounts of data are being widely used in modern scientific computing and data processing pipelines. Scheduling of data-intensive workflows requires a careful management of data transfers between tasks, since network contention can significantly impact the workflow execution time. The paper presents and evaluates several scheduling algorithms, data transfer strategies ...
Added: October 29, 2021
Sukhoroslov O. V., Voloshinov V., Smirnov S., , in: Supercomputing. RuSCDays 2020. Communications in Computer and Information ScienceVol. 1331: 6th Russian Supercomputing Days, RuSCDays 2020, Moscow, Russia, September 21–22, 2020, Revised Selected Papers.: Switzerland: Springer, 2020. P. 634–646.
Added: October 29, 2021
Tutelian S., Bankov D., Shmelkin D. et al., Sensors 2021 Vol. 21 No. 18 Article 6099
This paper studies the usage of orthogonal frequency division multiple access (OFDMA) for uplink transmissions in IEEE 802.11ax networks. OFDMA enables simultaneous multi-user transmissions in Wi-Fi, but its usage requires efficient resource allocation algorithms. These algorithms should be able to adapt to the changing channel conditions, including the frequency-selective fading. This paper presents an OFDMA ...
Added: October 12, 2021
Toporkov V., Yemelyanov D., Anna Toporkova, Simulation Modelling Practice and Theory 2021 Vol. 107 No. February 2021 P. 102228
Abstract
In this work, an approach for a preference-based job-flow scheduling in Grid virtual organizations is proposed and studied. Virtual organizations provide uniform rules of the resources sharing and consumption and should respect individual and common preferences of its stakeholders: users, resource providers and administrators. In most cases, a virtual organization’s stakeholders pursue contradictory market-based goals, ...
Added: December 11, 2020
Lazarev A. A., Lemtyuzhnikova D., Werner F., Applied Mathematical Modelling 2021 Vol. 89 No. 2 P. 1163–1176
NP -hard scheduling problems with the criterion of minimizing the maximum penalty, e.g. maximum lateness, are considered. For such problems, a metric which delivers an upper bound on the absolute error of the objective function value is introduced. Taking the given instance of some problem and using the introduced metric, the nearest instance is deter- ...
Added: September 5, 2020
Gafarov E., Lazarev A. A., Werner F., Automation and Remote Control 2020 Vol. 81 No. 5 P. 853–868
In this paper, we consider the problem of minimizing total weighted tardiness for equal-length jobs with arbitrary release dates on a single machine. This problem is mentioned as a minimal open problem, see http://www2.informatik.uni osnabrueck.de/knust/class/dateien/classes/ein_ma/ein_ma, i.e., its complexity status is still open. The latest results on this problem were presented in the years 2000 and ...
Added: September 1, 2020
Lazarev A. A., Grishin E. M., Galakhov S. A. et al., IFAC-PapersOnLine 2019 Vol. 52-13 P. 951–956
This paper is devoted to the problem of scheduling maintenance of locomotives in a depot. The problem based on the operation Eastern polygon of Russian Railways. A heuristic algorithm and a constraint programming model are presented. Numerical experiments on real data for real depot configurations were carried out to compare the performance of the heuristic ...
Added: April 27, 2020
Lazarev A. A., Lemtuzhnikova D., Werner F., /. 2019.
We consider NP-hard multi{machine scheduling problems with the criterion of minimizing the maximum penalty, e.g. maximum lateness. For such problems, we introduce a metric which delivers an upper bound on the absolute error of the objective function value. Taking the given in- stance of some problem and using the introduced metric, we determine the nearest ...
Added: April 26, 2020
Toporkov V., Yemelyanov D., Toporkova A. S., , in: Parallel Computing Technologies. PaCT 2019. Lecture Notes in Computer Science, vol 11657.: Springer, 2019. P. 80–92.
In this work, a preference-based resources allocation algorithm for a job-flow scheduling in Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. The algorithm performs resources selection optimization ...
Added: October 23, 2019
Toporkov V., Toporkova A. S., Yemelyanov D., , in: Intelligent Distributed Computing XIII.: Switzerland: Springer, 2020. P. 160–169.
In this work, an approach for a preference-based job-flow scheduling in Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. Fair scheduling policies in VOs assume resources distribution ...
Added: October 23, 2019