This study examines the scheduling hardware for an embedded operating system (OS). This scheduler, which implements task sorting and choosing, is deployed when a new task enters in the system. The scheduler always limits the performance of an embedded operating system, so we consider designing the scheduler within the hardware to accelerate the performance of the OS. Therefore, hardware is used which involves an inserting and removing task in the red-black tree  and a checking of the red-black tree with regards to whether or not its rules are being followed. Additionally, the software communicates with the hardware by sending task data and is designed specifically to build the red/black tree into the hardware. Finally, the scheduler chooses a task from the red-black tree and tells the software to execute the program. In experiments, the performance of the embedded operating system scheduling hardware improves beyond the existing software by 13%.