When a process is removed by the operating system from the CPU, the information on the current condition of that process needs to be stored, so it is possible restore the process to the same condition when it is return to the CPU. Explain how the relevant information on the condition is stored, and provide two examples of what information is stored. (b) (i) Explain why priorities are used by operating systems when scheduling processes.

When a process is removed by the operating system from the CPU, the information on the current condition of that process needs to be stored, so it is possible restore the process to the same condition when it is return to the CPU. Explain how the relevant information on the condition is stored, and provide two examples of what information is stored. (b) (i) Explain why priorities are used by operating systems when scheduling processes.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 20VE

See similar textbooks

Similar questions

Course: Operating Systems Given below is the pseudocode to synchronize processes P1, P2, P3, P4, P5, and P6 byusing three semaphores X, Y and Z that are initialized as follow: X=0, Y=0, Z= –2. TheOperating System can schedule the processes which are ready to execute in any order.List down at least 5 possible orders of execution in which the processes can run.
When a process is removed by the operating system from the CPU, the information on the current condition of that process needs to be stored, so it is possible restore the process to the same condition when it is return to the CPU. Explain how the relevant information on the condition is stored, and provide two examples of what information is stored. (ii) Examine how the size of the time quantum selected by the operating system impacts on the performance of the Round-Robin algorithm.
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. ’Process Synchronization’ is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called ’Deadlock'.
Explain the difference between nonpreemptive process scheduling and preemptive scheduling in terms of how the operating system makes decisions about the choice of RUNNING process in response to the event types that cause context switch from user to kernel mode.
Explain the difference between non preemptive process scheduling and preemptive scheduling in terms of how the operating system makes decisions about the choice of RUNNING process in response to the event types that cause context switching from user to kernel mode.
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. 'Process Synchronization' is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called 'Deadlock'. In concurrent programming, a "critical section" is a part of a multi-process program thatmay not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do {flag[i] = TRUE;while(flag[j]); %waitCRITICAL SECTIONflag[i] = FALSE;REMAINDER SECTION} while (TRUE);Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) a) Does the given solution satisfy the mutual exclusion requirement? Explain (asimple 'yes-no' answer is NOT enough.…
Assuming that there are three processes in secondary memory; waiting to execute. Considering theprocess 1 has high priority and the other one has the lowest priority, third process has no priority.Only one process can fit in the main memory at one time. Explain how task management is carried outin this process?
A real-time operating system (RTOS) is an operating system (OS) for real-time applications that processes data and events that have critically defined time constraints. An RTOS is distinct from a time sharing operating system, such as Unix, which manages the sharing of system resources with a scheduler, data buffers, or fixed task prioritization in a multitasking or multiprogramming environment. Processing time requirements need to be fully understood and bound rather than just kept as a minimum. All processing must occur within the defined constraints. Real-time operating systems are event-driven and preemptive, meaning the OS is capable of monitoring the relevant priority of competing tasks, and make changes to the task priority. Event-driven systems switch between tasks based on their priorities, while time-sharing systems switch the task based on clock interrupts. Discuss in at most 1 page the idea and requirements of RTOS. show how this OS structure and services can be used in…
In the context of process scheduling, what is the difference between preemptive and non- preemptive scheduling? A) CPU-bound vs I/O-bound processes B) Time-sharing vs Space-sharing C) Priority-based vs Round Robin D) The operating system can interrupt a running process in preemptive scheduling.
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. 'Pro- vess Synchronization' is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called 'Deadlock'. ,In concurrent programming, a "critical section" is a part of a multi-process program that (a) may not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do { flag(i] - TRUE; while (flag[j]); %wait CRITICAL SECTION flag[i] - FALSE; REMAINDER SECTION } while (TRUE); Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) (i) { simple 'yes-no' answer is NOT enough. What is the mutual exclusion requirement? Why is (not?)…
Here are the top five (5) factors that should be considered while formulating a process scheduling policy.
How far (i.e. how far your research goes) can the concept of Mutual Exclusion (ME) be viewed as a required foundation for the efficient operation of an operating system?