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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

431 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

257 篇 工学
- 250 篇 计算机科学与技术...
- 69 篇 软件工程
- 24 篇 电气工程
- 13 篇 信息与通信工程
- 8 篇 动力工程及工程热...
- 8 篇 控制科学与工程
- 6 篇 电子科学与技术（可...
- 6 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 农业工程
- 4 篇 生物工程
- 3 篇 材料科学与工程（可...
- 3 篇 土木工程
- 3 篇 交通运输工程
- 2 篇 化学工程与技术
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
66 篇 管理学
- 48 篇 图书情报与档案管...
- 21 篇 管理科学与工程(可...
- 14 篇 工商管理
35 篇 理学
- 15 篇 系统科学
- 12 篇 数学
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 化学
- 2 篇 大气科学
- 2 篇 统计学（可授理学、...
16 篇 农学
- 16 篇 作物学
10 篇 经济学
- 10 篇 应用经济学
8 篇 法学
- 8 篇 社会学

主题

40 篇 digital storage
18 篇 metadata
16 篇 dynamic random a...
10 篇 virtual storage
8 篇 benchmarking
7 篇 file organizatio...
6 篇 performance
5 篇 virtualization
4 篇 repair
4 篇 cost effectivene...
4 篇 redundancy
4 篇 storage manageme...
3 篇 file systems
3 篇 scalability
3 篇 file system
3 篇 fault tolerance
3 篇 random access st...
3 篇 design
3 篇 locks (fasteners...
3 篇 scheduling

机构

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

作者

20 篇 arpaci-dusseau r...
20 篇 arpaci-dusseau a...
14 篇 remzi h. arpaci-...
14 篇 andrea c. arpaci...
13 篇 zadok erez
7 篇 erez zadok
7 篇 schroeder bianca
6 篇 shu jiwu
6 篇 tarasov vasily
6 篇 thereska eno
6 篇 rangaswami raju
5 篇 lee patrick p. c...
5 篇 ganger gregory r...
5 篇 yuan jun
5 篇 miller ethan l.
5 篇 jannen william
5 篇 farach-colton ma...
5 篇 swanson steven
5 篇 agrawal nitin
5 篇 zhan yang

语言

436 篇 英文
1 篇 俄文

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

共 437 条记录，以下是91-100 订阅

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

详细简洁

排序：

High-performance transaction processing in journaling file systems 16

High-performance transaction processing in journaling file s...

引用

16th usenix conference on file and storage technologies, FAST 2018

作者： Son, Yongseok Kim, Sunggon Yeom, Heon Young Han, Hyuck Seoul National University Korea Republic of Dongduk Women's University Korea Republic of

ISBN: (纸本)9781931971423

Journaling file systems provide crash-consistency to applications by keeping track of uncommitted changes in the journal area (journaling) and writing committed changes to their original area at a certain point (checkpointing). they generally use coarse-grained locking to access shared data structures and perform I/O operations by a single thread. For these reasons, journaling file systems often face the problem of lock contention and underutilization of I/O bandwidth on multi-cores with high-performance storage. To address these issues, we design journaling and checkpointing schemes that enable concurrent updates on data structures and parallelize I/O operations. We implement our schemes in EXT4/JBD2 and evaluate them on a 72-core machine with a high-performance NVMe SSD. the experimental results show that our optimized file system improves the performance by up to about 2.2x and 1.5x compared to the existing EXT4 file system and a recent scalable file system, respectively.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

OpenEC: Toward Unified and Configurable Erasure Coding Management in Distributed storage Systems 17

OpenEC: Toward Unified and Configurable Erasure Coding Manag...

引用

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

作者： Li, Xiaolu Li, Runhui Lee, Patrick P. C. Hu, Yuchong Chinese Univ Hong Kong Hong Kong Peoples R China Huazhong Univ Sci & Technol Wuhan Hubei Peoples R China

ISBN: (纸本)9781939133090

Erasure coding becomes a practical redundancy technique for distributed storage systems to achieve fault tolerance with low storage overhead. Given its popularity, research studies have proposed theoretically proven erasure codes or efficient repair algorithms to make erasure coding more viable. However, integrating new erasure coding solutions into existing distributed storage systems is a challenging task and requires non-trivial re-engineering of the underlying storage workflows. We present OpenEC, a unified and configurable framework for readily deploying a variety of erasure coding solutions into existing distributed storage systems. OpenEC decouples erasure coding management from the storage workflows of distributed storage systems, and provides erasure coding designers with configurable controls of erasure coding operations through a directed-acyclic-graph-based programming abstraction. We prototype OpenEC on two versions of HDFS with limited code modifications. Experiments on a local cluster and Amazon EC2 show that OpenEC preserves both the operational performance and the properties of erasure coding solutions;OpenEC can also automatically optimize erasure coding operations to improve repair performance.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

On the Performance Variation in Modern storage Stacks 15

On the Performance Variation in Modern Storage Stacks

引用

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

作者： Cao, Zhen Tarasov, Vasily Raman, Hari Prasath Hildebrand, Dean Zadok, Erez SUNY Stony Brook Stony Brook NY 11794 USA IBM Res Almaden San Diego CA USA

ISBN: (纸本)9781931971362

Ensuring stable performance for storage stacks is important, especially with the growth in popularity of hosted services where customers expect QoS guarantees. the same requirement arises from benchmarking settings as well. One would expect that repeated, carefully controlled experiments might yield nearly identical performance results-but we found otherwise. We therefore undertook a study to characterize the amount of variability in benchmarking modern storage stacks. In this paper we report on the techniques used and the results of this study. We conducted many experiments using several popular workloads, file systems, and storage devices-and varied many parameters across the entire storage stack. In over 25% of the sampled configurations, we uncovered variations higher than 10% in storage performance between runs. We analyzed these variations and found that there was no single root cause: it often changed with the workload, hardware, or software configuration in the storage stack. In several of those cases we were able to fix the cause of variation and reduce it to acceptable levels. We believe our observations in benchmarking will also shed some light on addressing stability issues in production systems.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Exploiting Combined Locality for Wide-Stripe Erasure Coding in Distributed storage 19

Exploiting Combined Locality for Wide-Stripe Erasure Coding ...

引用

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

作者： Hu, Yuchong Cheng, Liangfeng Yao, Qiaori Lee, Patrick P. C. Wang, Weichun Chen, Wei Huazhong Univ Sci & Technol Wuhan Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China HIKVISION Hangzhou Peoples R China

ISBN: (纸本)9781939133205

Erasure coding is a low-cost redundancy mechanism for distributed storage systems by storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the fraction of parity chunks in a stripe to achieve extreme storage savings. However, wide stripes aggravate the repair penalty, while existing repair-efficient approaches for erasure coding cannot effectively address wide stripes. In this paper, we propose combined locality, the first mechanism that systematically addresses the wide-stripe repair problem via the combination of both parity locality and topology locality. We further augment combined locality with efficient encoding and update schemes. Experiments on Amazon EC2 show that combined locality reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-arts, with only a redundancy of as low as 1.063x

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

End-to-end data integrity for file systems: A ZFS case study 8

End-to-end data integrity for file systems: A ZFS case study

引用

8th usenix conference on file and storage technologies, FAST 2010

作者： Zhang, Yupu Rajimwale, Abhishek Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Remzi H. Computer Sciences Department University of Wisconsin-Madison United States

ISBN: (纸本)9781931971744

We present a study of the effects of disk and memory corruption on file system data integrity. Our analysis focuses on Sun's ZFS, a modern commercial offering with numerous reliability mechanisms. through careful and thorough fault injection, we show that ZFS is robust to a wide range of disk faults. We further demonstrate that ZFS is less resilient to memory corruption, which can lead to corrupt data being returned to applications or system crashes. Our analysis reveals the importance of considering both memory and disk in the construction of truly robust file and storage systems.

关键词： Reliability analysis

来源：评论

学校读者我要写书评

暂无评论

Avoiding the disk bottleneck in the data domain deduplication file system 6

Avoiding the disk bottleneck in the data domain deduplicatio...

引用

6th usenix conference on file and storage technologies

作者： Zhu, Benjamin Li, Kai Patterson, Hugo Data Domain Inc. Princeton University United States

ISBN: (纸本)9781931971560

Disk-based deduplication storage has emerged as the new-generation storage system for enterprise data protection to replace tape libraries. Deduplication removes redundant data segments to compress data into a highly compact form and makes it economical to store backups on disk instead of tape. A crucial requirement for enterprise data protection is high throughput, typically over 100 MB/sec, which enables backups to complete quickly. A significant challenge is to identify and eliminate duplicate data segments at this rate on a low-cost system that cannot afford enough RAM to store an index of the stored segments and may be forced to access an on-disk index for every input segment. this paper describes three techniques employed in the production Data Domain deduplication file system to relieve the disk bottleneck. these techniques include: (1) the Summary Vector, a compact in-memory data structure for identifying new segments;(2) Stream-Informed Segment Layout, a data layout method to improve on-disk locality for sequentially accessed segments;and (3) Locality Preserved Caching, which maintains the locality of the fingerprints of duplicate segments to achieve high cache hit ratios. Together, they can remove 99% of the disk accesses for deduplication of real world workloads. these techniques enable a modern two-socket dual-core system to run at 90% CPU utilization with only one shelf of 15 disks and achieve 100 MB/sec for single-stream throughput and 2 10 MB/sec for multi-stream throughput.

关键词： throughput

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MixApart: Decoupled analytics for shared storage systems 11

MixApart: Decoupled analytics for shared storage systems

引用

11th usenix conference on file and storage technologies, FAST 2013

作者： Mihailescu, Madalin Soundararajan, Gokul Amza, Cristiana University of Toronto NetApp Inc.

Distributed file systems built for data analytics and enterprise storage systems have very different functionality requirements. For this reason, enabling analytics on enterprise data commonly introduces a separate analytics storage silo. this generates additional costs, and inefficiencies in data management, e.g., whenever data needs to be archived, copied, or migrated across silos. MixApart uses an integrated data caching and scheduling solution to allow MapReduce computations to analyze data stored on enterprise storage systems. the frontend caching layer enables the local storage performance required by data analytics. the shared storage back-end simplifies data management. We evaluate MixApart using a 100-core Amazon EC2 cluster with micro-benchmarks and production workload traces. Our evaluation shows that MixApart provides (i) up to 28% faster performance than the traditional ingestthen- compute workflows used in enterprise IT analytics, and (ii) comparable performance to an ideal Hadoop setup without data ingest, at similar cluster sizes. © 2016 Australian Society of Sugar Cane Technologists. All rights reserved.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Argon: Performance insulation for shared storage servers 5

Argon: Performance insulation for shared storage servers

引用

5th usenix conference on file and storage technologies

作者： Wachs, Matthew Abd-El-Malek, Michael thereska, Eno Ganger, Gregory R. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781931971508

Services that share a storage system should realize the same efficiency, within their share of time, as when they have the system to themselves. the Argon storage server explicitly manages its resources to bound the inefficiency arising from inter-service disk and cache interference in traditional systems. the goal is to provide each service with at least a configured fraction (e.g., 0.9) of the throughput it achieves when it has the storage server to itself, within its share of the server-a service allocated 1/nth of a server should get nearly 1/nth (or more) of the throughput it would get alone. Argon uses automatically-configured prefetch/write-back sizes to insulate streaming, efficiency from disk seeks introduced by competing workloads. It uses explicit disk time quanta to do the same for non-streaming workloads with internal locality. It partitions the cache among services, based on their observed access patterns, to insulate the hit rate each achieves from the access patterns of others. Experiments show that, combined, these mechanisms and Argon's automatic configuration of each achieve the insulation goal.

关键词： Argon

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：