CPU scheduling algorithms: Case & comparative study

As applications grow increasingly complex, so do the complexities of the microcontroller-based embedded devices such as cell phones, digital TVs, smart cars, washing machines and so on. Although these recent applications operate in hard constraint conditions, embedded systems are required to respond to external events in a shortest possible time. In this paper, we present a variety of scheduling algorithms for a single microcontroller-based embedded devises with static and dynamic priorities and show a study on different parameters, such as computing time, burst time, waiting times and average turnaround time for each algorithm. This study aims to select the appropriate operating system for the particular situation and also to conceive new solutions that can improve several features such as waiting times and average turnaround time.