| Summary: | 碩士 === 國立成功大學 === 電機工程學系碩博士班 === 100 === In this paper, we focus on the embedded system scheduling in hardware. The scheduling of the operating system achieves the sort of tasks and selects the next execution tasks. When a new task is forked by the operating system, the scheduler will start. Operating system scheduling often limits on its effectiveness, so we explore the Linux scheduling hardware on an ARM platform. We use hardware acceleration to enhance the efficiency of the operating system. In the scheduling hardware, we mainly implement red-black tree algorithm which contains inserting task into the red-black tree, removing the task from the red-black tree, and checking the red-black tree following rules. The scheduling hardware communication between the hardware and software transfer the task to record, build the red-black tree, select the next task which will be implement, and notice software side to receive data from the hardware.
In experiments, inserting the task can save about 20% of the time, and removing the task just can save only about 5%. In average, there is more than 12% time to be saved. When task numbers grow more and more, performance will be critical. Therefore, the hardware scheduling of embedded systems can gain a performance better.
|
|---|
