Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s typically seek at a fixed rate. Presume that the disk in subsequent exercise has a constant-rate seek rather than a constant acceleration seek consequently seek time is of the form t = x + yL where t is the time in milliseconds and L is the seek distance. Presume that the time to seek to an adjacent cylinder is 1 millisecond as before and is 0.5 milliseconds for every additional cylinder.
a. Write an equation for this seek time like a function of the seek distance.
b. Utilizing the seek-time function from a part calculate the total seek time for each of the schedules in Exercise 12.2. Is your answer the similar as it was for Exercise 12.3(c)?
c. What is the percentage accelerate of the fastest schedule over FCFS in this case?
Answer:
a. t = 0.95 + 0.05L
b. FCFS 362.60; SSTF 95.80; SCAN 497.95; LOOK 174.50; C-SCAN 500.15; (and C-LOOK 176.70). SSTF is still the winner as well as LOOK is the runner-up.
c. (362.60 - 95.80)/362.60 = 0.74 the percentage accelerate of SSTF over FCFS is 74% with respect to the seek time. If we comprise the overhead of rotational latency and data transfer the percentage speedup will be less.
Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters
KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl
What is page fault and what are the steps taken by the OS to remove page fault? A page fault is caused while a page that hasn't been brought into memory is being addressed. The
Before proceeding with its execution, every process must obtain all the resources it needs is called Hold and wait
Q. How does DMA raise system concurrency? How does it make difficult hardware design? Answer: DMA increases system concurrency by allowing the CPU to perform tasks while the
Why are segmentation and paging sometimes combined into one scheme? Segmentation and paging are often combined in order to improve upon each other. Segmented paging is helpful
What is paging? Paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fi
1. On every access, mark the page with a timestamp. Whenever we need to evict a page, we search through memory for the oldest page, the least-recently used page. But we need memory
Processes- Making the System More Responsive and Useful A method by definition build up of a code execution and resource ownership. A process has two main characteristics, code
mail me
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd