mirror of
https://github.com/versity/scoutfs.git
synced 2026-01-03 19:04:00 +00:00
14eddb6420
The fence-and-reclaim test has a little function that runs after fencing and recovery to make sure that all the mounts are operational again. The main thing it does is re-use the same locks across a lot of files to ensure that lock recovery didn't lose any locks that stop forward progress. But I also threw in a test of the committed_seq machinery, as a bit of belt and suspenders. The problem is the test is racey. It samples the seq after the write so the greatest seq it rememebers can be after the write and will not be committed by the other nodes reads. It being less than the committed_seq is a totally reasonable race. Which explains why this test has been rarely failing since it was written. There's no particular reason to test the committed_seq machinery here, so we can just remove that racey test. Signed-off-by: Zach Brown <zab@versity.com>
Introduction
scoutfs is a clustered in-kernel Linux filesystem designed to support large archival systems. It features additional interfaces and metadata so that archive agents can perform their maintenance workflows without walking all the files in the namespace. Its cluster support lets deployments add nodes to satisfy archival tier bandwidth targets.
The design goal is to reach file populations in the trillions, with the archival bandwidth to match, while remaining operational and responsive.
Highlights of the design and implementation include:
- Fully consistent POSIX semantics between nodes
- Atomic transactions to maintain consistent persistent structures
- Integrated archival metadata replaces syncing to external databases
- Dynamic seperation of resources lets nodes write in parallel
- 64bit throughout; no limits on file or directory sizes or counts
- Open GPLv2 implementation
Community Mailing List
Please join us on the open scoutfs-devel@scoutfs.org mailing list hosted on Google Groups