ABR: CSR: Medium: Collaborative Research: FTFS: A Read/Write Optimized Fractal Tree File System

ABR：CSR：媒介：协作研究：FTFS：读/写优化的分形树文件系统

• 批准号: 1938709
• 负责人: Michael Bender
• 金额: $ 85.68万
• 依托单位: SUNY at Stony Brook
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-10-01 至 2023-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1938709&HistoricalAwards=false
• 关键词: ABR; CSR; Medium; Collaborative; Research

Computer applications rely on file systems to read, write, and access user data safely and efficiently. Unfortunately, conventional file system designs make some applications fast at the expense of others; similarly, most file systems are designed to perform well on one particular type of storage device, such as a hard disk drive (HDD) or flash-based solid-state drive (SSD). Currently, a wide variety of end-users do not realize the full performance potential of their storage hardware, unless they are able to select a file system that is well-matched to their specific workload and hardware. Prior work on the BetrFS file system prototype demonstrated that, with better on-disk data structures, it is possible to build a single file system that roughly matches or exceeds the performance of the best file system for any workload on an HDD. This project will extend these performance gains, which are enabled by a tight, cross-disciplinary collaboration between systems and theory researchers, to a wider range of storage hardware, ranging from complex, archival devices (such as shingled magnetic recording drives), to very fast flash devices (such as non-volatile memory express devices). This project will also investigate a more efficient approach to directory-level cloning, a useful building block for both server workloads and personal computing systems. By making a large swath of applications run faster across a range of storage hardware, this project can have significant real-world benefits. Storage hardware is becoming increasingly varied, and this project can help future-proof the performance of any application, from commerce to health-care to scientific computing to education. This project involves an important component to transition these ideas from research to practice, including maturing the open-source BetrFS prototype, as well as continuing outreach and tutorials for practitioners. This project will continue training both undergraduate and graduate students to design, analyze, build, and measure algorithmically sound computer systems that are unlike anything they have seen previously.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

计算机应用程序依靠文件系统来安全有效地读取，写入和访问用户数据。不幸的是，传统的文件系统设计使某些应用程序以牺牲其他应用程序为代价。同样，大多数文件系统旨在在一种特定类型的存储设备上（例如硬盘驱动器（HDD）或基于Flash基于Flash的固态驱动器（SSD））的运行良好。当前，除非能够选择与特定的工作负载和硬件匹配的文件系统，否则各种各样的最终用户尚未意识到其存储硬件的全部性能潜力。 BETRFS文件系统原型上的先前工作表明，有了更好的磁盘数据结构，可以构建一个大致匹配或超过HDD上任何工作负载的最佳文件系统的单个文件系统。 该项目将扩大这些性能的增长，这些绩效取得通过系统和理论研究人员之间的紧密，跨学科的合作来实现，再到更广泛的存储硬件，从复杂的，档案设备（例如带状的磁性记录驱动器）到非常快速的闪光设备（例如非volatile Memory Embory Express设备）。 该项目还将研究一种更有效的目录级克隆方法，这是服务器工作负载和个人计算系统的有用构建块。 通过使大量应用程序在各种存储硬件上运行速度更快，该项目可以具有重大的现实好处。 存储硬件的变化越来越多，该项目可以帮助未来的应用程序，从商业到医疗保健，科学计算再到教育。 该项目涉及将这些思想从研究过渡到实践的重要组成部分，包括将开源的Betrfs原型以及继续为从业者提供延伸和教程。 该项目将继续培训本科生和研究生，以设计，分析，构建和测量与以前见过的任何事物不同的算法的计算机系统。该奖项反映了NSF的法定任务，并被认为是值得通过基金会的知识分子优点和更广泛影响的审查标准来通过评估来进行评估的。

项目成果

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization

用弦将多边形切割成小块：基于激光的定位

• DOI: 10.4230/lipics.esa.2020.7
• 发表时间: 2020
• 期刊: Leibniz international proceedings in informatics
• 作者: Arkin, Esther;Das, Rathish;Gao, Jie;Goswami, Mayank;Mitchell, Joseph;Polishchuk, Valentin;Toth, Csaba.
• 通讯作者: Toth, Csaba.

Online Parallel Paging with Optimal Makespan

• DOI: 10.1145/3490148.3538577
• 发表时间: 2022-07
• 期刊: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
• 作者: Kunal Agrawal;M. A. Bender;Rathish Das;William Kuszmaul;E. Peserico;Michele Scquizzato

An Associativity Threshold Phenomenon in Set-Associative Caches

• DOI: 10.1145/3558481.3591084
• 发表时间: 2023-04
• 期刊: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
• 作者: M. A. Bender;Rathish Das;Martín Farach-Colton;Guido Tagliavini

SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value Stores

• 发表时间: 2020
• 作者: Alex Conway;Abhishek K. Gupta;Vijay Chidambaram;Martín Farach-Colton;Richard P. Spillane;Amy Tai;Rob Johnson

Timely Reporting of Heavy Hitters using External Memory

使用外部存储器及时报告重要人物

• 发表时间: 2021
• 期刊: SIGMOD record
• 影响因子: 1.1
• 作者: Singh, S;Pandey, P;Bender, M.;Berry, J.;Farach-Colton, M;Johnson, R;Kroeger, T.;Phillips, C
• 通讯作者: Phillips, C