Filesystem

fsync is often assumed. This post uncovers those gaps and offers practical safeguards.

Introduction File systems are the backbone of every operating system, translating the abstract notion of “files” into concrete storage on disks, SSDs, or even network shares. While most users interact with files through simple operations—open, edit, delete—there exists a powerful, often under‑appreciated feature that lets you reference the same data from multiple locations: links. Two primary kinds of links dominate POSIX‑compatible systems: Hard links – multiple directory entries that point directly to the same inode (the underlying data structure representing a file). Soft links (also called symbolic links or symlinks) – special files that contain a pathname to another file. Understanding the nuances of hard and soft links is essential for system administrators, developers, and power users alike. Misusing them can lead to data loss, security vulnerabilities, or baffling bugs. Conversely, mastering them enables elegant solutions for backups, deployment pipelines, version control, and more. ...

Table of Contents Introduction What Is Delayed Allocation? 2.1 Historical Context 2.2 Core Principle How Modern Filesystems Implement Delayed Allocation 3.1 ext4 3.2 XFS 3.3 btrfs & ZFS Benefits of Delayed Allocation 4.1 Write Aggregation & Throughput 4.2 Reduced Fragmentation 4.3 Improved SSD Longevity Risks, Edge Cases, and Data‑Loss Scenarios Tuning Delayed Allocation on Linux 6.1 Mount Options 6.2 sysctl Parameters 6.3 Application‑Level Strategies Practical Examples 7.1 Benchmarking Write Patterns with dd 7.2 C Program Demonstrating posix_fallocate vs. Delayed Allocation 7.3 Monitoring with iostat and blktrace Real‑World Use Cases 8.1 Databases (MySQL, PostgreSQL) 8.2 Virtual Machines & Containers 8.3 Log‑Heavy Applications Comparing Delayed Allocation to Other Allocation Strategies Debugging & Troubleshooting 11 Best Practices Checklist 12 Future Directions and Emerging Trends 13 Conclusion 14 Resources Introduction When a program writes data to a file, the operating system must decide where on the storage medium to place those bytes. Historically, the kernel performed this decision immediately, allocating disk blocks as soon as the first write() call arrived. While simple, that approach often leads to sub‑optimal performance: many tiny allocations, fragmented files, and excessive I/O traffic. ...

Introduction If you have ever run ls -i on a Unix‑like system and seen a long integer next to each file name, you have already peeked at one of the most fundamental data structures in modern storage: the inode. While the term “inode” (index node) is familiar to system administrators, developers, and forensic analysts, the inode table—the on‑disk repository that stores every inode for a given filesystem—remains a black box for many. ...

Introduction FAT32 (File Allocation Table 32) is one of the most recognizable file‑system formats in the world of digital storage. Despite being conceived in the early 1990s, it remains a go‑to solution for removable media, embedded devices, and cross‑platform data exchange. Its longevity stems from a blend of simplicity, wide‑range compatibility, and modest resource requirements. This article provides an in‑depth, technical yet accessible exploration of FAT32. We will cover its historical origins, internal architecture, practical limits, how it compares to modern alternatives, and step‑by‑step guidance for creating, mounting, and troubleshooting FAT32 volumes on Windows, Linux, and macOS. Real‑world examples and code snippets are included to help readers apply the concepts immediately. ...