English
Related papers

Related papers: How to Write to SSDs

200 papers

As the amount of data produced in society continues to grow at an exponential rate, modern applications are incurring significant performance and energy penalties due to high data movement between the CPU and memory/storage. While…

Hardware Architecture · Computer Science 2024-03-12 Ryan Wong , Nikita Kim , Kevin Higgs , Sapan Agarwal , Engin Ipek , Saugata Ghose , Ben Feinberg

RAID proposal advocated replacing large disks with arrays of PC disks, but as the capacity of small disks increased 100-fold in 1990s the production of large disks was discontinued. Storage dependability is increased via replication or…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-09 Alexander Thomasian

Many contemporary applications feature multi-megabyte instruction footprints that overwhelm the capacity of branch target buffers (BTB) and instruction caches (L1-I), causing frequent front-end stalls that inevitably hurt performance. BTB…

Hardware Architecture · Computer Science 2023-01-11 Truls Asheim , Boris Grot , Rakesh Kumar

Quad-level cell (QLC) flash offers significant benefits in cost and capacity, but its limited reliability leads to frequent read retries, which severely degrade read performance. A common strategy in high-density flash storage is to program…

Hardware Architecture · Computer Science 2025-08-28 Yanyun Wang , Dingcui Yu , Yina Lv , Yunpeng Song , Yumiao Zhao , Liang Shi

Backup storage systems often remove redundancy across backups via inline deduplication, which works by referring duplicate chunks of the latest backup to those of existing backups. However, inline deduplication degrades restore performance…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-23 Yan Kit Li , Min Xu , Chun Ho Ng , Patrick P. C. Lee

Thanks to the mature manufacturing techniques, solid-state drives (SSDs) are highly customizable for applications today, which brings opportunities to further improve their storage performance and resource utilization. However, the SSD…

Hardware Architecture · Computer Science 2021-10-19 Daixuan Li , Jian Huang

Deeply embedded systems often have the tightest constraints on energy consumption, requiring that they consume tiny amounts of current and run on batteries for years. However, they typically execute code directly from flash, instead of the…

Other Computer Science · Computer Science 2021-04-13 James Pallister , Kerstin Eder , Simon Hollis

The overhead of the kernel storage path accounts for half of the access latency for new NVMe storage devices. We explore using BPF to reduce this overhead, by injecting user-defined functions deep in the kernel's I/O processing stack. When…

Operating Systems · Computer Science 2021-02-26 Yu Jian Wu , Hongyi Wang , Yuhong Zhong , Asaf Cidon , Ryan Stutsman , Amy Tai , Junfeng Yang

Due to increasing cache sizes and large leakage consumption of SRAM device, conventional SRAM caches contribute significantly to the processor power consumption. Recently researchers have used non-volatile memory devices to design caches,…

Hardware Architecture · Computer Science 2014-05-01 Sparsh Mittal

Data remanence in NAND flash complicates complete deletion on IoT SSDs. We design an adaptive architecture offering four privacy levels (PL0-PL3) that select among address, data, and parity deletion techniques. Quantitative analysis…

Cryptography and Security · Computer Science 2025-06-24 Na Young Ahn , Dong Hoon Lee

With the continuous increase of online services as well as energy costs, energy consumption becomes a significant cost factor for the evaluation of data center operations. A significant contributor to that is the performance of database…

Databases · Computer Science 2013-03-21 Raik Niemann , Nikolaos Korfiatis , Roberto Zicari , Richard Göbel

Recent studies have demonstrated that near-data processing (NDP) is an effective technique for improving performance and energy efficiency of data-intensive workloads. However, leveraging NDP in realistic systems with multiple memory…

Hardware Architecture · Computer Science 2018-12-05 Hyojong Kim , Ramyad Hadidi , Lifeng Nai , Hyesoon Kim , Nuwan Jayasena , Yasuko Eckert , Onur Kayiran , Gabriel H. Loh

Graph analysis performs many random reads and writes, thus, these workloads are typically performed in memory. Traditionally, analyzing large graphs requires a cluster of machines so the aggregate memory exceeds the graph size. We…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-01-27 Da Zheng , Disa Mhembere , Randal Burns , Joshua Vogelstein , Carey E. Priebe , Alexander S. Szalay

Host-side page victimizations can easily overflow the SSD internal buffer, which interferes I/O services of diverse user applications thereby degrading user-level experiences. To address this, we propose FastDrain, a co-design of OS kernel…

Operating Systems · Computer Science 2020-06-23 Jie Zhang , Miryeong Kwon , Sanghyun Han , Nam Sung Kim , Mahmut Kandemir , Myoungsoo Jung

Index structures are one of the most important tools that DBAs leverage to improve the performance of analytics and transactional workloads. However, building several indexes over large datasets can often become prohibitive and consume…

Databases · Computer Science 2020-03-26 Alex Galakatos , Michael Markovitch , Carsten Binnig , Rodrigo Fonseca , Tim Kraska

LSM-tree-based data stores are widely adopted in industries for their excellent performance. As data scales increase, disk-based join operations become indispensable yet costly for the database, making the selection of suitable join methods…

Databases · Computer Science 2026-03-03 Weiping Yu , Fan Wang , Xuwei Zhang , Siqiang Luo

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer…

Information Theory · Computer Science 2015-01-05 Eyal En Gad , Eitan Yaakobi , Anxiao , Jiang , Jehoshua Bruck

The $B^{\epsilon}$-tree [Brodal and Fagerberg 2003] is a simple I/O-efficient external-memory-model data structure that supports updates orders of magnitude faster than B-tree with a query performance comparable to the B-tree: for any…

Data Structures and Algorithms · Computer Science 2022-11-14 Rathish Das , John Iacono , Yakov Nekrich

Modern caches are often required to handle a massive amount of data, which exceeds the amount of available memory; thus, hybrid caches, specifically DRAM/SSD combination, become more and more prevalent. In such environments, in addition to…

Operating Systems · Computer Science 2022-06-28 Ohad Eytan , Roy Friedman

Systems that require high-throughput and fault tolerance, such as key-value stores and databases, are looking to persistent memory to combine the performance of in-memory systems with the data-consistent fault-tolerance of nonvolatile…

Databases · Computer Science 2020-02-07 Brian Choi , Parv Saxena , Ryan Huang , Randal Burns