Question No 2: Topic: CPU Scheduling, Consider you are given a task to design a CPU scheduling algorithm. The algorithm is to be designed using a single processor and algorithm is to work on a patient monitoring device. What essential signs are to be monitored using the device are not mentioned, but the device is capable to read around 5-10 different essential signs. Every essential sign will have some sensors, an examination module and a display window to display the result. Considering the mentioned scenario which of the given CPU scheduling method/algorithm will you use. Explain your answer in detail. First-Come, First-Served Shortest-Job-First i. ii. iii. iv. Priority Round-Robin V. Multi-Level Queue

Question No 2: Topic: CPU Scheduling, Consider you are given a task to design a CPU scheduling algorithm. The algorithm is to be designed using a single processor and algorithm is to work on a patient monitoring device. What essential signs are to be monitored using the device are not mentioned, but the device is capable to read around 5-10 different essential signs. Every essential sign will have some sensors, an examination module and a display window to display the result. Considering the mentioned scenario which of the given CPU scheduling method/algorithm will you use. Explain your answer in detail. First-Come, First-Served Shortest-Job-First i. ii. iii. iv. Priority Round-Robin V. Multi-Level Queue

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

A(n) _____ is a measure of CPU or computer system performance when per-forming specific tasks.
What are the requirements for CPU scheduling? Explain in detail 2 in terms of the optimization issue.
In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.Both tasks are available in the system at the same time t=9:00:00.000 and order of arrival is the obviousX followed by Y. (The decimals reflect milliseconds if they showup in an indicated time reference.) There are no other processes (tasks) in the system other than X,Y. 1234567890 XYXYX--YXY The time line 1 indicates that at t=9:00:00s task X starts its execution and when t=9:00:01s is reached task Y takes over. The time line 1 indicates the 'first second' and time line 0 indicates the 'tenth second' above.Task Y completes its execution at t=9:00:10s, the completion of the tenth second since X started its execution. Task X has completed its execution earlier. (a) What is the total number of context switches starting from prior to t=9:00:00s (e.g. t=8:59:59.999) through thecompletion of $Y$? answer is 16s (b) What is the turnaround time for Y? answer is 10s (c) What is…
In a multiprogrammed environment with 32MB of RAM where all processes require9MB of unshared RAM and spend 40% of their time in I/O wait, calculate themaximum achievable CPU utilization. If the RAM available is increased by 700%and time spent in I/O wait increases by 100%, calculate how much RAM will remainunused when CPU utilization is just above 99%.
On both uniprocessor and multiprocessor computers running a range of operating systems (Linux, Windows, Mac, Android, etc.), several multithreading approaches are examined. The CPU Scheduling Algorithm should be compared to similar algorithms (article). ,
Assuming that two processes are currently running; delaying execution before one of the processes completes. For the most part, you may consider the phase 1 is the most essential and the other is less important. The main memory can store just one action at a time. The CPU explains how it performs calculation on that? The choices of both include the stages involved in the functioning of a CPU?
assuming that there are two processes in secondary memory that are prepared to run. The first process is the most crucial, whilst the second is the least crucial, in terms of the processes. One process can only be active at once in the main memory. Describe how the CPU carries it out. You have the choice to describe the procedure utilizing any part of the CPU.
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.?
Our favorite program runs in 8 seconds on computer A, which has a 2 GHz clock. We are trying to help a computer designer build a computer, B, that will run this program in 4 seconds. The designer has determined that a substantial increase in the clock rate is possible, but this increase will affect the rest of the CPU design, causing computer B to require 1.3 times as many clock cycles as computer A for this program. What clock rate should we tell the designer to target?
In a microprocessor-based system with several tasks that are supposed to be executed more or less simultaneously, there is a necessary condition for the sum of the computing times of the tasks. Please state this.
Different multithreading techniques for uniprocessor and multiprocessor systems in various operating systems (Linux/Windows/Mac/Android, etc.) are compared. Describe the CPU Scheduling Algorithm in a similar way (article). ,