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.
Explain about demand paging? A demand paging system is same to a paging system with swapping. Processes reside on secondary memory. When we require executing a process, we chan
Write a script that uses this idea to print output similar to the following: Files in this directory that match *~ : bash-scripts.html~ chimpanzee~ countdown~ countd
Q. In some systems a subdirectory is able to be read and written by an authorized user just as ordinary files can be. a. Explain the protection problems that could arise. b.
Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced
How Memory utilization factor shall be computed Memory utilization factor shall be defined as Memory in use/total memory connected
EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th
swapping technique
Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU
How can a user program disturb the normal operation of the system? a) Issuing illegal I/O operation. b) By accessing memory locations within the OS itself. c) Refusing to
Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into
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