A SURVEY ON STATIC AND DYNAMIC TASK SCHEDULING ALGORITHMS IN REAL-TIME SYSTEMS

We present the scheduling algorithms of Distributed Real-time Systems in this analysis paper. A real-time system is a type of software where, under a given time period, we have to execute the process with a specific result. Whereas, in the general context, there is no fixed deadline. In reality, scheduling implies performing the operation according to its characteristics and scheduling is done on different processors, one is Uni-processor and one is Multiprocessor and can be performed on the distributed machine as well. Make span length, processor utilization, cache performance, power consumption, task balance, and scheduling penalties are the criteria typically used to evaluate the various scheduling algorithms. The scheduling of real-time assignments consists of 2 sub-problems in the distributed and multiprocessor network: CPU role distribution and scheduling tasks on single processors. The allocation of tasks may be static or interactive. For successful task execution, we'll discuss numerous task allocation algorithms.