International Journal of Computer Science and Informatics


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.





To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.