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.
Consider a particular system that does not have an interrupting clock. The only way a thread can lose the processor is to voluntarily surrender it. Additionally, the operating sy
explain function of computer operating system?
Since most of the programs require a lot of memory allocation/deallocation, we expect the memory management to be fast, to have low fragmentation, make good use of locality, and be
What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The
What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.
explain about design issues of network operating system
Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce
Define Instance. An instance is an administrative unit in which components of R/3 systems giving one or more services are grouped together. The services offered by a case are
The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s
A Unix shell is a shell or command-line interpreter that gives a traditional user interface for the Unix-likesystems and for Unix operating system. Users operates the operation of
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