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

Explain hierarchical paging, Hierarchical paging Single way is to use a...

Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag

Explain acyclic-graph directories, Acyclic-graph directories An acyclic...

Acyclic-graph directories An acyclic graph permits directories to have shared subdirectories and files. The similar file or subdirectory may be in two dissimilar directories. A

What is external fragmentation?, What is external fragmentation? As pro...

What is external fragmentation? As process are removed from and loaded to the memory free memory space is bracken into pieces .external fragmentation take place when enough mem

What is meant by the phrase thread-safe, The term thread-safe in computer p...

The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

What is file allocation?, What is File Allocation? The structure that ...

What is File Allocation? The structure that offers the FAT file system its name is the file allocation table . In order to know what this important table does, you should fir

What is internal fragmentation?, What is internal fragmentation? Consid...

What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over

First-in-first-out (fifo), FIFO is named as 'named pipes'. FIFO (first-in-...

FIFO is named as 'named pipes'. FIFO (first-in-first-out) is a special file which is laid to be data transient. Once data is load from named pipe, it cannot be load again. Also, da

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Briefly discuss on real-time scheduling, Briefly discuss on real-time sched...

Briefly discuss on real-time scheduling? It is divided into two types.  Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. T

Is it essential to bind a real-time thread to an lwp, Q. Presume an operati...

Q. Presume an operating system maps user-level threads to the kernel using the many-to-many model and the mapping is done through LWPs. Additionally the system allows developers 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