Explain different task scheduling algorithms in RTOS.

RTOS task scheduling algorithms determine which task runs when. Priority-based preemptive: Highest priority ready task runs immediately, preempting lower priority tasks; used by most RTOS (FreeRTOS, VxWorks). Round-robin: Equal priority tasks share CPU time in time slices (quantum); ensures fairness. Rate Monotonic (RM): Static priority assignment based on period; shorter period = higher priority; optimal for periodic tasks. Earliest Deadline First (EDF): Dynamic priority based on closest deadline; theoretically optimal but more overhead. Cooperative: Tasks must yield CPU voluntarily; simpler but can cause starvation. Most RTOS combine priority-based with round-robin for equal priorities. Scheduling considerations: Priority inversion handling, starvation prevention, and meeting deadlines.