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!
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.
What is the purpose of system programs? System programs can be thought of as bundles of useful system calls. They give basic functionality to users and so users do not require
Q. Why would it be an awful idea for gateways to pass broadcast packets between networks? What would be the merite of doing so? Answer: All broadcasts would be spreads to all
Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c
Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har
Overview: In this assignment, you are going to perform a system analysis and design of a membership and facility management system of a gymnasium of given case study Task: You are
Q. Some untimely computers protected the operating system by placing it in a memory partition that couldn't be modified by either the user job or the operating system itself. Expl
how fat file system is organised
The term Operating System (OS) is often misused. It is common, for example, for people to speak of an OS when they are in fact referring to an OS and to a set of additional applica
Q. What are the major differences between capability lists and access lists? Answer: An access list is a list for each object consisting of the domains with a nonempty set of
Explain the Spawnvp Function used in the netware Spawnvp(flags, execNmae, argv) This function executes similarly to spawnlp( ) except that parameters are passed as a v
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