CPU Scheduling Algorithms: A Survey
نویسنده
چکیده
Imran Qureshi Department of Computer Science, COMSATS Institute of Information Technology, Wah Cant Pakistan. Email: [email protected] ----------------------------------------------------------------------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.
منابع مشابه
Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملAn Analytical Study of CPU Scheduling Algorithms
Present paper is the study about most of the CPU scheduling algorithms and its features. In this paper the compression between the algorithms on the same CPU is shown. Using this comparison one can easily understand that what is performing inside the CPU. The aim of this survey is to analyze that CPU scheduler which have maximum efficiency and may also satisfy all the objectives of the scheduling.
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملThe Design and Development of a CPU Scheduling Algorithm Simulator
As an aid to the study of CPU scheduling algorithms for a single CPU, the author has developed an interactive Java-based simulator that uses graphical animation to convey the concepts of various CPU scheduling algorithms including First-Come, First-Served (FCFS), Round-Robin (RR), Shortest-Job-First (SJF), Shortest-Remaining-Time-First (SRTF), Priority Scheduling, and Multilevel Feedback Queues...
متن کامل