检索结果-内蒙古大学图书馆

20th usenix conference on file and storage technologies (FAST)

作者： An, Yanzhe Su, Yue Zhu, Yuqing Wang, Jianmin Tsinghua Univ Beijing Peoples R China Huawei Technol Co Ltd Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781939133267

A pressing demand emerges for storing extreme-scale time series data, which are widely generated by industry and research at an increasing speed. Automatically constraining data storage can lower expenses and improve performance, as well as saving storage maintenance efforts at the resource constrained conditions. However, two challenges exist: 1) how to preserve data as much and as long as possible within the storage bound;and, 2) how to respect the importance of data that generally changes with data age. To address the above challenges, we propose time-varying compression that respects data values by compressing data to functions with time as input. Based on time-varying compression, we prove the fundamental design choices regarding when compression must be initiated to guarantee bounded storage. We implement a storage-bounded time series store TVStore based on an open-source time series database. Extensive evaluation results validate the storage-boundedness of TVStore and its time-varying pattern of compression on both synthetic and real-world data, as well as demonstrating its efficiency in writes and queries.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Isotope: ACID Transactions for Block storage

引用

ACM TRANSACTIONS ON storage 2017年第1期13卷 1–25页

作者： Shin, Ji-Yong Balakrishnan, Mahesh Marian, Tudor Weatherspoon, Hakim Cornell Univ Ithaca NY 14853 USA Yale Univ Dept Comp Sci New Haven CT 06511 USA Google Inc 1600 Amphitheatre Pkwy Mountain View CA 94043 USA Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

Existing storage stacks are top heavy and expect little from block storage. As a result, new high-level storage abstractions-and new designs for existing abstractions-are difficult to realize, requiring developers to implement from scratch complex functionality such as failure atomicity and fine-grained concurrency control. In this article, we argue that pushing transactional isolation into the block store (in addition to atomicity and durability) is both viable and broadly useful, resulting in simpler high-level storage systems that provide strong semantics without sacrificing performance. We present Isotope, a new block store that supports ACID transactions over block reads and writes. Internally, Isotope uses a new multiversion concurrency control protocol that exploits fine-grained, subblock parallelism in workloads and offers both strict serializability and snapshot isolation guarantees. We implemented several high-level storage systems over Isotope, including two key-value stores that implement the LevelDB API over a hash table and B-tree, respectively, and a POSIX file system. We show that Isotope's block-level transactions enable systems that are simple (100s of lines of code), robust (i.e., providing ACID guarantees), and fast (e.g., 415MB/s for random file writes). We also show that these systems can be composed using Isotope, providing applications with transactions across different high-level constructs such as files, directories, and key-value pairs.

关键词： Design Experimentation Management Performance Transaction block storage isolation

来源：评论

学校读者我要写书评

暂无评论

Infusing Pub-Sub storage with Transactions 22

Infusing Pub-Sub Storage with Transactions

引用

14th ACM Workshop on Hot Topics in storage and file Systems (Hotstorage)

作者： Rodriguez, Liana V. Bent, John Shaffer, Tim Rangaswami, Raju Florida Int Univ Miami FL 33199 USA Seagate Technol Dublin Ireland

ISBN: (纸本)9781450393997

the need to support new features in existing storage systems is an ongoing concern for storage developers. So is the desire to develop next generation storage systems that can adopt newly developed feature improvements with relative ease. Extending storage systems is challenging because of the inherent complexity of their codebases and the need to ensure that the storage state does not become corrupt or inconsistent when enabling new features. In this work, we examine a new storage architecture, FDMI, that uses the well-established publish-subscribe model for extending the feature set of a host storage system using plugins. A central mechanism in FDMI is transactional coupling. With transactional coupling, the subscribed plugin can either create new transactions that execute asynchronously following the successful completion of the precipitating event or can participate in the pending transaction and control whether the precipitating event itself will or will not be committed. We further create a classification of transactional mechanisms as well as possible desired plugin functionality and explore the matrix of these two classifications to create a new model for faster, safer distributed storage development.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HTMFS: Strong Consistency Comes for Free with Hardware Transactional Memory in Persistent Memory file Systems 20

HTMFS: Strong Consistency Comes for Free with Hardware Trans...

引用

20th usenix conference on file and storage technologies (FAST)

作者： Yi, Jifei Dong, Mingkai Wu, Fangnuo Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Engn Res Ctr Domain Specif Operating Syst Minist Educ Shanghai Peoples R China

ISBN: (纸本)9781939133267

file system designs are usually a trade-off between performance and consistency. A common practice is to sacrifice data consistency for better performance, as if high performance and strong consistency cannot be achieved simultaneously. In this paper, we revisit the trade-off and propose HOP, a lightweight hardware-software cooperative mechanism, to present the feasibility of leveraging hardware transactional memory (HTM) to achieve both high performance and strong consistency in persistent memory (PM) file systems. the key idea of HOP is to pick the updates visible to the file system interface and warp them into HTM. HOP adopts an FS-aware Optimistic Concurrency Control (OCC)-like mechanism to overcome the HTM capacity limitation and utilizes cooperative locks as fallbacks to guarantee progress. We apply HOP to build HTMFS, a user-space PM file system with strong consistency. In the evaluation, HTMFS presents up to 8.4x performance improvement compared to state-of-the-art PM file systems, showing that strong consistency can be achieved in high-performance persistent memory.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Cobalt: Separating content distribution from authorization in distributed file systems 5

Cobalt: Separating content distribution from authorization i...

引用

5th usenix conference on file and storage technologies

作者： Veeraraghavan, Kaushik Myrick, Andrew Flinn, Jason Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9781931971508

How should a distributed file system manage access to protected content? On one hand, distributed storage should make data access pervasive: authorized users should be able to access their data from any location. On the other hand, content protection is designed to restrict access - this is often accomplished by limiting the set of computers from which content can be accessed. In this paper, we propose a new method for storing content in distributed storage called Cobalt. Rather than grant access to data based on the computer that reads the data, Cobalt grants access based on the physical proximity of authorized users. Protected content is stored encrypted in the distributed Blue file System;files can only be decrypted through the cooperation of a personal, mobile device such as cell phone. the Cobalt device is verified by content providers: it acts as a proxy that protects their interests by only decrypting data when policies specified during content acquisition are satisfied. Wireless communication with the device is used to determine the physical proximity of its user;when the Cobalt device moves out of range, protected content is made inaccessible. Our results show that Cobalt adds only modest overhead to content acquisition and playback, yet it enables new forms of interaction such as the ability to access protected content on ad hoc media players and create playlists that adapt to the tastes of nearby users.

关键词： Cobalt

来源：评论

学校读者我要写书评

暂无评论

BPLRU: A buffer management scheme for improving random writes in flash storage 6

BPLRU: A buffer management scheme for improving random write...

引用

6th usenix conference on file and storage technologies

作者： Kim, Hyojun Ahn, Seongjun Software Laboratory of Samsung Electronics South Korea

ISBN: (纸本)9781931971560

Flash memory has become the most important storage media in mobile devices, and is beginning to replace hard disks in desktop systems. However, its relatively poor random write performance may cause problems in the desktop environment, which has much more complicated requirements than mobile devices. While a RAM buffer has been quite successful in hard disks to mask the low efficiency of random writes, managing such a buffer to fully exploit the characteristics of flash storage has still not been resolved. In this paper, we propose a new write buffer management scheme called Block Padding Least Recently Used, which significantly improves the random write performance of flash storage. We evaluate the scheme using trace-driven simulations and experiments with a prototype implementation. It shows about 44% enhanced performance for the workload of MS Office 2003 installation.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity 17

Cluster storage systems gotta have HeART: improving storage ...

引用

17th usenix conference on file and storage technologies (FAST)

作者： Kadekodi, Saurabh Rashmi, K. V. Ganger, Gregory R. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781939133090

Large-scale cluster storage systems typically consist of a heterogeneous mix of storage devices with significantly varying failure rates. Despite such differences among devices, redundancy settings are generally configured in a one-scheme-for-all fashion. In this paper, we make a case for exploiting reliability heterogeneity to tailor redundancy settings to different device groups. We present HeART, an online tuning tool that guides selection of, and transitions between redundancy settings for long-term data reliability, based on observed reliability properties of each disk group. By processing disk failure data over time, HeART identifies the boundaries and steady-state failure rate for each deployed disk group (e.g., by make/model). Using this information, HeART suggests the most space-efficient redundancy option allowed that will achieve the specified target data reliability. Analysis of longitudinal failure data for a large production storage cluster shows the robustness of HeART's failure-rate determination algorithms. the same analysis shows that a storage system guided by HeART could provide target data reliability levels with fewer disks than one-scheme-for-all approaches: 11-16% fewer compared to erasure codes like 10-of-14 or 6-of-9 and 33% fewer compared to 3-way replication.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Using utility to provision storage systems 6

Using utility to provision storage systems

引用

6th usenix conference on file and storage technologies

作者： Strunk, John D. thereska, Eno Faloutsos, Christos Ganger, Gregory R. Carnegie Mellon Univ Pittsburgh PA 15213 USA Microsoft Res Cambridge England

ISBN: (纸本)9781931971560

Provisioning a storage system requires balancing the costs of the solution with the benefits that the solution will provide. Previous provisioning approaches have started with a fixed set of requirements and the goal of automatically finding minimum cost solutions to meet them. Such approaches neglect the cost-benefit analysis of the purchasing decision. Purchasing a storage system involves an extensive set of trade-offs between metrics such as purchase cost, performance, reliability, availability, power, etc. Increases in one metric have consequences for others, and failing to account for these trade-offs can lead to a poor return on the storage investment. Using a collection of storage acquisition and provisioning scenarios, we show that utility functions enable this cost-benefit structure to be conveyed to an automated provisioning tool, enabling the tool to make appropriate trade-offs between different system metrics including performance, data protection, and purchase cost.

关键词： Cost benefit analysis

来源：评论

学校读者我要写书评

暂无评论

FStream: Managing Flash Streams in the file System 16

FStream: Managing Flash Streams in the File System

引用

16th usenix conference on file and storage technologies (FAST)

作者： Rho, Eunhee Joshi, Kanchan Shin, Seung-Uk Shetty, Nitesh Jagadeesh Hwang, Joo-Young Cho, Sangyeun Lee, Daniel D. G. Jeong, Jaeheon Samsung Elect Co Ltd Suwon South Korea

ISBN: (纸本)9781931971423

the performance and lifespan of a solid-state drive (SSD) depend not only on the current input workload but also on its internal media fragmentation formed over time, as stale data are spread over a wide range of physical space in an SSD. the recently proposed streams gives a means for the host system to control how data are placed on the physical media (abstracted by a stream) and effectively reduce the media fragmentation. this work proposes FStream, a file system approach to taking advantage of this facility. FStream extracts streams at the file system level and avoids complex application level data mapping to streams. Experimental results show that FStream enhances the filebench performance by 5%similar to 35% and reduces WAF (Write Amplification Factor) by 7%similar to 46%. For a NoSQL database benchmark, performance is improved by up to 38% and WAF is reduced by up to 81%.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

F2FS: A new file system for flash storage 13

F2FS: A new file system for flash storage

引用

13th usenix conference on file and storage technologies, FAST 2015

作者： Lee, Changman Sim, Dongho Hwang, Joo-Young Cho, Sangyeun S/W Development Team Memory Business Samsung Electronics Co. Ltd

ISBN: (纸本)9781931971201

F2FS is a Linux file system designed to perform well on modern flash storage devices. the file system builds on append-only logging and its key design decisions were made with the characteristics of flash storage in mind. this paper describes the main design ideas, data structures, algorithms and the resulting performance of F2FS. Experimental results highlight the desirable performance of F2FS;on a state-of-the-art mobile system, it outperforms EXT4 under synthetic workloads by up to 3.1× (iozone) and 2× (SQLite). It reduces elapsed time of several realistic workloads by up to 40%. On a server system, F2FS is shown to perform better than EXT4 by up to 2.5× (SATA SSD) and 1.8× (PCIe SSD).

关键词： Virtual storage

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：