Justify why a batch operating system would be incapable of handling current applications such as airline bookings and automated teller machines. In a time-sharing system, the value selected for a time slice has a significant impact on system performance. Explanation of what would happen if the time slice value you specified was too large. Assume it was insufficiently large.

Justify why a batch operating system would be incapable of handling current applications such as airline bookings and automated teller machines. In a time-sharing system, the value selected for a time slice has a significant impact on system performance. Explanation of what would happen if the time slice value you specified was too large. Assume it was insufficiently large.

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

Amdahl’s Law is as applicable to software as it is to hardware. An oft-cited programming truism states that a program spends 90% of its time executing 10% of its code. Thus, tuning a small amount of program code can often have an enormous effect on the overall performance of a software product. Determine the overall system speedup if:Q.) 80% of a program is made to run 20% faster.
Amdahl’s Law is as applicable to software as it is to hardware. An oft-cited programming truism states that a program spends 90% of its time executing 10% of its code. Thus, tuning a small amount of program code can often have an enormous effect on the overall performance of a software product. Determine the overall system speedup if:Q.) 90% of a program is made to run 10 times as fast (900% faster).
NOTE: "Exekveringstid(ms)" means execution time or burst time in milliseconds Assume that a system with a CPU at one time has the following processes queued in the CPU's READY queue: Calculate the waiting time for the seven processes: 1) If FCFS is being used 2) If LRU is being used 3) If RR with time quantum of 8ms
When it comes to process execution, what is the advantage of first allocating it to the I/O queue and then pushing it to the CPU when it is ready? What, in your opinion, will happen if the I/O is not completed correctly? Is the CPU burst going to be affected? What do you mean?
According to Amdahl's Law, what is the maximum possible % reduction in execution time when:process A, which currently runs 19% of the time, is optimized to run faster.
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%.
There are a number of benefits that come from the practise of first delegating the execution of a process to an input/output queue and then, once the CPU is ready, handing control back to it. Who knows what may occur if the input/output is suddenly stopped? Will there be an impact on the burst of the central processing unit? How exactly does this hold true?
When feasible, what are the upsides of prioritizing the I/O queue as the place where processes would be executed? If the I/O connection suddenly goes down, what do you expect to happen? How would this affect the fastest possible CPU burst rate? I'm not quite sure I get what you're getting at here.
The most effective method of process scheduling has been shown to be
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…
Keeping in mind that there are presently two processes active; postponing execution till after one of the processes has finished. You can think that phase 1 is the most important of the two phases, while the other one is on the lower end of the importance scale. Only a single action at a time may be stored in the primary memory. How does the central processing unit calculate anything like that? Both options contain the phases that are necessary for the operation of a CPU, but which one is better?
Is it possible to halt the execution of one process while it is simultaneously carrying out another process? Could you please elaborate on your answers?