College of Computer Science, Zhejiang University
Hangzhou, Zhejiang, China, 310027
This paper proposes a scheduling algorithm specially for embedded systems. To meet the requirement of real-time systems, we divide tasks into groups based on their resource requirements. In this way, the switch can be done more effectively. The algorithm is static and pre-built because embedded systems have some remarkable features. Real-time tasks and interrupts are important, so the algorithm takes them as a special part.
This paper was originally presented at the Eighth Real-Time Linux Workshop held at the at the School for Information Science and Engineering, Lanzhou University, in Lanzhou, China.