Operating System A process may be blocked and located into the corresponding event queue due to waiting for an eventof a specific type, however it recommends that a process be able to only in one event queue at a timeas illustrated in the following figure.Ready QueueReleaseAdmitDispatchProcessorTimeoutEvent 1 QueueEvent 1 WaitEvent 1OccursEvent 2 QueueEvent 2Event 2 WaitОссursEvent n QueueEvent nOccursEvent n Waita) Give an example in which you can demonstrate how to allow a process to wait for more thanone event at the same time.b) In that circumstance, by what means transform the queuing structure of the figure to supportnew feature? Provide the definition of the structures in C/C++ with example.

A process is characterized as a substance which addresses the essential unit of work to be executed…

a) Give an example in which you can demonstrate how to allow a process to wait for more than one event at the same time. b) In that circumstance, by what means transform the queuing structure of the figure to support new feature? Provide the definition of the structures in C/C++ with example.

a) Give an example in which you can demonstrate how to allow a process to wait for more than one event at the same time. b) In that circumstance, by what means transform the queuing structure of the figure to support new feature? Provide the definition of the structures in C/C++ with example.

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

The ready queue is divided into numerous queues by the Multilevel scheduling algorithm, each with its own scheduling policy or procedure. Decide on one of the following: Is this a fact or a myth? Processes should be scheduled in such a way as to minimise the time they spend waiting. Pick one: A True or False
On an electronic exchange, investors issue buy and sell orders for certain stocks, indicating the greatest purchase price or the lowest sale price they are ready to pay as well as the number of shares they desire to trade at that price. Create a programme that utilises priority queues to connect buyers and sellers, then simulate and test it. Continually execute transactions anytime a new order can be matched with an existing order or orders by maintaining two priority queues, one for buyers and one for sellers.
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ a) assigning ready processes to CPU b) assigning ready processes to waiting queue c) assigning running processes to blocked queue d) all of the mentioned
Deadlocks occur when two or more processes wait an excessive amount of time for resources provided to another process, while another event waits for an event that is triggered by another.
You were asked to design a smart control unit for a printer. The printer can print three types of documents: pdf, MSWord, and JPG (images).The smart printer keeps the documents sent for printing in a queue. It can perform 2 types of operations on the jobs in the queue. These are:(1) Add colored frame, which displays a colored frame on the edges of the printed paper. (2) Add background, which adds some background on the printed paper.The control unit should be designed in a way that allows clients to perform any operation on the jobs in the queue. So the problem is that you have a collection of heterogeneous objects, on which you want to perform similar operations. The design also allows adding more operations upon client's needs.Which design pattern best fits the problem above? 1)Iterator2)Command3)Strategy4)Visitor
17. A process is starved a. if it is permanently waiting for a resource b. if semaphores are not used c. if a queue is not used for scheduling d. if demand paging is not properly implemented
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. Identify the user group that would find this most advantageous. Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. What are the parameters that affect the efficiency of the round robin?
Assume that the Ready Queue contains several Processes with varying burst times. If the scheduling algorithm is Round Robin with a time quantum longer than the burst times of all processes, which processes will be completed first? Your response: o Initial Procedure O Final Procedure The quickest method • Longest Process?? O Process with a burst time equal to time quantum (q)
The ready queue is subdivided into many queues by the multilevel scheduling algorithm, and each of these queues has its own scheduling technique or policy. Choose one: Is it accurate or erroneous? The time a process spends waiting should be minimised by the CPU scheduler. Choose one: OFalse O True
Why is it advantageous that, in a system with cooperative multithreading, two threads communicate with each other not directly, but via the event queue? What would be the disadvantage of direct communication
Write a python program that does the following: 2.1 Create two processes and one queue. 2.2 The first process must put commands into the queue. The commands are 2.2.1. id 2.2.2. whoami 2.2.3. pwd 2.2.4. ls 2.2.5. cat 2.3 The second process must get the elements from the queue and execute them using the os module. If the command is cat, then the script must ask the user for the file name to view its contents. Note: Don’t forget to use a proper lock to prevent any errors in the code
If you are working with scheduling policies, you are requested to investigate the variation of round robin in which a process that has used its full time quantum is returned to the end of the READY queue, while one that has used half of its time quantum is returned to the middle of the queue and one that has used one-fourth of its time quantum goes to a place one-fourth of the distance away from the beginning of the queue. 5.1 Explain the advantages and disadvantages of this scheduling policy. 5.2 Identify the user group that would find this most advantageous. 5.3 Describe the unique threats to a data centre posed by disgruntled employees. Describe how you would identify such people, if possible, and how you would protect your system from these threats. 5.4 What are the parameters that affect the efficiency of the round robin?