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.
Q. Definition of Operating System? Definition of Operating System: • An Operating system is a program which controls execution of application programs and acts as an interfa
Semispace works by maintaining two disjoint areas from which memory can be allocated. These areas are called the from-space and the to-space. At ?rst, the algorithm allocates memor
The field that consists of a segment index or an internal index is known as Target datum is field that consists of a segment index or an internal index.
Question: a) There are main goals of data security. List them and elaborate on how they provide protection. b) Describe threats associated with data security. c) Describe
Question : The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operatin
Contiguous allocation: Every file will be allocated contiguous space in the memory. Allow the block size be 1K If a 50K files desires to be allocated space after t
Now let us present an implementation of a producer-consumer system using condition variables. This implementation works. dequeue() lock(A) while (queue empty) { wait(A, C)
What are the phases of background processing? Phases are:- Job Scheduling. Job Processing. Job Overview.
Q. How Program execute in operating system? Program execution- The operating system fills the contents (or sections) of a file into memory as well as begins its execution. A us
What is the basic approach of page replacement? If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its con
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