Reimplementing the Cedar file system using logging and group commit
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
File system design for an NFS file server appliance
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
Design tradeoffs for SSD performance
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Better I/O through byte-addressable, persistent memory
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Using non-volatile memory to save energy in servers
Proceedings of the Conference on Design, Automation and Test in Europe
Improving file system consistency and durability with patches and bpfs
Improving file system consistency and durability with patches and bpfs
Revisiting storage for smartphones
ACM Transactions on Storage (TOS)
On-Demand Snapshot: An Efficient Versioning File System for Phase-Change Memory
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
The emerging Storage Class Memory, which offers characteristics of byte-addressability, persistence, and low power consumption, will be expected to replace memory/storages. A new file system is required in this environment. In the design of file systems, data consistency is one of the most important issues that should be taken into account. To do this, most file systems exploit journaling or shadow paging for the consistency. Shadow paging employs copy-on-write for the consistency. However, it incurs many copy overheads. In order to relieve these problems, BPFS proposed a short-circuit shadow paging. But, in our experiments, we showed that it incurs many copy-on-write blocks as ever. In this paper, we propose a last block logging mechanism for improving the performance and the lifetime of SCM-based file system, by reducing copy-on-write blocks considerably. Our approach is to store the only changed contents to the available space of the last block, instead of performing copy-on-write on the entire block. Also, our approach updates the address of the last block and maintains the information on the logged data in order to ensure the data consistency. SQLite benchmark shows that the proposed mechanism reduces the overall elapsed time by 14% and the written data amount up to 72%, compared to the mechanism of BPFS.