Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time-sharing and real time operating system. We discuss here different scheduling techniques used in Real-Time systems. Even if there are several scheduling policies, the preemptive scheduling policies hold promising results. In this paper we have done an extensive survey on various scheduling algorithms. We are extracting the positive characteristics of each scheduling and placed it on this paper.
MISHRA, ASHIS KUMAR and AHMAD, ZULFIKHAR
"REAL-TIME SCHEDULING POLICY IN EMBEDDED SYSTEM DOMAIN: A FRAME WORK,"
International Journal of Computer Science and Informatics: Vol. 3
, Article 10.
Available at: https://www.interscience.in/ijcsi/vol3/iss2/10