USENIX FAST 2022专题介绍

IF 2.1 3区计算机科学 Q3 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

ACM Transactions on Storage Pub Date : 2022-11-11 DOI:10.1145/3564770

Hildebrand Dean, Donald Porter

{"title":"USENIX FAST 2022专题介绍","authors":"Hildebrand Dean, Donald Porter","doi":"10.1145/3564770","DOIUrl":null,"url":null,"abstract":". This paper presents a detailed investigation and innovative solu-tion for reducing metadata overheads in persistent memory file systems. The authors show that by representing each file as a contiguous region of virtual memory, lookup performance in the file system’s indexes can improve real world workloads such as LevelDB by up to 3.6 × over existing solutions.","PeriodicalId":49113,"journal":{"name":"ACM Transactions on Storage","volume":"18 1","pages":"1 - 2"},"PeriodicalIF":2.1000,"publicationDate":"2022-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Introduction to the Special Section on USENIX FAST 2022\",\"authors\":\"Hildebrand Dean, Donald Porter\",\"doi\":\"10.1145/3564770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". This paper presents a detailed investigation and innovative solu-tion for reducing metadata overheads in persistent memory file systems. The authors show that by representing each file as a contiguous region of virtual memory, lookup performance in the file system’s indexes can improve real world workloads such as LevelDB by up to 3.6 × over existing solutions.\",\"PeriodicalId\":49113,\"journal\":{\"name\":\"ACM Transactions on Storage\",\"volume\":\"18 1\",\"pages\":\"1 - 2\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2022-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Storage\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3564770\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Storage","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3564770","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

.本文提出了一个详细的研究和创新的解决方案，以减少持久内存文件系统中的元数据开销。作者表明，通过将每个文件表示为虚拟内存的连续区域，文件系统索引中的查找性能可以将LevelDB等现实工作负载比现有解决方案提高3.6倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Introduction to the Special Section on USENIX FAST 2022

. This paper presents a detailed investigation and innovative solu-tion for reducing metadata overheads in persistent memory file systems. The authors show that by representing each file as a contiguous region of virtual memory, lookup performance in the file system’s indexes can improve real world workloads such as LevelDB by up to 3.6 × over existing solutions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Storage COMPUTER SCIENCE, HARDWARE & ARCHITECTURE-COMPUTER SCIENCE, SOFTWARE ENGINEERING

CiteScore

4.20

自引率

5.90%

发文量

审稿时长

>12 weeks

期刊介绍： The ACM Transactions on Storage (TOS) is a new journal with an intent to publish original archival papers in the area of storage and closely related disciplines. Articles that appear in TOS will tend either to present new techniques and concepts or to report novel experiences and experiments with practical systems. Storage is a broad and multidisciplinary area that comprises of network protocols, resource management, data backup, replication, recovery, devices, security, and theory of data coding, densities, and low-power. Potential synergies among these fields are expected to open up new research directions.