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. Remapping of bad blocks by sector sparing or else sector slipping could influence performance. Presume that the drive in Subsequent Exercise has a total of 100 bad sectors at random locations and that every bad sector is mapped to a spare that is located on a different track but within the same cylinder. Estimation the number of I/Os per second and the effective transfer rate for a random-access workload consisting of 8-kilobyte reads with a queue length of 1 (that is the choice of scheduling algorithm isn't a factor). What is the consequence of a bad sector on performance?
Answer: Since the disk holds 22,400,000 sectors the probability of requesting one of the 100 remapped sectors is very small. An instance of a worst-case event is that we attempt to read say an 8 KB page however one sector from the middle is defective and has been remapped to the worst possible location on another track in that cylinder. In this situation the time for the retrieval could be 8 ms to seek plus two track switches and two full rotational latencies. It is probable that a modern controller would read all the requested good sectors from the original track before switching to the spare track to retrieve the remapped sector and thus would incur only one track switch and rotational latency. Therefore the time would be 8ms seek + 4.17 ms average rotational latency + 0.05 ms track switch + 8.3 ms rotational latency + 0.83 ms read time (8 KB is 16 sectors 1/10 of a track rotation). Therefore the time to service this request would be 21.8ms giving an I/O rate of 45.9 requests per second as well as an effective bandwidth of 367 KB/s. For a strictly time-constrained application this might matter but the overall impact in the weighted average of 100 remapped sectors and 22.4 million good sectors is nil.
Define thread cancellation & target thread. The thread cancellation is the task of terminating a thread before it has completed. A thread that is to be cancelled is often refer
Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a
What is Multiprogramming? Multiprogramming is the capability of am operating system to support multiple applications running concurrently. Multiprogramming simply means that an
Ask question #Minimum 150 words
Write about critical regions and monitors. Critical region definition Monitor definition Implementation of the conditional-region construct Syntax of monitor Monito
List operations to be performed on directories. Search for a file, delete a file, create a file, list a directory, rename a file, and traverse the file system.
shell program for Armstrong number
An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum
Debugging a multi threaded program The following list points out few of the more frequent oversights and errors that can cause bugs in multithreaded programs. 1. Ephemeral
What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t
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