The Entropy Game.

Defrag It.

SESSION 001
500 GB / 800 BLOCKS
Local Disk (C:) / 500 GB HDD
A map of simulated disk extents. Start defrag to process the disk.
IDLE
Space start / pause
MISPLACED BLOCKS—
FILE FRAGMENTS—
DATA MOVED—
TRANSFER RATE—
RETRY ATTEMPTS—
1 · System2 · Photos3 · Music4 · Projects5 · Memories6 · OtherFree space

Technical metrics

Disk layout

Usable capacity
—
Allocated / utilization
—
Free capacity
—
Logical extent size
—
Blocks in final position
—
Fragmented files
—
Excess file fragments
—
Mean file extent
—
Largest file extent
—
Free-space extents
—
Largest free extent
—
Free-space consolidation
—

Logical I/O

Relocations / swaps
—
Extent reads
—
Extent writes
—
Bytes read
—
Bytes written
—
Combined read + write
—
Write rate · 3 s window
—
Peak window write rate
—
Mean run write rate
—
Relocations / second
—
Mean relocation span
—

Controller

Phase
—
Active processing time
—
Time in steady processing
—
Time in stalls
—
Time in bursts
—
Stall share
—
Stalls completed / started
—
Current stall elapsed
—
Longest observed stall
—
Mean completed stall
—
Bursts completed / started
—
Largest burst
—
Controller retry attempts
—
Blocked logical index
—
FileAllocatedBlocksFragmentsLargest extentIn placeExtent writesBytes written

Learn RAID

RAID means Redundant Array of Independent Disks. It combines drives into a logical array. The level determines how data is spread, how much capacity remains usable, and which drive failures the array can tolerate.

Striping

Split data into chunks and distribute them across drives. Multiple members can work in parallel. Striping alone provides no extra copy.

Mirroring

Keep identical data on separate drives. A surviving mirror member can supply the copy when its partner fails.

Parity

Store calculated recovery information alongside data. Missing data can be reconstructed from surviving members, within the level’s failure tolerance.

Explore an array

Example raw capacityUsable capacityRedundancy reserve
A / B / C = data stripes · P / Q = parity

Click a drive to fail it; click again to restore it.

Failure tolerance:

This small example illustrates failure patterns. It is separate from your defrag run; restoring a button does not model rebuilding a real drive.

Capacity and failure tolerance
LevelUsable capacityDrive losses tolerated

N = member drives; D = capacity of the smallest member; G = RAID 6 groups; M = drives per group. Formulas assume equal drives, two-way mirrors, and equal group sizes. Filesystem overhead and hot spares are excluded.

Why does the failure pattern matter?

RAID 10 survives one failed drive in each mirror pair, but losing both members of one pair makes the array unavailable. RAID 60 survives two failures in each RAID 6 group, but three failures in the same group exceed its redundancy. Try both patterns above.

Defragmentation, rebuilding, and SSD optimization

Defragmentation rearranges fragmented file extents into more contiguous positions. RAID distributes those logical positions across its members. Rebuilding reconstructs data onto a replacement drive after a failure; it is a different operation. HDD defragmentation can reduce scattered access. SSD optimization commonly uses TRIM instead of the same HDD routine. The game models logical relocation; its random stalls and displayed rates are not hardware benchmarks.

Does RAID replace backups?

Redundancy helps keep data available through certain drive failures. It does not provide an independent history of files: deletion, unwanted changes, or corruption can affect the array’s copies too. A separate backup provides a recovery path for those events.