Skip to main content

Storage Disk

Disks are storage devices that hold enormous amounts of data, on the order of hundreds to thousands of gigabytes.

Disks are constructed from platters. Each platter consists of two sides, or surfaces. A rotating spindle in the center of the platter spins the platter at a fixed rotational rate, range between 5400 to 15000 rpm.

Each surface consists of a collection of concentric rings called tracks. Each track is partitioned into a collection of sectors. Sectors are separated by gaps where no data bits are stored. The geometry of multiple-platter termed as cylinders, where a cylinder is the collection of tracks on all the surfaces that are equidistant from the center of the spindle.

The maximum number of bits that can be recorded by a disk is known as Disk capacity.

The number of bits that can be recorded into a 1-inch segment of a track is known as Recording density which is measured by bits/in.

The number of tracks that can be squeezed into a 1-inch segment of the radius extending from the center of the platter is known as Track density, which is measured by tracks/in

The product of the recording density and the track density is referred as Areal density, which measured by bits/Sq.in

Disk Capacity = (No of Bytes/Sector) X (Avg No of Sectors/Track) X (No of Tracks/Surface) X (No of Surface/Platter) X  (No of Platters/Disk)

The disk capacity is expressed in Gigabytes (GB).

Example

What is the capacity of a disk with two platters, 30,000 cylinders, an average of 300 sectors per track, and 512 bytes per sector?

Disk Capacity = (512/Sector) X (300/Track) X (30000/Surface) X (2/Platter) X  (2/Disk)

= 18,43,20,00,000 = 18.43 GB

Disks read and write bits stored on the magnetic surface using a read/write head connected to the end of an actuator arm. The action of moving the arm back and forth along its radial axis is called seek. Disks with multiple platters have a separate read/write head for each surface.

Disks read and write data in sector-sized blocks. The access time for a sector has three main components: seek time, rotational latency, and transfer time.

The time required to move the arm to the target sector is called the seek time.

The waiting time of head for the first bit of the target sector to pass under the head known as Rotational Latency.

T max rotation = (1/RPM) X (60 secs/1 min)

T avg rotation = 1/2 X T max rotation

The transfer time for one sector depends on the rotational speed and the number of sectors per track.

T avg transfer = (1/RPM) X (1/avg. no of sector per track) X (60 secs/1 min)

The average time to access the contents of a disk sector as the sum of the average seek time, the average rotational latency, and the average transfer time.

Taccess = Tavg seek + Tavg rotation + Tavg transfer

Labels:

Popular posts from this blog

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...
Read more

Decision Tree - Gini Index

The Gini index is used in CART. The Gini index measures the impurity of the data set, where p i - probability that data in the data set, D belong to class, C i  and pi = |C i,D |/|D| There are 2 v - 2 possible ways to form two partitions of the data set, D based on a binary split on a attribute. Each of the possible binary splits of the attribute is considered. The subset that gives the minimum Gini index is selected as the splitting subset for discrete valued attribute. The degree of Gini index varies between 0 and 1. The value 0 denotes that all elements belong to a certain class or if there exists only one class, and the value 1 denotes that the elements are randomly distributed across various classes. A Gini Index of 0.5 denotes equally distributed elements into some classes. The Gini index is biased toward multivalued attributes and has difficulty when the number of classes is large.
Read more

Data Cleaning Process

Data cleaning attempt to fill in missing values, smooth out noise while identifying  outliers, and correct inconsistencies in the data. Data cleaning is performed as an iterative two-step process consisting of discrepancy detection and data transformation. The missing values of the attribute can be addressed by Ignoring the value filling the value manually Using global constant to fill the value Using a measure of central tendency (mean or median) of value Using attribute mean or median belonging to same class Using the most probable value Noise is a random error or variance in a measured variable. The noisy data can be smoothened using following techniques. Binning methods smooth a sorted data value by consulting the nearby values around it. smoothing by bin means - each  value in a bin is replaced by the mean value of the bin. smoothing by bin medians - each bin value  is replaced by the bin median smoothing by bin boundaries - the minimum and maximum values in a ...
Read more