FS_TYPE: JOURNALED_INODE
SCHEDULER: C-SCAN_ELEVATOR
ARCHITECTURE: PERSISTENT_BLOCK
STATE: MOUNTED
ASKiIMAN™ DOOR 01 / FOUNDATIONS / REALM 14
--:-- · -- --- ----

Ontological Layer: The Preservation of State

File Systems & Disks

How the Machine Remembers

The Architecture of Memory

When the power is cut, RAM forgets everything. To achieve true persistence, the OS must map logical, human-readable "Files" onto the raw, mechanical sectors of a hard drive or the erase-blocks of an SSD. Realm 14 documents this massive abstraction: how directories form a namespace, how inodes track scattered data blocks across spinning platters, and how disk-scheduling algorithms optimize the physical travel of the read/write head to minimize mechanical latency.

APPLICATION → FILE DIRECTORY → INODE / METADATA → LOGICAL BLOCK ↓ DISK SCHEDULER → SEEK & ROTATE → PHYSICAL SECTOR

The 12 Storage Chambers

Ontological Mapping: From Directories to Platters

CHAMBER 01

Persistent Storage

  • Information survives power-off
  • Difference from volatile RAM
  • Files as persistent logical units
  • Attributes: Name, Type, Size, Owner
CHAMBER 02

Operations & Access

  • Create, Read, Write, Seek, Delete
  • Sequential Access (Streams)
  • Random / Direct Access (Jumps)
  • Indexed Access via key structures
CHAMBER 03

Directories & Links

  • Namespace mapping (Name → Metadata)
  • Tree-structured hierarchies
  • Absolute vs Relative Paths
  • Hard Links vs Symbolic Links
CHAMBER 04

Filesystem Metadata

  • Information about the files
  • File Control Block (FCB)
  • Inodes: File identity & data pointers
  • Permissions, Owners, Timestamps
CHAMBER 05

Allocation Strategies

  • Contiguous: Fast, but fragmentation issues
  • Linked: Easy growth, poor random access
  • Indexed: Direct access via index block
  • External vs Internal Fragmentation
CHAMBER 06

Free-Space Management

  • Tracking available storage blocks
  • Bitmaps (1 bit per block)
  • Linked Free Lists
  • Grouping and Counting techniques
CHAMBER 07

HDD Structure

  • Platters, Tracks, Sectors, Cylinders
  • Seek Time (Head movement)
  • Rotational Latency (Waiting for sector)
  • Transfer Time (Reading data)
CHAMBER 08

Disk Scheduling

  • FCFS (First-Come, First-Served)
  • SSTF (Shortest Seek Time First)
  • SCAN (Elevator Algorithm)
  • C-SCAN, LOOK, C-LOOK variations
CHAMBER 09

SSD & Flash Memory

  • No mechanical parts or seek time
  • Flash Translation Layer (FTL)
  • Wear Leveling & Garbage Collection
  • Erase-block constraints
CHAMBER 10

Journaling & Safety

  • Crash consistency problems
  • Journal: Recording intent before writing
  • Metadata vs Data journaling
  • Filesystem Consistency Checking (fsck)
CHAMBER 11

RAID & Redundancy

  • RAID 0: Striping (Performance only)
  • RAID 1: Mirroring (Redundancy)
  • RAID 5: Striping + Distributed Parity
  • Partitions, Volumes, and Formatting
FINAL PROTOCOL

14 — The Disk Geometry Laboratory

1. QUEUE: 98, 183, 37, 122, 14, 124, 65, 67
2. HEAD START: 53. SCHEDULER: SSTF
3. PATH: 53->65->67->37->14->98->122->124->183
4. TOTAL HEAD MOVEMENT: 236 CYLINDERS
[1] TRACE INODE POINTERS [2] CALCULATE SEEK TIME [3] COMPARE SCAN VS C-SCAN [4] SIMULATE SSD WEAR [5] RECOVER FROM JOURNAL

Filesystems transform an undifferentiated collection of spinning magnetic blocks into a structured, named, and protected world of persistent data. With Realm 14 completed, we have traversed the entire horizontal architecture of the computer. The final step is Realm 15: The Computer Laboratory, where all these systems combine.

FILESYSTEM DIAGNOSTIC RUNNING