Keith A. Smith and Margo I. Seltzer. A Comparison of FFS Disk Allocation Policies. In USENIX Annual Technical Conference, pp. 15-26, January 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Track-aligned Extents: Matching Access Patterns to.. - Schindler, Griffin, .. (2002) (9 citations) (Correct)
....Table 1: Representative disk characteristics. Note the small change in head switch time relative to other characteristics. these facts create a complex storage management problem. Systems can address this problem with combinations of pre allocation heuristics [4, 18] on line reallocation actions [23, 33, 41], and idle time reorganization [2, 24] There is no straightforward solution and the difficulty grows with the target disk request size, because more related data must be clustered. 2.2 Disk characteristics Modern storage protocols, such as SCSI and IDE ATA, expose storage capacity as a linear ....
....this space can be reclaimed if the cache manager can be modified to handle partially valid and partially dirty blocks. Like any clustering storage system, a traxtent based system must address aging and fragmentation and the standard techniques apply: pre allocation [4, 18] online reallocation [23, 33, 41], and off line reorganization [2, 24] For example, when a system determines that a large file is being written, it may be useful to reserve (preallocate) entire traxtents even when writing less than a traxtent worth of data. The same holds when grouping small files [15, 32] When the file system ....
Keith A. Smith and Margo Seltzer. A comparison of FFS disk allocation policies. USENIX. 96 (San Diego, CA., 226 January 1996.
Information and Control in Gray-Box Systems - Arpaci-Dusseau, Arpaci-Dusseau (2001) (6 citations) (Correct)
....e#ect arises in the use of a distributed file system such as AFS; there, reading a single byte of a file would force the fetch of the entire file into the local disk cache. 4. 2 File Layout When accessing files on disk, the exact layout of the files has a strong e#ect on overall performance [38]. In this section, we investigate how we can treat the file system layout algorithm as a gray box, by developing a file layout detector and controller (FLDC) The FLDC layer allows applications to order file accesses for improved performance based on their probable layout on disk. As discussed ....
K. A. Smith and M. I. Seltzer. A Comparison of FFS Disk Allocation Policies. In USENIX Annual Technical Conference, pages 15--26, 1996.
Data Logging: A Method for Efficient Data Updates in.. - Gabber, Korth (1998) (2 citations) (Correct)
....block. Eventually, such blocks are recovered by a garbage collector. A side effect of the dynamic striping process is the loss of physical locality of data. For database systems that often process large scans, this is a serious disadvantage. This may also defeat the advantages of fast file systems[15, 3], which assume a certain block layout on the disk. For systems with mostly short random accesses, the dynamic striping technique can be used as in [8] to cluster hot spots on disk and improve access times. Dynamic striping solves the small write problem at the cost of physical locality of data on ....
K. A. Smith and M. Seltzer. A comparison of FFS disk allocation policies. In Proceedings of the USENIX 1996 Annual Technical Conference, San Diego, CA, pages 15--25, Jan. 1996.
USENIX Association - Usenix (2004) (2 citations) (Correct)
No context found.
Keith A. Smith and Margo I. Seltzer. A Comparison of FFS Disk Allocation Policies. In USENIX Annual Technical Conference, pp. 15-26, January 1996.
OBFS: A File System for Object-based Storage Devices - Feng Wang Scott (2003) (Correct)
No context found.
K. A. Smith and M. I. Seltzer. A comparison of FFS disk allocation policies. In Proceedings of the 1996.
OBFS: A File System for Object-based Storage Devices - Feng Wang Scott (2003) (Correct)
No context found.
K. A. Smith and M. I. Seltzer. A comparison of FFS disk allocation policies. In Proceedings of the 1996.
OBFS: A File System for Object-based Storage Devices - Feng Wang Scott (2004) (Correct)
No context found.
K. A. Smith and M. I. Seltzer. A comparison of FFS disk allocation policies. In Proceedings of the 1996.
File Access Prediction with Adjustable Accuracy - Ahmed Amer Darrell (2002) (9 citations) (Correct)
No context found.
K. A. Smith and M. Seltzer. A comparison of FFS disk allocation policies. In Proceedings of the 1996.
Dynamic Detection of Deterministic Disk Access Patterns - Peacock (2001) (Correct)
No context found.
K. A. Smith and M. Seltzer, A Comparison of FFS Disk Allocation Policies, in Proceedings of the 1996 USENIX Technical Conference, pages 15-26, San Diego, California, January 1996. 63
Deciding when to forget in the Elephant file system - Santry, Feeley.. (1999) (49 citations) (Correct)
No context found.
K.Smith and M.Seltzer. A comparison of FFS disk allocation policies. In Proc. 1996 USENIX Conference, pages 15--26, January 1996.
Embedded Inodes and Explicit Grouping: Exploiting Disk.. - Ganger, Kaashoek (1997) (31 citations) (Correct)
No context found.
K. Smith, M. Seltzer, "A Comparison of FFS Disk Allocation Policies", USENIX Technical Conference, January 1996, pp. 15-25.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC