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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A deadlock occurs in an operating system when a process enters an endless waiting state due to another process holding a requested resource. Suggest THREE (3) strategies to avoid a stalemate, and use examples from the actual world to illustrate each one.
(For the following short questions, provide a 3-4-line answer. The answer should be based on your analysis and critical thinking) Consider there are two set of processes Set1 has processes with longer burst times than Set2. The operating system is implementing Shortest Job First (SJF) for Scheduling. Which SJF approach is suitable for Set1 and Set2 (choose from Preemptive and Non-Preemptive). Justify your answer. Can we improve overall process execution performance by increasing RAM size? What are the pros and cons of increasing RAM size? What is the role of IO devices in process execution? What are the reasons for a process to exit from running state other than it finishes? If OS claims provision of protection and sharing mechanisms at the same time, do these mechanisms not violate the purpose of each other? Justify. Why is synchronization necessary among processes when all of them are executing on a single CPU machine and only one of them can actually execute at any one moment?…
Determine what is the type of decision mode (non-preemptive or preemptive) to be exercised on a process during uniprocessor scheduling under the following circumstances: a. A process is aborted. Interrupt take place based on a certain clock interval. A process is requesting for I/O. A new process arrival. A process is requesting for operating system services.
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time Pl 0.0 8 P2 0.4 4 P3 1.0 1 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm?b. What is the average turnaround time for these processes with the SJF scheduling algorithm? c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not k11ow that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge…
Quiz 3 (Scheduling - Operating Systems Principles) 2. Process p is currently running when process q arrives at the Ready List. The Operating System waits until p is done processing before scheduling q. This is an example of _____________________. delayed scheduling non-preemptive scheduling just-in-time scheduling preemptive scheduling 3. Process p starts running at time 0, becomes blocked at time 5, and starts running again at time 9. Process p's attained CPU time under long-term scheduling at time 10 is ____________ time units. 5 10 9 6 4. Using FIFO scheduling, answer the following about the processes below: Process Arrival Time CPU Time p1 0 8 p2 4 6 p3 6 3 End of p1: [ Select ] Start of p3: [ Select ] Start of p2: [ Select ] 5.Using SRT scheduling, answer the following about the processes below: Process Arrival Time CPU Time p1 0 8 p2 1 2 p3 4 3 End of p3: [ Select ] Start of p2: [ Select ] End of p1: [ Select ]
76. To ensure that the hold and wait condition never occurs in the system, it must be ensured that : a. whenever a resource is requested by a process, it is not holding any other resources b. each process must request and be allocated all its resources before it begins its execution c. a process can request resources only when it has none d. all of the mentioned
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?
When a process p requests a resource using the request resource function, its state is set to ______________ if the requested resource is unavailable. Ready Blocked Ready Suspended The PCB contains an out-of-date copy of the CPU state of process Q when Q is running. True False The main benefit of using virtual CPUs is that they increase processing speed. True False
QUESTION 1: Briefly describe the three types of processor scheduling. QUESTION 2: What is the difference between preemptive and non-preemptive scheduling? There is a currently running process and a new process arrives. And OS moved the currently running process to the Ready state. What kind of scheduling policy is the OS’s selection function used for this case.?
1. What challenges are likely to arise if an operating system lacks a method for process synchronisation? Give an example to back up your response.
Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…
subject:operating system Question # 3 Consider two resources are available and value of semaphore is 2. Now consider operations P() and V() and their execution sequenceP(), P(), V(), P(), P(), V(), P(), P(), P(), V(), V(), P(). Answer the followings after the completion of above functions: Number of process which are sleeping on P()? What will be the value of semaphore? Number of available resources? Find the value of logical address and limit register. The value of base register is 400K and value of physical address is 532k.