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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

431 篇 英文
4 篇 其他

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

共 435 条记录，以下是221-230 订阅

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

详细简洁

排序：

Raidshield: Characterizing, monitoring, and proactively protecting against disk failures 13

Raidshield: Characterizing, monitoring, and proactively prot...

引用

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

作者： Ma, Ao Douglis, Fred Lu, Guanlin Sawyer, Darren Chandra, Surendar Hsu, Windsor EMC Corporation Datrium Inc.

ISBN: (纸本)9781931971201

Modern storage systems orchestrate a group of disks to achieve their performance and reliability goals. Even though such systems are designed to withstand the failure of individual disks, failure of multiple disks poses a unique set of challenges. We empirically investigate disk failure data from a large number of production systems, specifically focusing on the impact of disk failures on RAID storage systems. Our data covers about one million SATA disks from 6 disk models for periods up to 5 years. We show how observed disk failures weaken the protection provided by RAID. the count of reallocated sectors correlates strongly with impending failures. With these findings we designed RAIDSHIELD, which consists of two components. First, we have built and evaluated an active defense mechanism that monitors the health of each disk and replaces those that are predicted to fail imminently. this proactive protection has been incorporated into our product and is observed to eliminate 88% of triple disk errors, which are 80% of all RAID failures. Second, we have designed and simulated a method of using the joint failure probability to quantify and predict how likely a RAID group is to face multiple simultaneous disk failures, which can identify disks that collectively represent a risk of failure even when no individual disk is flagged in isolation. We find in simulation that RAID-level analysis can effectively identify most vulnerable RAID-6 systems, improving the coverage to 98% of triple errors.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Reducing solid-state storage device write stress through opportunistic in-place delta compression 16

Reducing solid-state storage device write stress through opp...

引用

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

作者： Xuebin Zhang Jiangpeng Li Hao Wang Kai Zhao Tong Zhang ECSE Department Rensselaer Polytechnic Institute SanDisk Corporation

ISBN: (纸本)9781931971287

Inside modern SSDs, a small portion of MLC/TLC NAND flash memory blocks operate in SLC-mode to serve as write buffer/cache and/or store hot data. these SLC-mode blocks absorb a large percentage of write operations. To balance memory wear-out, such MLC/TLC-to-SLC configuration rotates among all the memory blocks inside SSDs. this paper presents a simple yet effective design approach to reduce write stress on SLC-mode flash blocks and hence improve the overall SSD lifetime. the key is to implement well-known delta compression without being subject to the read latency and data management complexity penalties inherent to conventional practice. the underlying theme is to leverage the partial programmability of SLC-mode flash memory pages to ensure that the original data and all the subsequent deltas always reside in the same memory physical page. To avoid the storage capacity overhead, we further propose to combine intra-sector lossless data compression with intra-page delta compression, leading to opportunistic in-place delta compression. this paper presents specific techniques to address important issues for its practical implementation, including data error correction, and intra-page data placement and management. We carried out comprehensive experiments, simulations, and ASIC (application-specific integrated circuit) design. the results show that the proposed design solution can largely reduce the write stress on SLC-mode flash memory pages without significant latency overhead and meanwhile incurs relatively small silicon implementation cost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Non-blocking writes to files 13

Non-blocking writes to files

引用

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

作者： Campello, Daniel Lopez, Hector Useche, Luis Koller, Ricardo Rangaswami, Raju Florida International University United States Google Inc IBM TJ Watson Research Center

ISBN: (纸本)9781931971201

Writing data to a page not present in the file-system page cache causes the operating system to synchronously fetch the page into memory first. Synchronous page fetch defines both policy (when) and mechanism (how), and always blocks the writing process. Non-blocking writes eliminate such blocking by buffering the written data elsewhere in memory and unblocking the writing process immediately. Subsequent reads to the updated page locations are also made non-blocking. this new handling of writes to non-cached pages allow processes to overlap more computation with I/O and improves page fetch I/O throughput by increasing fetch parallelism. Our empirical evaluation demonstrates the potential of non-blocking writes in improving the overall performance of systems with no loss of performance when workloads cannot benefit from it. Across the filebench write workloads, non-blocking writes improve benchmark throughput by 7X on average (up to 45.4X) when using disk drives and by 2.1X on average (up to 4.2X) when using SSDs. For the SPECsfs2008 benchmark, non-blocking writes decrease overall average latency of NFS operations between 3.5% and 70% and average write latency between 65% and 79%. When replaying the MobiBench file system traces, non-blocking writes decrease average operation latency by 20-60%.

关键词： file organization

来源：评论

学校读者我要写书评

暂无评论

SDGEN: Mimicking datasets for content generation in storage benchmarks 13

SDGEN: Mimicking datasets for content generation in storage ...

引用

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

作者： Gracia-Tinedo, Raúl Harnik, Danny Naor, Dalit Sotnikov, Dmitry Toledo, Sivan Zuck, Aviad Universitat Rovira i Virgili Spain IBM Research-Haifa Israel Tel-Aviv University Israel

ISBN: (纸本)9781931971201

storage system benchmarks either use samples of proprietary data or synthesize artificial data in simple ways (such as using zeros or random data). However, many storage systems behave completely differently on such artificial data than they do on real-world data. this is the case with systems that include data reduction techniques, such as compression and/or deduplication. To address this problem, we propose a benchmarking methodology called mimicking and apply it in the domain of data compression. Our methodology is based on characterizing the properties of real data that influence the performance of compressors. then, we use these characterizations to generate new synthetic data that mimics the real one in many aspects of compression. Unlike current solutions that only address the compression ratio of data, mimicking is flexible enough to also emulate compression times and data heterogeneity. We show that these properties matter to the system’s performance. In our implementation, called SDGen, characterizations take at most 2.5KB per data chunk (e.g., 64KB) and can be used to efficiently share benchmarking data in a highly anonymized fashion;sharing it carries few or no privacy concerns. We evaluated our data generator’s accuracy on compressibility and compression times using real-world datasets and multiple compressors (lz4, zlib, bzip2 and lzma). As a proof-of-concept, we integrated SDGen as a content generation layer in two popular benchmarks (LinkBench and Impressions).

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

NV-Tree: Reducing consistency cost for NVM-based single level systems 13

NV-Tree: Reducing consistency cost for NVM-based single leve...

引用

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

作者： Yang, Jun Wei, Qingsong Chen, Cheng Wang, Chundong Yong, Khai Leong He, Bingsheng Data Storage Institute A-STAR Singapore Nanyang Technological University Singapore

ISBN: (纸本)9781931971201

the non-volatile memory (NVM) has DRAM-like performance and disk-like persistency which make it possible to replace both disk and DRAM to build single level systems. To keep data consistency in such systems is non-trivial because memory writes may be reordered by CPU and memory controller. In this paper, we study the consistency cost for an important and common data structure, B+Tree. Although the memory fence and CPU cacheline flush instructions can order memory writes to achieve data consistency, they introduce a significant overhead (more than 10X slower in performance). Based on our quantitative analysis of consistency cost, we propose NV-Tree, a consistent and cache-optimized B+Tree variant with reduced CPU cacheline flush. We implement and evaluate NV-Tree and NV-Store, a key-value store based on NV-Tree, on an NVDIMM server. NV-Tree outperforms the state-of-art consistent tree structures by up to 12X under write-intensive workloads. NV-Store increases the throughput by up to 4.8X under YCSB workloads compared to Redis.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

BetRFS: A right-optimized write-optimized file system 13

BetRFS: A right-optimized write-optimized file system

引用

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

作者： Jannen, William Yuan, Jun Zhan, Yang Akshintala, Amogh Esmet, John Jiao, Yizheng Mittal, Ankur Pandey, Prashant Reddy, Phaneendra Walsh, Leif Bender, Michael Farach-Colton, Martin Johnson, Rob Kuszmaul, Bradley C. Porter, Donald E. Stony Brook University United States Tokutek Inc Rutgers University United States Massachusetts Institute of Technology United States

ISBN: (纸本)9781931971201

the Be-tree file System, or BetrFS, (pronounced "better eff ess") is the first in-kernel file system to use a write-optimized index. Write optimized indexes (WOIs) are promising building blocks for storage systems because of their potential to implement both microwrites and large scans efficiently. Previous work on WOI-based file systems has shown promise but has also been hampered by several open problems, which this paper addresses. For example, FUSE issues many queries into the file system, superimposing read-intensive workloads on top of write-intensive ones, thereby reducing the effectiveness of WOIs. Moving to an in-kernel implementation can address this problem by providing finer control of reads. this paper also contributes several implementation techniques to leverage kernel infrastructure without throttling write performance. Our results show that BetrFS provides good performance for both arbitrary microdata operations, which include creating small files, updating metadata, and small writes into large or small files, and for large sequential I/O. On one microdata benchmark, BetrFS provides more than 4× the performance of ext4 or XFS. BetrFS is an ongoing prototype effort, and requires additional data-structure tuning to match current general-purpose file systems on some operations such as deletes, directory renames, and large sequential writes. Nonetheless, many applications realize significant performance improvements. For instance, an in-place rsync of the Linux kernel source realizes roughly 1.6–22× speedup over other commodity file systems.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Optimal resource provisioning approach based on cost modeling for spark applications in public clouds 15

Optimal resource provisioning approach based on cost modelin...

引用

12th Middleware Doctoral Symposium, Middleware Doctoral Symposium 2015

作者： Ruan, Jianfei Zheng, Qinghua Dong, Bo MOE KLINNS Lab Dept. of Computer Science and Technology Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9781450337281

Efficient resource provisioning is required when running S- park applications in public clouds. However, how to op- timize resource provisioning to minimize the time and/or monetary cost for a specific application remains an intractable problem since resource provisioning may differ from appli- cation to application and even be affected by the amount of input data. Existing resource settings heavily rely on random selection or previous deployer experience, frequent- ly leading to low-quality resource provisioning. therefore, there is an urgent need to propose an approach towards op- timal resource provisioning for Spark applications in public clouds. this is a PhD proposal, where an approach based on time and monetary cost modeling is presented for cloud resource provisioning optimization under two typical con- strained scenarios. the approach systematically drives re- source provisioning for a specific Spark application, which may save a significant amount of time and money, compared to randomly selected settings. © 2015 ACM.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Reducing journaling overhead with hybrid buffer cache 15th

Reducing journaling overhead with hybrid buffer cache

引用

15th International conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Zhang, Zhiyong Ju, Lei Jia, Zhiping School of Computer Science and Technology Shandong University Jinan250101 China

ISBN: (纸本)9783319271392

Journaling technique is widely used in modern file systems for high reliability and fast recovery from system failures. However, journaling mechanism accounts for extra journal traffic flushed from the buffer cache to storage, greatly impeding the performance of file systems. Emerging non-volatile memory (NVM) technologies bring a new perspective of resolving this issue. But replacing DRAM with NVM as the whole buffer cache encounters the challenge of limited lifetime of NVM. As such, in this paper, we exploit a hybrid NVM-DRAM buffer cache architecture to optimize the journaling overhead using the nonvolatility of NVM and the unlimited write endurance of DRAM. We propose a novel page management policy to direct page placement and migration while ensuring DRAM absorb most writes. Besides, a writeburst predictor is presented to further reduce write activities on NVM to prolong the lifespan of the hybrid buffer cache. Furthermore, we present a hybrid-commit journaling scheme to support the in-place commit of NVM and the in-memory commit of DRAM. We implement the proposed techniques on Linux 2.6.38 and measure the performance with various file I/O benchmarks. the experimental results show that our scheme significantly improves the I/O performance compared with the existing Linux buffer cache with ext4 and prolongs the lifetime compared with the NVM based buffer cache. © Springer International Publishing Switzerland 2015.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

F2FS: a new file system for flash storage 15

F2FS: a new file system for flash storage

引用

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

作者： Changman Lee Dongho Sim Joo-Young Hwang Sangyeun Cho 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 *** 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).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Failure-atomic updates of application data in a linux file system 15

Failure-atomic updates of application data in a linux file s...

引用

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

作者： Rajat Verma Anton Ajay Mendez Stan Park Sandya Mannarswamy Terence Kelly Charles B. Morrey Hewlett-Packard Storage Division Hewlett-Packard Laboratories

ISBN: (纸本)9781931971201

We present the design, implementation, and evaluation of a file system mechanism that protects the integrity of application data from failures such as process crashes, kernel panics, and power outages. A simple interface offers applications a guarantee that the application data in a file always reflects the most recent successful fsync or msync operation on the file. Our file system furthermore offers a new syncv mechanism that failure-atomically commits changes to multiple files. Failure-injection tests verify that our file system protects the integrity of application data from crashes and performance measurements confirm that our implementation is efficient. Our file system runs on conventional hardware and unmodified Linux kernels and will be released commercially. We believe that our mechanism is implementable in any file system that supports per-file writable snapshots.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：