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

Which is the slowest sorting procedure, The slowest sorting procedure is   ...

The slowest sorting procedure is    Bubble Sort is the slowest sorting process.

What is a multitape tm, What is a multitape TM?  A  multi-tape  Turing ...

What is a multitape TM?  A  multi-tape  Turing  machine  having  of  a  finite  control  with  k-tape  heads  and k-tapes each tape is infinite in both directions. On a one mov

Bit manipulation techniques, We can also use the logical operators to numbe...

We can also use the logical operators to numbers directly and  perform simple bit manipulation . The operators are     &  Bitwise AND     |  Bitwise OR     ^  Bitwise exclusiv

Towers of hanoi problem, The Towers of Hanoi Problem Towers of Hanoi pro...

The Towers of Hanoi Problem Towers of Hanoi problem is described. There are three pegs on which disks are "threaded" (there are holes in the disks to allow them to be placed on

Define structural classification, Structural Classification Flynn's cla...

Structural Classification Flynn's classification explains the behavioural idea and doesn't take concern into the computer's structure. Parallel computers can be categorized bas

What are the disadvantages of fcfs scheduling algorithm, What are the disad...

What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? Disadvantages: (i) Waiting time can be huge if short requests w

What are the techniques of data collection, What are the techniques of Data...

What are the techniques of Data Collection It can be either automatic or manual. Manual techniques can include: -  Keypads/Keyboards to type in data -  touch screens to s

Why we need parallel programming languages, Q. Why we need parallel program...

Q. Why we need parallel programming languages? The parallel programming languages are created for parallel computer environments.  These are developed either by creating new la

Typicality of virtual addresses, The typicality of virtual addresses is tha...

The typicality of virtual addresses is that: They are longer than physical addresses because total addressed memory in virtual memory is more than actual physical memory.

Implement or, Q. Write a program to implement OR, NOR, AND and NAND gates ...

Q. Write a program to implement OR, NOR, AND and NAND gates using and without using Bit wise operator. The menu should be as follows: I. Using Bit Wise operator II. Withou

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