How to access the disk data, Computer Engineering

Assignment Help:

Q. How to Access the Disk Data?

Disks operate is semi-random mode of operation and generally referenced block wise. The data access time on a disk comprises two major components:

  • Seek time: Time to position head on a particular track. On a fixed head disks it's time taken by electronic circuit to select needed head whereas in movable head disks it's time needed to move head to a specific track.
  • Latency time: This is time needed by a sector to reach below read/write head. On an average it's half of time taken for a rotation by disk.

In addition to seek and latency time the time taken to transfer a (read/write) block of words can be considered however normally it is too small in comparison to seek time and latency and in general disk access time is concerned to be sum of seek time and latency time. Because access time of disks is large so it is advisable to read a sizeable part of data in a single go and so disks are referenced block wise. As a matter of fact you will find that in most of computer system input/output involving disk is given a very high priority. Fundamental reason for such priority is latency time which is needed once the block which is to be read passes below read-write head. It may take time of order of milliseconds to do it again, in turn delaying Input /Output and lowering performance of system.


Related Discussions:- How to access the disk data

Legacy systems and current infrastructure, Legacy systems and current infra...

Legacy systems and current infrastructure - Information System This problem is most easily understood using the everyday example of the rail ways where the rail network infras

What are conversion routines, What are conversion routines? Non-standa...

What are conversion routines? Non-standard conversions from present format to sap internal format and vice-versa are executed with so known as conversion routines.

Convert, haw to convert context free grammar to regular grammar

haw to convert context free grammar to regular grammar

Write a recursive algorithm, Write a recursive algorithm to count the numbe...

Write a recursive algorithm to count the number of right children in a binary search tree. Write the method levelCount whose header is given below. Method levelCount returns

Explain efficiency performance and issues in pipelining, Efficiency The...

Efficiency The effectiveness of pipeline can be measured the same as the ratio of busy time span to total time span counting the idle time. Let c be clock period of a pipeline

Illustrate the benefits of functional model, Illustrate the benefits of Fun...

Illustrate the benefits of Functional model Functional model shows how values are computed. This model describes decisions or object structure without regard for sequencing. I

Describing Random Algorithm, Suppose you''re given n numbers and asked to f...

Suppose you''re given n numbers and asked to find a number that is greater than or equal to the median a) What is the lower bound for the worst case complexity of this problem?

Explain the term internet, Explain the term Internet. Internet: ...

Explain the term Internet. Internet: The Internet, an umbrella term covering countless network and services that comprise a super-network, is a global network of compute

Explain about of unicode, Q. Explain about of Unicode? This is a newer ...

Q. Explain about of Unicode? This is a newer International standard for character representation. Unicode offers a unique code for each character irrespective of Program, platf

Show the characteristic of cache memory, Q. Show the characteristic of cach...

Q. Show the characteristic of cache memory? The essential characteristic of cache memory is its fast access time. So very little or no time should be wasted when searching for

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