Operating System Cpu Scheduling Algorithms
Download Operating System Cpu Scheduling Algorithms PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Operating System Cpu Scheduling Algorithms book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Program scheduling and simulation in an operating system environment
Research Paper (postgraduate) from the year 2011 in the subject Computer Science - Commercial Information Technology, grade: A, Massachusetts Institute of Technology, language: English, abstract: CPU scheduling is a technique used by computer operating systems to manage the usage of the computer’s central processing unit. In a multi-programming environment whereby several processes are running on the same processor, it is essential to use scheduling criteria to avoid collisions in the computer’s operations. This will help users in a given information technology oriented firm to share server spaces and resources like printers and file storage spaces. In the multi-tasking environment, a program called CPU scheduler selects one of the ready processes and allocates the processor to it. There are a number of occasions when a new process can or must be chosen to run: When a running process block and changes its state to ‘Blocked’, When a timer for a running process expires, When a waiting process unblocks and changes its state to ‘Ready’, and When a running process terminates and changes its state to ‘Exit’ (Wikipedia, 2013). Different types of scheduling programs referred to as algorithms can be employed in CPU scheduling instances. Among the most popular scheduling algorithms is Shortest Job First (SJF). SJF gives the processor to the process with the shortest next time allocation known as the burst. If there are processes with similar CPU bursts in the event queue, the scheduler uses First Come First Served algorithm which allocates the first process to arrive in the queue to the processor regardless of its burst time. It operates under the assumption that the length of the next CPU burst of each of the processes in ready queue is known (CPU scheduling, 2013). The SJF algorithm can be used in both pre-emptive and non-preemptive methods. The algorithm can be preemptive or not. Shortest Job First with preemption uses priority measure to determine the next process to be given the CPU. The processes will be having different CPU bursts and different priority levels allocated to them. The process with the least priority magnitude is always picked next. A process already allocated the processor can be preempted the CPU and allocation done to another process with higher priority when such a process arrives in the queue. SJF with non-preemptive operates in the normal procedure whereby the job with the least CPU burst in the waiting queue is always picked next for allocation of the CPU and the rest of the processes have to wait no matter their urgency. Based on the introduction above, it is essential to use the right CPU scheduling strategy to help us achieve
Operating System Concepts
Author: Mr. Rohit Manglik
language: en
Publisher: EduGorilla Publication
Release Date: 2024-07-22
EduGorilla Publication is a trusted name in the education sector, committed to empowering learners with high-quality study materials and resources. Specializing in competitive exams and academic support, EduGorilla provides comprehensive and well-structured content tailored to meet the needs of students across various streams and levels.
Operating Systems (Self Edition 1.1.Abridged)
Some previous editions of this book were published from Pearson Education (ISBN 9788131730225). This book, designed for those who are taking introductory courses on operating systems, presents both theoretical and practical aspects of modern operating systems. Although the emphasis is on theory, while exposing you (the reader) the subject matter, this book maintains a balance between theory and practice. The theories and technologies that have fueled the evolution of operating systems are primarily geared towards two goals: user convenience in maneuvering computers and efficient utilization of hardware resources. This book also discusses many fundamental concepts that have been formulated over the past several decades and that continue to be used in many modern operating systems. In addition, this book also discusses those technologies that prevail in many modern operating systems such as UNIX, Solaris, Linux, and Windows. While the former two have been used to present many in-text examples, the latter two are dealt with as separate technological case studies. They highlight the various issues in the design and development of operating systems and help you correlate theories to technologies. This book also discusses Android exposing you a modern software platform for embedded devices. This book supersedes ISBN 9788131730225 and its other derivatives, from Pearson Education India. (They have been used as textbooks in many schools worldwide.) You will definitely love this self edition, and you can use this as a textbook in undergraduate-level operating systems courses.