What Is NeFS?
NeFS is built around a catalog-based system that meticulously organizes data and metadata. At its core, it manages both data forks (primary data) and resource forks (associated metadata), facilitating efficient navigation and resource allocation within the filesystem. NeFS uniquely combines linked lists and Best-buddy linked list algorithms to effectively handle its sophisticated allocation mechanism.
Key components include:
Forks: Structures that store actual file data and metadata.
Catalogs: Hierarchical organization units that manage forks.
Partitions: Disk sections managed by a root catalog containing essential metadata.
Mount-point(s): Interfaces connecting the filesystem to physical drives.
Fork Allocation and Linking
Forks reside in data blocks on disk, managed through buddy organized catalogs. When a fork is created:
NeFS searches for an available slot within the catalog.
If no slot is available, it dynamically expands the list, allocating new disk space for the fork.
This approach is simple and straightforward to implement. Although the O(n) is going to be a problem when the filesystem grows.
Conclusion
This method efficiently manages both data forks (file data) and resource forks (metadata), guaranteeing minimal disk fragmentation and rapid data access.
Amlal.