Scheduling Algoritma di Sistem Operasi Real-Time

Arie Miftah Budiman (Universitas Pelita Bangsa)
Moh. Restu Nur Rizki (Universitas Pelita Bangsa)
Ridwan Ahri (Universitas Pelita Bangsa)
Rafi Suswidia (Universitas Pelita Bangsa)
Abdul Halim Anshor (Universitas Pelita Bangsa)

Jurnal Penelitian Rumpun Ilmu Teknik
Vol. 4 No. 3 (2025): Jurnal Penelitian Rumpun Ilmu Teknik

Real-time operating systems (RTOS) are critical components in various applications requiring rapid response times and high precision, such as in the automotive, medical, and telecommunications industries. Scheduling algorithms in these systems function to allocate CPU time for task execution according to priority, ensuring each task is completed before its deadline. This study aims to evaluate key algorithms, such as Rate Monotonic Scheduling (RMS), Earliest Deadline First (EDF), and heuristic-based algorithms, to identify the most effective method in meeting real-time system requirements. Based on literature analysis, RMS and EDF each exhibit advantages in specific scenarios, while hybrid algorithms show potential for further development.