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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

432 篇 会议
3 篇 期刊文献

馆藏范围

435 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

247 篇 工学
- 239 篇 计算机科学与技术...
- 64 篇 软件工程
- 22 篇 电气工程
- 14 篇 信息与通信工程
- 11 篇 动力工程及工程热...
- 11 篇 控制科学与工程
- 8 篇 化学工程与技术
- 7 篇 网络空间安全
- 6 篇 建筑学
- 5 篇 电子科学与技术（可...
- 5 篇 环境科学与工程（可...
- 4 篇 材料科学与工程（可...
- 4 篇 土木工程
- 4 篇 农业工程
- 3 篇 石油与天然气工程
- 3 篇 生物工程
- 3 篇 安全科学与工程
68 篇 管理学
- 47 篇 图书情报与档案管...
- 24 篇 管理科学与工程(可...
- 17 篇 工商管理
35 篇 理学
- 12 篇 数学
- 12 篇 系统科学
- 7 篇 化学
- 3 篇 地球物理学
- 3 篇 地质学
- 3 篇 生物学
- 2 篇 物理学
16 篇 农学
- 16 篇 作物学
12 篇 经济学
- 12 篇 应用经济学
10 篇 法学
- 9 篇 社会学
1 篇 文学
1 篇 医学

主题

35 篇 digital storage
16 篇 dynamic random a...
14 篇 metadata
11 篇 virtual storage
8 篇 benchmarking
8 篇 file organizatio...
6 篇 file system
6 篇 interplanetary f...
6 篇 blockchains
5 篇 virtualization
5 篇 storage manageme...
4 篇 performance
4 篇 repair
4 篇 data integrity
4 篇 cost effectivene...
4 篇 redundancy
4 篇 cloud storage
4 篇 storage
3 篇 file systems
3 篇 data privacy

机构

13 篇 stony brook univ...
12 篇 microsoft resear...
11 篇 suny stony brook...
10 篇 university of to...
8 篇 university of wi...
7 篇 univ wisconsin m...
7 篇 netapp inc.
7 篇 alibaba group
7 篇 google
6 篇 ibm research
6 篇 nec laboratories...
5 篇 backup recovery ...
4 篇 computer science...
4 篇 netapp inc
4 篇 chinese univ hon...
4 篇 stony brook univ...
4 篇 ibm almaden rese...
4 篇 ibm research-hai...
4 篇 carnegie mellon ...
4 篇 carnegie mellon ...

作者

17 篇 arpaci-dusseau r...
17 篇 arpaci-dusseau a...
14 篇 remzi h. arpaci-...
14 篇 andrea c. arpaci...
13 篇 zadok erez
7 篇 erez zadok
6 篇 shu jiwu
5 篇 ganger gregory r...
5 篇 miller ethan l.
5 篇 lu youyou
5 篇 tarasov vasily
5 篇 agrawal nitin
5 篇 schroeder bianca
5 篇 rangaswami raju
4 篇 steven swanson
4 篇 lee patrick p. c...
4 篇 yuan jun
4 篇 kesavan ram
4 篇 jannen william
4 篇 ungureanu cristi...

语言

432 篇 英文
3 篇 其他

检索条件"任意字段=Proceedings of the 15th Usenix Conference on File and Storage Technologies"

共 435 条记录，以下是101-110 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Fast Erasure Coding for Data storage: A Comprehensive Study of the Acceleration Techniques 17

Fast Erasure Coding for Data Storage: A Comprehensive Study ...

引用

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

作者： Zhou, Tianli Tian, Chao Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9781939133090

Various techniques have been proposed in the literature to improve erasure code computation efficiency, including optimizing bitmatrix design, optimizing computation schedule, common XOR operation reduction, caching management techniques, and vectorization techniques. these techniques were largely proposed individually previously, and in this work, we seek to use them jointly. In order to accomplish this task, these techniques need to be thoroughly evaluated individually, and their relation better understood. Building on extensive test results, we develop methods to systematically optimize the computation chain together with the underlying bitmatrix. this led to a simple design approach of optimizing the bitmatrix by minimizing a weighted cost function, and also a straightforward erasure coding procedure: use the given bitmatrix to produce the computation schedule, which utilizes both the XOR reduction and caching management techniques, and apply XOR level vectorization. this procedure can provide a better performance than most existing techniques, and even compete against well-known codes such as EVENODD, RDP, and STAR codes. Moreover, the result suggests that vectorizing the XOR operation is a better choice than directly vectorizing finite field operations, not only because of the better encoding throughput, but also its minimal migration efforts onto newer CPUs.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Speculative Encryption on GPU Applied to Cryptographic file Systems 17

Speculative Encryption on GPU Applied to Cryptographic File ...

引用

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

作者： Eduardo, Vandeir Erpen de Bona, Luis C. Nunan Zola, Wagner M. Univ Fed Parana Curitiba Parana Brazil Univ Blumenau Blumenau Brazil

ISBN: (纸本)9781939133090

Due to the processing of cryptographic functions, Cryptographic file Systems (CFSs) may require significant processing capacity. Parallel processing techniques on CPUs or GPUs can be used to meet this demand. the CTR mode has two particularly useful features: the ability to be fully parallelizable and to perform the initial step of the encryption process ahead of time, generating encryption masks. this work presents an innovative approach in which the CTR mode is applied in the context of CFSs seeking to exploit these characteristics, including the anticipated production of the cipher masks (speculative encryption) in GPUs. Techniques that demonstrate how to deal with the issue of the generation, storage and management of nonces are presented, an essential component to the operation of the CTR mode in the context of CFSs. Related to GPU processing, our methods work to perform the handling of the encryption contexts and control the production of the masks, aiming to produce them with the adequate anticipation and overcome the extra latency due to encryption tasks. the techniques were applied in the implementation of EncFS++, a user space CFS. Performance analyzes showed that it was possible to achieve significant gains in throughput and CPU efficiency in several scenarios. they also demonstrated that GPU processing can be efficiently applied to CFS encryption workload even when working by encrypting small amounts of data (4 KiB), and in scenarios where higher speed/lower latency storage devices are used, such as SSDs or memory.

关键词： Virtual storage

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reaping the performance of fast NVM storage with uDepot 17

Reaping the performance of fast NVM storage with uDepot

引用

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

作者： Kourtis, Kornilios Ioannou, Nikolas Koltsidas, Ioannis IBM Res Zurich Switzerland Google Mountain View CA 94043 USA

ISBN: (纸本)9781939133090

Many applications require low-latency key-value storage, a requirement that is typically satisfied using key-value stores backed by DRAM. Recently, however, storage devices built on novel NVM technologies offer unprecedented performance compared to conventional SSDs. A key-value store that could deliver the performance of these devices would offer many opportunities to accelerate applications and reduce costs. Nevertheless, existing key-value stores, built for slower SSDs or HDDs, cannot fully exploit such devices. In this paper, we present uDepot, a key-value store built bottom-up to deliver the performance of fast NVM block-based devices. uDepot is carefully crafted to avoid inefficiencies, uses a two-level indexing structure that dynamically adjusts its DRAM footprint to match the inserted items, and employs a novel task-based IO run-time system to maximize performance, enabling applications to use fast NVM devices at their full potential. As an embedded store, uDepot's performance nearly matches the raw performance of fast NVM devices both in terms of throughput and latency, while being scalable across multiple devices and cores. As a server, uDepot significantly outperforms state-of-the-art stores that target SSDs under the YCSB benchmark. Finally, using a Memcache service on top of uDepot we demonstrate that data services built on NVM storage devices can offer equivalent performance to their DRAM-based counterparts at a much lower cost. Indeed, using uDepot we have built a cloud Memcache service that is currently available as an experimental offering in the public cloud.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Optimizing Systems for Byte-Addressable NVM by Reducing Bit Flipping 17

Optimizing Systems for Byte-Addressable NVM by Reducing Bit ...

引用

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

作者： Bittman, Daniel Alvaro, Peter Long, Darrell D. E. Miller, Ethan L. UC Santa Cruz Santa Cruz CA 95064 USA Pure Storage Mountain View CA USA

ISBN: (纸本)9781939133090

New byte-addressable non-volatile memory (BNVM) technologies such as phase change memory (PCM) enable the construction of systems with large persistent memories, improving reliability and potentially reducing power consumption. However, BNVM technologies only support a limited number of lifetime writes per cell and consume most of their power when flipping a bit's state during a write;thus, PCM controllers only rewrite a cell's contents when the cell's value has changed. Prior research has assumed that reducing the number of words written is a good proxy for reducing the number of bits modified, but a recent study has suggested that this assumption may not be valid. Our research confirms that approaches with the fewest writes often have more bit flips than those optimized to reduce bit flipping. To test the effectiveness of bit flip reduction, we built a framework that uses the number of bits flipped over time as the measure of "goodness" and modified a cycle-accurate simulator to count bits flipped during program execution. We implemented several modifications to common data structures designed to reduce power consumption and increase memory lifetime by reducing the number of bits modified by operations on several data structures: linked lists, hash tables, and red-black trees. We were able to reduce the number of bits flipped by up to 3.56X over standard implementations of the same data structures with negligible overhead. We measured the number of bits flipped by memory allocation and stack frame saves and found that careful data placement in the stack can reduce bit flips significantly. these changes require no hardware modifications and neither significantly reduce performance nor increase code complexity, making them attractive for designing systems optimized for BNVM.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

DistCache: Provable Load Balancing for Large-Scale storage Systems with Distributed Caching 17

DistCache: Provable Load Balancing for Large-Scale Storage S...

引用

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

作者： Liu, Zaoxing Bai, Zhihao Liu, Zhenming Li, Xiaozhou Kim, Changhoon Braverman, Vladimir Jin, Xin Stoica, Ion Johns Hopkins Univ Baltimore MD 21218 USA Coll William & Mary Williamsburg VA 23187 USA Barefoot Networks Santa Clara CA USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781939133090

Load balancing is critical for distributed storage to meet strict service-level objectives (SLOs). It has been shown that a fast cache can guarantee load balancing for a clustered storage system. However, when the system scales out to multiple clusters, the fast cache itself would become the bottleneck. Traditional mechanisms like cache partition and cache replication either result in load imbalance between cache nodes or have high overhead for cache coherence. We present DistCache, a new distributed caching mechanism that provides provable load balancing for large-scale storage systems. DistCache co-designs cache allocation with cache topology and query routing. the key idea is to partition the hot objects with independent hash functions between cache nodes in different layers, and to adaptively route queries with the power-of-two-choices. We prove that DistCache enables the cache throughput to increase linearly with the number of cache nodes, by unifying techniques from expander graphs, network flows, and queuing theory. DistCache is a general solution that can be applied to many storage systems. We demonstrate the benefits of DistCache by providing the design, implementation, and evaluation of the use case for emerging switch-based caching.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Could cloud storage be disrupted in the next decade? 20

Could cloud storage be disrupted in the next decade?

引用

proceedings of the 12th usenix conference on Hot Topics in storage and file Systems

作者： Andromachi Chatzieleftheriou Ioan Stefanovici Dushyanth Narayanan Benn thomsen Antony Rowstron Microsoft Research

If you were asked today "What are the three dominant persistent storage technologies used in the cloud in 2020?", you would probably answer HDD, flash and tape. If you were asked this question in 2010 you would have probably answered HDD, flash and tape. Will this answer change when you are asked this question in 2030?.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GIFT: a coupon based throttle-and-reward mechanism for fair and efficient I/O bandwidth management on parallel storage systems 20

GIFT: a coupon based throttle-and-reward mechanism for fair ...

引用

proceedings of the 18th usenix conference on file and storage technologies

作者： Tirthak Patel Rohan Garg Devesh Tiwari Northeastern University Nutanix

ISBN: (纸本)9781939133120

Large-scale parallel applications are highly data-intensive and perform terabytes of I/O routinely. Unfortunately, on a large-scale system where multiple applications run concurrently, I/O contention negatively affects system efficiency and causes unfair bandwidth allocation among applications. To address these challenges, this paper introduces GIFT, a principled dynamic approach to achieve fairness among competing applications and improve system efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A study of SSD reliability in large scale enterprise storage deployments 20

A study of SSD reliability in large scale enterprise storage...

引用

proceedings of the 18th usenix conference on file and storage technologies

作者： Stathis Maneas Kaveh Mahdaviani Tim Emami Bianca Schroeder University of Toronto NetApp

ISBN: (纸本)9781939133120

this paper presents the first large-scale field study of NAND-based SSDs in enterprise storage systems (in contrast to drives in distributed data center storage systems). the study is based on a very comprehensive set of field data, covering 1.4 million SSDs of a major storage vendor (NetApp). the drives comprise three different manufacturers, 18 different models, 12 different capacities, and all major flash technologies (SLC, cMLC, eMLC, 3D-TLC). the data allows us to study a large number of factors that were not studied in previous works, including the effect of firmware versions, the reliability of TLC NAND, and correlations between drives within a RAID system. this paper presents our analysis, along with a number of practical implications derived from it.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Kurma: Secure Geo-Distributed Multi-Cloud storage Gateways 19

Kurma: Secure Geo-Distributed Multi-Cloud Storage Gateways

引用

12th ACM International conference on Systems and storage (SYSTOR)

作者： Chen, Ming Zadok, Erez SUNY Stony Brook Stony Brook NY 11794 USA

ISBN: (纸本)9781450367493

Cloud storage is highly available, scalable, and cost-efficient. Yet, many cannot store data in cloud due to security concerns and legacy infrastructure such as network-attached storage ( NAS). We describe Kurma, a cloud storage gateway system that allows NAS-based programs to seamlessly and securely access cloud storage. To share files among distant clients, Kurma maintains a unified file-system namespace by replicating metadata across geo-distributed gateways. Kurma stores only encrypted data blocks in clouds, keeps file-system and security metadata on-premises, and can verify data integrity and freshness without any trusted third party. Kurma uses multiple clouds to prevent cloud outage and vendor lock-in. Kurma's performance is 52-91% that of a local NFS server while providing geo-replication, confidentiality, integrity, and high availability.

关键词： Multi-cloud cloud storage gateways storage security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共44页 << < 7 8 9 10 11 12 13 14 15 16 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：