In this chapter, the scheduling algorithms that are specifically designed to handle the stringent timing requirements in GPUs are investigated. These schedulers incorporate features like task preemption, where higher-priority tasks can interrupt and take precedence over lower-priority ones, ensuring that critical tasks meet their deadlines. By focusing directly on meeting the exact timing constraints and managing task priorities explicitly, these scheduling methods provide robust and reliable performance in demanding real-time applications. We classify explicit real-time scheduling methods into two main categories: (1) Non-preemptive scheduling methods and (2) Preemptive scheduling methods. Non-preemptive scheduling ensures that once a task starts executing, it runs to completion without interruption, thus reducing the overhead caused by context switching and allowing for more predictable execution times. In contrast, Preemptive scheduling allows tasks to be interrupted and resumed later, ensuring higher-priority tasks can take precedence as needed, which enhances system responsiveness.