Tutorials Logic
Tutorials Logic, IN info@tutorialslogic.com
Navigation
Home About Us Contact Us Blogs FAQs
Tutorials
All Tutorials
Services
Academic Projects Resume Writing Website Development
Practice
Quiz Challenge Interview Questions Certification Practice
Tools
Online Compiler JSON Formatter Regex Tester CSS Unit Converter Color Picker
Compiler Tools

Storage Management in OS — RAID, SSD vs HDD

Disk Structure

A traditional Hard Disk Drive (HDD) consists of:

  • Platters: Circular magnetic disks that store data
  • Tracks: Concentric circles on each platter surface
  • Sectors: Smallest addressable unit on a track (typically 512 bytes or 4 KB)
  • Cylinders: All tracks at the same position across all platters
  • Read/Write Head: Reads and writes data on the platter surface
  • Spindle: Motor that spins the platters (5400, 7200, 10000, 15000 RPM)

Disk Access Time

Total disk access time = Seek Time + Rotational Latency + Transfer Time

ComponentDescriptionTypical Value
Seek TimeTime to move the read/write head to the correct track3-15 ms
Rotational LatencyTime for the desired sector to rotate under the head0-8 ms (avg ~4 ms at 7200 RPM)
Transfer TimeTime to read/write the actual dataVery small (microseconds)

Seek time dominates - disk scheduling algorithms aim to minimize total seek time.

SSD vs HDD

FeatureHDDSSD
TechnologyMagnetic platters, mechanical armNAND flash memory (no moving parts)
Speed (sequential)100-200 MB/s500 MB/s - 7 GB/s (NVMe)
Random accessSlow (seek time)Very fast (microseconds)
DurabilityVulnerable to physical shockMore durable (no moving parts)
NoiseAudible (spinning, seeking)Silent
Power consumptionHigherLower
Cost per GBLower (~$0.02/GB)Higher (~$0.08/GB)
Lifespan3-5 years (mechanical wear)Limited write cycles (TBW)

RAID Levels

RAID (Redundant Array of Independent Disks) combines multiple physical disks into a logical unit for improved performance, redundancy, or both.

RAID LevelDescriptionMin DisksFault ToleranceUse Case
RAID 0 (Striping) Data split across disks for speed. No redundancy. 2 None - any disk failure = total data loss High performance, non-critical data
RAID 1 (Mirroring) Exact copy of data on two disks. 2 1 disk failure OS drives, critical data
RAID 5 (Striping + Parity) Data and parity striped across all disks. Parity allows recovery. 3 1 disk failure File servers, general storage
RAID 6 (Double Parity) Like RAID 5 but with two parity blocks. 4 2 disk failures Large arrays, high availability
RAID 10 (1+0) Mirrored pairs that are then striped. Best of RAID 1 and RAID 0. 4 1 disk per mirrored pair Databases, high I/O workloads

Storage Hierarchy

The storage hierarchy organizes storage by speed, cost, and capacity. Faster storage is more expensive and has less capacity:

LevelTypeSpeedCapacityVolatile?
1CPU Registers~1 nsBytesYes
2L1/L2/L3 Cache1-10 nsKB-MBYes
3Main Memory (RAM)~100 nsGBYes
4SSD (NVMe)~100 �sTBNo
5HDD~10 msTBNo
6Optical / TapeSecondsTB-PBNo

Principle of Locality: Programs tend to access a small portion of their address space at any given time (temporal and spatial locality). This is why caching is effective - frequently accessed data is kept in faster storage levels.


Level Up Your Operating system Skills

Master Operating system with these hand-picked resources

10,000+ learners
Free forever
Updated 2026

Ready to Level Up Your Skills?

Explore 500+ free tutorials across 20+ languages and frameworks.