Why is rotational optimization no longer consequently useful, Operating System

Assignment Help:

UNIX systems utilized to use disk-layout optimizations based on the rotation position of disk data however modern implementations including Linux simply optimize for sequential data access. Why do they do therefore? Of what hardware kind does sequential access take advantage? Why is rotational optimization no longer consequently useful?

Answer: The performance quality of disk hardware have changed substantially in recent years. In particular numerous enhancements have been introduced to raise the maximum bandwidth that can be achieved on a disk. In a modern system there is able to be a long pipeline among the operating system and the disk's read-write head. A disk I/O demand has to pass through the computer's local disk controller over bus logic to the disk drive itself as well as then internally to the disk where there is probable to be a complex controller that can cache data accesses as well as potentially optimize the order of I/O requests.

For the reason that of this complexity the time taken for one I/O request to be acknowledged and for the next request to be generated and received by the disk can far exceed the amount of time between one disk sector passing under the read-write head as well as the next sector header arriving.

In order to be able efficiently to read multiple sectors at once, disks will employ a read ahead cache. While one sector is being passed back to the host computer the disk will be busy reading the next sectors in anticipation of a request to read them. If read needs start arriving in an order that breaks this read ahead pipeline performance will drop.

Accordingly performance benefits substantially if the operating system tries to keep I/O requests in strict sequential order. A subsequent feature of modern disks is that their geometry can be extremely complex. The number of sectors per cylinder is able to vary according to the position of the cylinder- more data can be squeeze into the longer tracks nearer the edge of the disk than at the canter of the disk. For an OS (operating system) to optimize the rotational position of data on such disks it would have to have complete understanding of this geometry as well as the timing characteristics of the disk and its controller. In general, only the disk's internal logic can determine the optimal scheduling of I/Os and the disk's geometry is probable to defeat any attempt by the operating system to perform rotational optimizations.


Related Discussions:- Why is rotational optimization no longer consequently useful

What is the use of FIFOs in client-server applications, What is the use of ...

What is the use of FIFOs in client-server applications

How program execute in operating system, Q. How Program execute in operatin...

Q. How Program execute in operating system? Program execution: Operating system loads a program in memory and executes the program. The program should be able to end its exec

Pages into physical memory, For reading, most operating systems use demand ...

For reading, most operating systems use demand paging. This means that pages are only read from the disk into physical memory when they are needed. In the page table, there is a re

Determine a processing that is not a part of synthesis phase, Determine a p...

Determine a processing that is not a part of Synthesis phase  Perform LC processing is not a part of Synthesis phase

Objectives and functions of an operating system, Question: a) What is ...

Question: a) What is an Input/Output module and what are the five categories their functions fall into? b) What is an Operating System? Briefly describe the two objectives

What is process migration, Question: (a) Describe blocking and non-bloc...

Question: (a) Describe blocking and non-blocking types of inter-process communication. What is easier to implement and why? Discuss their relative advantages and disadvantage

Multi-level page tables, Multi-level page tables are tree-like structures t...

Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,

How is the NTFS namespace planned, Q. How is the NTFS namespace planned? Ex...

Q. How is the NTFS namespace planned? Explain. Answer: The NTFS namespace is prearranged as a hierarchy of directories where every directory uses a B+ tree data structure to

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd