Open AccessREAL-TIME SCHEDULING POLICY IN EMBEDDED SYSTEM DOMAIN: A FRAME WORK
Author(s) -
Ashis Kumar Mishra,
Zulfikhar Ahmad,
Yogamaya Mohapatra,
Anil Kumar Mishra
Publication year - 2013
Publication title -
international journal of computer science and informatics
Language(s) - English
Resource type - Journals
ISSN - 2231-5292
DOI - 10.47893/ijcsi.2013.1130
Subject(s) - fair share scheduling , rate monotonic scheduling , computer science , dynamic priority scheduling , two level scheduling , earliest deadline first scheduling , round robin scheduling , fixed priority pre emptive scheduling , least slack time scheduling , flow shop scheduling , lottery scheduling , deadline monotonic scheduling , scheduling (production processes) , distributed computing , real time computing , schedule , mathematical optimization , operating system , mathematics
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.