Install a faster CPU - This will likely have no effect. The limiting factor is available memory per program.
Increase the page size :-This will increase CPU utilization because spatial locality will reduce the number of page faults. This comes at the cost of more internal fragmentation. If taken too far, can reduce the number of programs that can have a working set in memory
install larger hard drive or multiple hard drive :- This will decrease the time spent waiting for pages to be brought in so it’ll increase responsiveness of the system, but since the CPU context switches to other programs anyway, this might not increase CPU utilization that much, if at all. It’s possible that the faster page retrieval limits the number of context switches but, thrashing will still be occuring.
replacing algorithm :- This is increase CPU utilization by avoiding page faults by having the pages pulled into memory before they’re needed.
Will a deadlock be possible? If yes. how to prevent the deadlock without change the nature...
Operating Systems 8.27 Consider a demand-paging system with the following time-measured utilizations: CPU utilization Paging disk Other I/O devices 20% 97 7% 5% For each of the following, indicate whether it will (or is likely to) improve CPU utilization. Explain vour answers. Install a faster CPU. Install a bigger paging disk Increase the degree of multiprogramming. Decrease the degree of multiprogramming Install more main memorv. Install a faster hard disk or multiple controllers with multiple hard disks. Add prepaging to...
1. Consider a demand-paging system with the following time-measured utilizations: CPU utilization 20% Paging disk 5% Other I/O devices 97% Indicate which will improve system utilization and explain your answer. a. Install a faster CPU . b. Install a bigger paging disk. c. Increase the degree of multiprogramming. d. Decrease the degree of multiprogramming. e. Install more main memory. f. Install a faster hard disk or multiple controllers with multiple hard disks. g. Add prepaging to the page-fetch algorithms....
IN OS: Chapter 6 CPU Scheduling • Basic Concepts • Scheduling Criteria – five criteria be able to discuss and apply with evidence. • Scheduling Algorithms – FCFS, SJF (optimal), RR (be able to set and justify quantum size), SRTF, Priority - be able to apply each to a set of processes to find the sequence and calculate average wait time (we did a workshop on this). Be able to discuss related to Short Term Scheduler, medium term, long term....
QUESTION 1 Virtual Memory is a technique that makes excellent use of available space on a hard drive, to temporarily store data that would otherwise require massive amounts of main memory (RAM). True False 2 points QUESTION 2 Which of these allocation schemes require the entire program to be loaded before execution can begin? I. Segmented/Demand paged II. Paged III. Segmented IV. Demand paged 2 points QUESTION 3 Select the advantages of the First-In First-Out page replacement policy...
# No plagiarism #Decide on the type of motherboard to use in the computer system you are designing. Explain what it is and why you chose it. This from Lab 5.1 Using the information you recorded previously in Step 5, consult Table 5-1 to find out how to enter your system’s setup utility. (Alternatively, when you first turn on your PC, look for a message on your screen, which might read something like “Press F2 to access setup.” Table 5-1:...
TRUE/FALSE QUESTIONS: Foundations of Information Security and Assurance 1. There is a problem anticipating and testing for all potential types of non-standard inputs that might be exploited by an attacker to subvert a program. 2. Without suitable synchronization of accesses it is possible that values may be corrupted, or changes lost, due to over-lapping access, use, and replacement of shared values. 3. The biggest change of the nature in Windows XP SP2 was to change all anonymous remote procedure call (RPC)...