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.
Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory
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
server configure
What are a safe state and an unsafe state? Answer: A state is safe if the system can allocate resources to every process in some order and still avoid a deadlock. A system is
Explain Deadlock Every process in a set of processes is waiting for an event which only a process in the set can cause.
Explain the steps in deadlock recovery. a) Exterminate off all processes involved - drastic. b) Exterminate off one at a time till deadlock gone - select a victim.
acyclic graph directories
Explain about disk scheduling with neat diagram? FCFS Scheduling SCAN scheduling C-SCAN scheduling SSTF scheduling LOOK Scheduling
(Add synchronization to your solutions to HW 3 to eliminate all of the race conditions. You should not remove any of the sleep() commands that you used to produce the race conditi
Virtual file systems The file-system execution having of three major layers. The first layer is the file-system interface, based on the open, read, write and close calls and fi
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd