Comparative Study of Scheduling Algorithms for Multiprocessor Systems
M. Sreenath, P. Vijaya · 2023
Traditional real-time scheduling algorithms are developed employing a standard framework to satisfy the requirements for a rapid execution time, high performance, and low power consumption. However, real-time control is gaining significance for a variety of applications, including manufacturing, data processing systems, aviation, and others. The goal of the current effort is to find the optimal functional analysis of the system while considering performance efficiency and processor use into account as critical components for tasks to be successfully executed within the allocated time. In this study, real-time scheduling methodologies and multiprocessor system scheduling algorithms are compared in order to determine the characteristics that are most useful for classification. The work load should be distributed equitably among the system's various processors in order to prevent faulty operations in an embedded system. Real-time scheduling algorithms are often built utilizing a standard framework in order to meet the demands for lowest execution time, minimal power consumption, and maximum performance. Users can implement new algorithms on various simulation tools.