CPU Scheduling Algorithms: A Survey
Journal: International Journal of Advanced Networking and Applications (Vol.5, No. 04)Publication Date: 2014-01-06
Authors : Imran Qureshi;
Page : 1968-1973
Keywords : Burst Time; CPU Scheduling; Operating System; Round Robin; Scheduling Algorithms;
Abstract
Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, and Priority scheduling algorithm.
Other Latest Articles
- Building Applications with Social Networking API’s
- Review on Vertical Handover Techniques among Heterogeneous Networks
- Environmental Monitoring and Greenhouse Control by Distributed Sensor Network
- Evaluate Dynamic Source Routing Protocol Performance in Wireless MANET
- A Study on Dynamic Source Routing In Ad Hoc Wireless Networks
Last modified: 2015-12-02 17:58:28