Rao, M.V.P.Shet, K.C.Balakrishna, R.Roopa, K.2026-02-062008Proceedings - International Conference on Advanced Information Networking and Applications, AINA, 2008, Vol., , p. 1-61550445Xhttps://doi.org/10.1109/WAINA.2008.33https://idr.nitk.ac.in/handle/123456789/33289We discuss scheduling techniques to be used for real-time, embedded systems. Though there are several scheduling policies, the preemptive scheduling policy holds promising results. In this research paper, the different approaches to design of a scheduler for real-time Linux kernel are discussed in detail. The comparison of different preemptive scheduling algorithms is performed. Hence, by extracting the positive characteristics of each of these preemptive scheduling policies, a new hierarchical scheduling policy is developed. The proposed hierarchical scheduling for real time and embedded system will be implemented for a prototype system, using C or C++ language. It is expected that the new scheduling algorithm will give better performance with respect to satisfy the needs, such as time, capturing and usage of resources of different applications. © 2008 IEEE.DeadlineedffcfshrrnLinuxPreemptionrmsRound robinRTOSsjn