diff options
| author | Kent Overstreet <kent.overstreet@linux.dev> | 2023-09-22 18:30:23 -0400 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-09-22 18:38:03 -0400 |
| commit | 81e99c6188c80f82eafe0cbb3470c627e52e3861 (patch) | |
| tree | bc5942199b1fbd02a20b2261f37897fc0758a652 | |
| parent | f7634781a8114f686e14482cd480b773464a9d30 (diff) | |
More website improvements
- expand, reorg frontpage
- update roadmap
- new debugging page
- new btree perf numbers
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
| -rw-r--r-- | index.mdwn | 24 |
1 files changed, 12 insertions, 12 deletions
@@ -46,10 +46,10 @@ the bcachefs codebase is considerably more robust and mature than upstream bcache. The long term goal of bcachefs is to produce a truly general purpose filesystem: - * scalable and reliable for the high end - * simple and easy to use - * an extensible and modular platform for new feature development, based on a - core that is a general purpose database, including potentially distributed storage +* scalable and reliable for the high end +* simple and easy to use +* an extensible and modular platform for new feature development, based on a + core that is a general purpose database, including potentially distributed storage ## Some technical high points @@ -75,14 +75,14 @@ performance to be more consistant than even XFS. #### Sophisticated transaction model The main interface between the database layer and the filesystem layer provides - * Transactions: updates are queued up, and are visible to code running within - the transaction, but not the rest of the system until a successful - transaction commit - * Deadlock avoidance: High level filesystem code need not concern itself with lock ordering - * Sophisticated iterators - * Memoized btree lookups, for efficient transaction restart handling, as well - as greatly simplifying high level filesystem code that need not pass - iterators around to avoid lookups unnecessarily. +* Transactions: updates are queued up, and are visible to code running within + the transaction, but not the rest of the system until a successful + transaction commit +* Deadlock avoidance: High level filesystem code need not concern itself with lock ordering +* Sophisticated iterators +* Memoized btree lookups, for efficient transaction restart handling, as well + as greatly simplifying high level filesystem code that need not pass + iterators around to avoid lookups unnecessarily. #### Triggers |