The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The design and implementation of a log-structured file system
Open accessAbstract
This paper presents a new technique for disk storage management called a log-structured file system. A log-structured file system writes all modifications to disk sequentially in a log-like structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk; it contains indexing information so that files can be read back from the log efficiently. In order to maintain large free areas on disk for fast writing, we divide the log into segments and use a segment cleaner to compress the live information from heavily fragmented segments. We present a series of simulations that demonstrate the efficiency of a simple cleaning policy based on cost and benefit. We have implemented a prototype log-structured file system called Sprite LFS; it outperforms current Unix file systems by an order of magnitude for small-file writes while matching or exceeding Unix performance for reads and large writes. Even when the overhead for cleaning is included, Sprite LFS can use 70% of the disk bandwidth for writing, whereas Unix file systems typically can use only 5–10%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
McKusick, M. K., Joy, W. N., Leffler, S. J., & Fabry, R. S. (1984) · ACM Transactions on Computer Systems · doi:10.1145/989.990 · Cited by 749
Design and implementation of the Sun network filesystem
Sandberg, R., Golgberg, D., Kleiman, S. R., Walsh, D., & Lyon, B. (1988) · Artech House, Inc. eBooks · Cited by 730
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
A trace-driven analysis of the UNIX 4.2 BSD file system
Ousterhout, J. K., Da Costa, H., Harrison, D., Kunze, J. A., Kupfer, M., & Thompson, J. G. (1985) · ACM SIGOPS Operating Systems Review · doi:10.1145/323627.323631 · Cited by 495
Self-citationThe Sprite network operating system
Ousterhout, J. K., Cherenson, A. R., Douglis, F., Nelson, M. N., & Welch, B. B. (1988) · Computer · doi:10.1109/2.16 · Cited by 460
Self-citationWhy Aren't Operating Systems Getting Faster As Fast as Hardware?
Ousterhout, J. K. (1990) · Cited by 331
Self-citationA trace-driven analysis of the UNIX 4.2 BSD file system
Ousterhout, J. K., Da Costa, H., Harrison, D., Kunze, J. A., Kupfer, M., & Thompson, J. G. (1985) · Proceedings of the tenth ACM symposium on Operating systems principles · doi:10.1145/323647.323631 · Cited by 264
Self-citation
Cited by
A survey of mobile cloud computing: architecture, applications, and approaches
Dinh, H. T., Lee, C., Niyato, D., & Wang, P. (2013) · Wireless Communications and Mobile Computing · doi:10.1002/wcm.1203 · Cited by 2,391
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
Better I/O through byte-addressable, persistent memory
Condit, J., Nightingale, E. B., Frost, C., Ipek, E., Lee, B., Burger, D., & Coetzee, D. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629589 · Cited by 824
Mnemosyne: lightweight persistent memory
Volos, H., Tack, A. J., & Swift, M. M. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950379 · Cited by 711
A space-efficient flash translation layer for CompactFlash systems
Kim, J., Kim, J. M., Noh, S. H., Min, S. L., & Cho, Y. (2002) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2002.1010143 · Cited by 697
X-Stream: edge-centric graph processing using streaming partitions
Roy, A., Mihailovic, I., & Zwaenepoel, W. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522740 · Cited by 673
System software for persistent memory
Dulloor, S. R., Kumar, S., Keshavamurthy, A., Lantz, P., Reddy, D., Sankaran, R., & Jackson, J. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592814 · Cited by 617
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Dynamic storage allocation: A survey and critical review
Wilson, P. R., Johnstone, M. S., Neely, M., & Boles, D. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60368-9_19 · Cited by 594
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
Chen, F., Koufaty, D. A., & Zhang, X. (2009) · Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems · doi:10.1145/1555349.1555371 · Cited by 469
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., et al. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1713254.1713276 · Cited by 447
Self-citationMaking information flow explicit in HiStar
Zeldovich, N., Boyd-Wickizer, S., Kohler, E., & Mazières, D. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298481 · Cited by 415
TrustCloud: A Framework for Accountability and Trust in Cloud Computing
Ko, R. K. L., Jagadpramana, P., Mowbray, M., Pearson, S., Kirchberg, M., Liang, Q., & Lee, B. S. (2011) · 2011 IEEE World Congress on Services · doi:10.1109/services.2011.91 · Cited by 411
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
Self-citationIvy: a read/write peer-to-peer file system
Muthitacharoen, A., Morris, R., Gil, T. M., & Chen, B. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844132 · Cited by 351
Write amplification analysis in flash-based solid state drives
Hu, X.-Y., Eleftheriou, E., Haas, R., Iliadis, I., & Pletka, R. (2009) · Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference · doi:10.1145/1534530.1534544 · Cited by 313
Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases
Verbitski, A., Gupta, A., Saha, D., Brahmadesam, M., Gupta, K., Mittal, R., Krishnamurthy, S., Maurice, S., Kharatishvili, T., & Bao, X. (2017) · Proceedings of the 2017 ACM International Conference on Management of Data · doi:10.1145/3035918.3056101 · Cited by 290
Software strategies for portable computer energy management
Lorch, J. R., & Smith, A. J. (1998) · IEEE Personal Communications · doi:10.1109/98.683740 · Cited by 273
Replication in the harp file system
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., & Williams, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121169 · Cited by 273
Ousterhout, J., Gopalan, A., Gupta, A., Kejriwal, A., Lee, C., Montazeri, B., Ongaro, D., Park, S. J., Qin, H., Rosenblum, M., et al. (2015) · ACM Transactions on Computer Systems · doi:10.1145/2806887 · Cited by 268
Self-citationUsing Crash Hoare logic for certifying the FSCQ file system
Chen, H., Ziegler, D., Chajed, T., Chlipala, A., Kaashoek, M. F., & Zeldovich, N. (2015) · Proceedings of the 25th Symposium on Operating Systems Principles · doi:10.1145/2815400.2815402 · Cited by 211
Kafka, Samza and the Unix Philosophy of Distributed Data
Kleppmann, M., & Kreps, J. (2015) · IEEE · doi:10.17863/cam.33349 · Cited by 37
Metadata
- Authors
- Rosenblum, M., & Ousterhout, J. K.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1992-02
- Volume
- 10
- Issue
- 1
- Pages
- 26-52
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2108183412
- Cited by
- 1,268
- References
- 10
- FWCI
- 28.79
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.