Task scheduling methods in real-time systems
Abstract
Real-time systems are an integral part of modern technologies, covering the areas of production automation, medical devices, transport systems and other critical areas. These systems require ensuring timely and reliable execution of tasks, which makes the issue of effective dispatching particularly relevant. This article presents an overview and analysis of modern methods of dispatching tasks in real-time systems, including static, dynamic and combined approaches. The paper highlights the importance of balancing predictability and flexibility in dispatching methods to improve system efficiency and reliability. Special attention is paid to key challenges such as load balancing between processors, ensuring reliability and fault tolerance, efficient use of resources, dynamic adaptation to changing conditions and consideration of power consumption. The development of new methods and the improvement of existing approaches must take these challenges into account to achieve optimal performance. Special attention is paid to the prospects of using machine learning for load forecasting and dynamic optimization of dispatching algorithms. The use of such technologies allows to significantly increase the efficiency and reliability of real-time systems, providing adaptive management of tasks in real time. The mathematical modelling carried out in the article allows to evaluate the effectiveness of different dispatching methods according to key criteria such as response time, throughput, scalability, resource utilization, reliability and flexibility. The results show that no method is universally best, and the choice of the optimal approach depends on the specific requirements of a particular system. The paper outlines directions for further research, including the integration of machine learning techniques to improve the adaptability and performance of real-time systems. This is an important step in overcoming the challenges of optimizing the use of resources and meeting deadlines in a changing environment, which will contribute to further progress in this field.
References
2. Kumar, A. & Alam, B. (2018). Task Scheduling in Real Time Systems with Energy Harvesting and Energy Minimization. Journal of Computer Science, 14(8), 1126-1133. URL: https://doi.org/10.3844/jcssp.2018.1126.1133
3. Kohútka L. A New FPGA-Based Task Scheduler for Real-Time Systems. Electronics. 2023, 12(8), 1870. URL: https://doi.org/10.3390/electronics12081870
4. Sprunt, B., Sha, L. & Lehoczky, J. Aperiodic task scheduling for Hard-Real-Time systems. Real-Time Syst 1, 27–60 (1989). https://doi.org/10.1007/BF02341920
5. J. Lehoczky, L. Sha and Y. Ding, «The rate monotonic scheduling algorithm: exact characterization and average case behavior,» [1989] Proceedings. Real-Time Systems Symposium, Santa Monica, CA, USA, 1989, pp. 166-171. URL: https://doi.org/10.1109/REAL.1989.63567
Abstract views: 36 PDF Downloads: 40