A fast file system for UNIX
@article{McKusick1984AFF, title={A fast file system for UNIX}, author={Marshall K. McKusick and William N. Joy and Samuel J. Leffler and Robert S. Fabry}, journal={ACM Trans. Comput. Syst.}, year={1984}, volume={2}, pages={181-197} }
A reimplementation of the UNIX TM file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of…
278 Citations
A fast file system for UNIX
- Computer Science
- 1984
A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of…
Extent-like Performance from a UNIX File System
- Computer ScienceUSENIX Winter
- 1991
The solution arrived at was to approximate the behavior of extent based file systems by grouping I/O operations into clusters instead of dealing in individual blocks, resulting in a factor of two increased sequential performance increase.
An MS-DOS file system for UNIX
- Computer Science
- 1994
DosFs is a new file system for UNIX that uses MS-DOS data structures for permanent storage that provides from 30% to 80% better disk utilization than the 4.3 BSD Fast File System (FFS).
An MS-DOS File System for UNIX Alessandro Forin
- Computer Science
- 1994
DosFs is a new file system for UNIX that uses MS-DOS data structures for permanent storage that provides from 30% to 80% better disk utilization than the 4.3 BSD Fast File System (FFS).
Scalability in the XFS File System
- Computer ScienceUSENIX Annual Technical Conference
- 1996
The architecture and design of a new file system, XFS, for Silicon Graphics' IRIX operating system is described, and the use of B+ trees in place of many of the more traditional linear file system structures are discussed.
it/sfs: A Parallel File System for the CM-5
- Computer ScienceUSENIX Summer
- 1993
This paper describes the creation of a Unix-compatible file system with highly scalable performance and size. The file system is on the CM-5 backed by a scalable array of disks. Using the Unix file…
Reimplementing the Cedar file system using logging and group commit
- Computer ScienceSOSP '87
- 1987
The workstation file system for the Cedar programming environment was modified to improve its robustness and performance and uses group commit, a concept derived from high performance database systems, to gain performance.
An Implementation of a Log-Structured File System for UNIX
- Computer ScienceUSENIX Winter
- 1993
This paper presents a redesign and implementation of the Sprite, a log-structured file system that is more robust and integrated into the vnode interface that is superior to the 4BSD Fast File System (FFS) in a variety of benchmarks and not significantly less than FFS in any test.
A DOS/Linux extensible file system
- Computer ScienceProceedings Second IEEE Symposium on Computer and Communications
- 1997
The authors describe the architecture for an extensible virtual file system (VFS) which allows for the incorporation of a new file system along with existing ones. They describe extending file…
Stupid File Systems Are Better
- Computer ScienceHotOS
- 2005
It is shown that the performance of a current advanced local file system is sensitive to the virtualization parameters of its storage system, which has the advantage of immunizing file systems to changes in their underlying storage systems.
References
SHOWING 1-10 OF 32 REFERENCES
An extensible file system for hydra
- Computer ScienceICSE '78
- 1978
The design and implementation of the Hydra File System is treated and its implications for subsystem design and Implementation are reflected on.
The DEMOS file system
- Computer ScienceSOSP '77
- 1977
The design of the file system for DEMOS, an operating system being developed for the CRAY-1 computer at Los Alamos Scientific Laboratory, is discussed and a simple model of program behavior is used to demonstrate the effect of buffering data by thefile system routines.
Estimating file access time of floppy disks
- Computer ScienceCACM
- 1983
A simple-to-use method of predicting access times with good accuracy is presented, which makes use of simple calibration experiments that provide information related to the hardware and operating system characteristics of the system in use.
The UNIX Time-sharing System
- Computer Science
- 1977
The strong and weak points of UNIX are discussed and a good case can be made that it is in essence a modern implementation of MIT’s CTSS system.
UNIX time-sharing system: UNIX implementation
- Computer ScienceThe Bell System Technical Journal
- 1978
This paper describes in high-level terms the implementation of the resident uNIX∗ kernel and describes how the UNIX system views processes, users, and programs.
Optimal reorganization of distributed space disk files
- Computer ScienceCACM
- 1976
The optimum points at which to reorganize a database are considered, and a disk file organization which allows for distributed free space is described and a cost function describing the excess costs due to physical disorganization is defined.
UNIX implementation
- Computer Science
- 1986
This paper describes in high-level terms the implementation of the resident UNIX† kernel and describes how the UNIX system views processes, users, and programs.
Concurrent Reading While Writing
- Computer ScienceTOPL
- 1983
The problem of asynchronous processes reading shared data while the data are being modified by another process is considered and the number of copies used by all algorithms is shown to be the best possible.
Optimal Selection of CPU Speed, Device Capacities, and File Assignments
- Computer ScienceJACM
- 1980
A technique to significantly reduce the dimensionality of the optimization problem is presented, and the errors introduced by the conversion of an essentially discrete problem into a continuous one are estimated and bounded.