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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是291-300 订阅

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

详细简洁

排序：

Memory efficient sanitization of a deduplicated storage system 13

Memory efficient sanitization of a deduplicated storage syst...

引用

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

作者： Fabiano C. Botelho Philip Shilane Nitin Garg Windsor Hsu Backup Recovery Systems Division EMC Corporation

Sanitization is the process of securely erasing sensitive data from a storage system, effectively restoring the system to a state as if the sensitive data had never been stored. Depending on the threat model, sanitization could require erasing all unreferenced blocks. this is particularly challenging in deduplicated storage systems because each piece of data on the physical media could be referred to by multiple namespace objects. For large storage systems, where available memory is a small fraction of storage capacity, standard techniques for tracking data references will not fit in memory, and we discuss multiple sanitization techniques that trade-off I/O and memory requirements. We have three key contributions. First, we provide an understanding of the threat model and what is required to sanitize a deduplicated storage system as compared to a device. Second, we have designed a memory efficient algorithm using perfect hashing that only requires from 2.54 to 2.87 bits per reference (98% savings) while minimizing the amount of I/O. third, we present a complete sanitization design for EMC Data Domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Warming up storage-level caches with bonfire 13

Warming up storage-level caches with bonfire

引用

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

作者： Yiying Zhang Gokul Soundararajan Mark W. Storer Lakshmi N. Bairavasundaram Sethuraman Subbiah Andrea C. Arpaci-Dusseau Remzi H. Arpaci-Dusseau University of Wisconsin-Madison NetApp Inc.

Large caches in storage servers have become essential for meeting service levels required by applications. these caches need to be warmed with data often today due to various scenarios including dynamic creation of cache space and server restarts that clear cache contents. When large storage caches are warmed at the rate of application I/O, warmup can take hours or even days, thus affecting both application performance and server load over a long period of *** have created Bonfire, a mechanism for accelerating cache warmup. Bonfire monitors storage server workloads, logs important warmup data, and efficiently preloads storage-level caches with warmup data. Bonfire is based on our detailed analysis of block-level data-center traces that provides insights into heuristics for warmup as well as the potential for efficient mechanisms. We show through both simulation and trace replay that Bonfire reduces both warmup time and backend server load significantly, compared to a cache that is warmed up on demand.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Extending the lifetime of flash-based storage through reducing write amplification from file systems 13

Extending the lifetime of flash-based storage through reduci...

引用

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

作者： Youyou Lu Jiwu Shu Weimin Zheng Department of Computer Science and Technology Tsinghua University and Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Tsinghua National Laboratory for Information Science and Technology

Flash memory has gained in popularity as storage devices for both enterprise and embedded systems because of its high performance, low energy and reduced cost. the endurance problem of flash memory, however, is still a challenge and is getting worse as storage density increases with the adoption of multi-level cells (MLC). Prior work has addressed wear leveling and data reduction, but there is significantly less work on using the file system to improve flash lifetimes. Some common mechanisms in traditional file systems, such as journaling, metadata synchronization, and page-aligned update, can induce extra write operations and aggravate the wear of flash memory. this problem is called write amplification from file *** order to mitigate write amplification, we propose an object-based flash translation layer design (OFTL), in which mechanisms are co-designed with flash memory. By leveraging page metadata, OFTL enables lazy persistence of index metadata and eliminates journals while keeping consistency. Coarse-grained block state maintenance reduces persistent free space management overhead. With byte-unit access interfaces, OFTL is able to compact and co-locate the small updates with metadata to further reduce updates. Experiments show that an OFTL-based system, OFSS, offers a write amplification reduction of 47.4%-89.4% in SYNC mode and 19.8%-64.0% in ASYNC mode compared with ext3, ext2, and btrfs on an up-to-date page-level FTL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving restore speed for backup systems that use inline chunk-based deduplication 13

Improving restore speed for backup systems that use inline c...

引用

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

作者： Mark Lillibridge Kave Eshghi Deepavali Bhagwat HP Labs HP Storage

Slow restoration due to chunk fragmentation is a serious problem facing inline chunk-based data deduplication systems: restore speeds for the most recent backup can drop orders of magnitude over the lifetime of a system. We study three techniques--increasing cache size, container capping, and using a forward assembly area-- for alleviating this problem. Container capping is an ingest-time operation that reduces chunk fragmentation at the cost of forfeiting some deduplication, while using a forward assembly area is a new restore-time caching and prefetching technique that exploits the perfect knowledge of future chunk accesses available when restoring a backup to reduce the amount of RAM required for a given level of caching at restore *** show that using a larger cache per stream--we see continuing benefits even up to 8 GB--can produce up to a 5-16X improvement, that giving up as little as 8% deduplication with capping can yield a 2-6X improvement, and that using a forward assembly area is strictly superior to LRU, able to yield a 2-4X improvement while holding the RAM budget constant.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gecko: contention-oblivious disk arrays for cloud storage 13

Gecko: contention-oblivious disk arrays for cloud storage

引用

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

作者： Ji-Yong Shin Mahesh Balakrishnan Tudor Marian Hakim Weatherspoon Cornell University Microsoft Research Google

Disk contention is increasingly a significant problem for cloud storage, as applications are forced to co-exist on machines and share physical disk resources. Disks are notoriously sensitive to contention; a single application's random I/O is sufficient to reduce the throughput of a disk array by an order of magnitude, disrupting every other application running on the same array. Log-structured storage designs can alleviate write-write contention between applications by sequentializing all writes, but have historically suffered from read-write contention triggered by garbage collection (GC) as well as application reads. Gecko is a novel log-structured design that eliminates read-write contention by chaining together a small number of drives into a single log, effectively separating the tail of the log (where writes are appended) from its body. As a result, writes proceed to the tail drive without contention from either GC reads or first-class reads, which are restricted to the body of the log with the help of a tail-specific caching policy. Gecko trades-off maximum contention-free sequential throughput from multiple drives in exchange for a stable and predictable maximum throughput from a single uncontended drive, and achieves better performance compared to native log-structured or RAID based systems for most cases. Our in-kernel implementation provides random write bandwidth to applications of 60 to 120MB/s, despite concurrent GC activity, application reads, and an adversarial workload.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Concurrent deletion in a distributed content-addressable storage system with global deduplication 13

Concurrent deletion in a distributed content-addressable sto...

引用

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

作者： Przemyslaw Strzelczak Elzbieta Adamczyk Urszula Herman-Izycka Jakub Sakowicz Lukasz Slusarczyk Jaroslaw Wrona Cezary Dubnicki LLC

Scalable, highly reliable distributed systems supporting data deduplication have recently become popular for storing backup and archival data. One of the important requirements for backup storage is the ability to delete data selectively. Unlike in traditional storage systems, data deletion in distributed systems with deduplication is a major challenge because deduplication leads to multiple owners of data chunks. Moreover, system configuration changes often due to node additions, deletions and failures. Expected high performance, high availability and low impact of deletion on regular user operations additionally complicate identification and reclamation of unnecessary *** paper describes a deletion algorithm for a scalable, content-addressable storage with global deduplication. the deletion is concurrent: user reads and writes can proceed in parallel with deletion with only minor restrictions established to make reclamation feasible. Moreover, our approach allows for deduplication of user writes during deletion. We extend traditional distributed reference counting to deliver a failure-tolerant deletion that accommodates not only deduplication, but also the dynamic nature of a scalable system and its physical resource constraints. the proposed algorithm has been verified with an implementation in a commercial deduplicating storage system. the impact of deletion on user operations is configurable. Using a default setting that grants deletion maximum 30% of system resources running the deletion reduces end performance by not more that 30%. this impact can be reduced to less than 5% when deletion is given only minimal resources.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Horus: fine-grained encryption-based security for large-scale storage 13

Horus: fine-grained encryption-based security for large-scal...

引用

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

作者： Yan Li Nakul Sanjay Dhotre Yasuhiro Ohara thomas M. Kroeger Ethan L. Miller Darrell D. E. Long Storage Systems Research Center University of California Santa Cruz CA Sandia National Laboratories Livermore CA

With the growing use of large-scale distributed systems, the likelihood that at least one node is compromised is increasing. Large-scale systems that process sensitive data such as geographic data with defense implications, drug modeling, nuclear explosion modeling, and private genomic data would benefit greatly from strong security for their storage. Nevertheless, many high performance computing (HPC), cloud, or secure content delivery network (SCDN) systems that handle such data still store them unencrypted or use simple encryption schemes, relying heavily on physical isolation to ensure confidentiality, providing little protection against compromised computers or malicious insiders. Moreover, current encryption solutions cannot efficiently provide fine-grained encryption for large *** approach, Horus, encrypts large datasets using keyed hash trees (KHTs) to generate different keys for each region of the dataset, providing fine-grained security: the key for one region cannot be used to access another region. Horus also reduces key management and distribution overhead while providing end-to-end data encryption and reducing the need to trust system operators or cloud service providers. Horus requires little modification to existing systems and user applications. Performance evaluation shows that our prototype's key distribution is highly scalable and robust: a single key server can provide 140,000 keys per second, theoretically enough to sustain more than 100 GB/s I/O throughput, and multiple key servers can efficiently operate in parallel to support load balancing and reliability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings of FAST 2011: 9th usenix conference on file and storage technologies

Proceedings of FAST 2011: 9th USENIX Conference on File and ...

引用

9th usenix conference on file and storage technologies, FAST 2011

ISBN: (纸本)9781931971829

the proceedings contain 20 papers. the topics discussed include: a study of practical deduplication;tradeoffs in scalable data routing for deduplication clusters;capo: recapitulating storage for virtual desktops;consistent and durable data structures for non-volatile byte-addressable memory;CAFTL: a content-aware flash translation layer enhancing the lifespan of flash memory based solid state drives;leveraging value locality in optimizing NAND flash-based SSDs;reliably erasing data from flash-based solid state drives;a scheduling framework that makes any disk schedulers non-work-conserving solely based on request characteristics;and the SCADS director: scaling a distributed storage system under stringent performance requirements.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adding advanced storage controller functionality via low-overhead virtualization 10

Adding advanced storage controller functionality via low-ove...

引用

10th usenix conference on file and storage technologies, FAST 2012

作者： Ben-Yehuda, Muli Factor, Michael Rom, Eran Traeger, Avishay Borovik, Eran Yassour, Ben-Ami IBM Research-Haifa Israel

ISBN: (纸本)9781931971911

Historically, storage controllers have been extended by integrating new code, e.g., file serving, database processing, deduplication, etc., into an existing base. this integration leads to complexity, co-dependency and instability of both the original and new functions. Hypervisors are a known mechanism to isolate different functions. However, to enable extending a storage controller by providing new functions in a virtual machine (VM), the virtualization overhead must be negligible, which is not the case in a straightforward implementation. this paper demonstrates a set of mechanisms and techniques that achieve near zero runtime performance overhead for using virtualization in the context of a storage system. © 2012 by the usenix Association. All Rights Reserved.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Bluesky: A cloud-backed file system for the enterprise 10

Bluesky: A cloud-backed file system for the enterprise

引用

10th usenix conference on file and storage technologies, FAST 2012

作者： Vrable, Michael Savage, Stefan Voelker, Geoffrey M. Department of Computer Science and Engineering University of California San Diego United States UC San Diego United States

ISBN: (纸本)9781931971911

We present BlueSky, a network file system backed by cloud storage. BlueSky stores data persistently in a cloud storage provider such as Amazon S3 or Windows Azure, allowing users to take advantage of the reliability and large storage capacity of cloud providers and avoid the need for dedicated server hardware. Clients access the storage through a proxy running on-site, which caches data to provide lower-latency responses and additional opportunities for optimization. We describe some of the optimizations which are necessary to achieve good performance and low cost, including a log-structured design and a secure in-cloud log cleaner. BlueSky supports multiple protocols—both NFS and CIFS—and is portable to different providers. © 2012 by the usenix Association. All Rights Reserved.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：