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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

DFS: A file system for virtualized flash storage 8

DFS: A file system for virtualized flash storage

引用

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

作者： Josephson, William K. Bongo, Lars A. Li, Kai Flynn, David

ISBN: (纸本)9781931971744

this paper presents the design, implementation and evaluation of Direct file System (DFS) for virtualized flash storage. Instead of using traditional layers of abstraction, our layers of abstraction are designed for directly accessing flash memory devices. DFS has two main novel features. First, it lays out its files directly in a very large virtual storage address space provided by FusionIO's virtual flash storage layer. Second, it leverages the virtual flash storage layer to perform block allocations and atomic updates. As a result, DFS performs better and it is much simpler than a traditional Unix file system with similar functionalities. Our microbenchmark results show that DFS can deliver 94,000 I/O operations per second (IOPS) for direct reads and 71,000 IOPS for direct writes with the virtualized flash storage layer on FusionIO's ioDrive. For direct access performance, DFS is consistently better than ext3 on the same platform, sometimes by 20%. For buffered access performance, DFS is also consistently better than ext3, and sometimes by over 149%. Our application benchmarks show that DFS outperforms ext3 by 7% to 250% while requiring less CPU power.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Building workload-independent storage with VT-Trees 11

Building workload-independent storage with VT-Trees

引用

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

作者： Shetty, Pradeep Spillane, Richard Malpani, Ravikant Andrews, Binesh Seyster, Justin Zadok, Erez Stony Brook University

As the Internet and the amount of data grows, the variability of data sizes grows too-from small MP3 tags to large VM images. With applications using increasingly more complex queries and larger data-sets, data access patterns have become more complex and randomized. Current storage systems focus on optimizing for one band of workloads at the expense of other workloads due to limitations in existing storage system data structures. We designed a novel workload-independent data structure called the VT-tree which extends the LSM-tree to efficiently handle sequential and file-system workloads. We designed a system based solely on VT-trees which offers concurrent access to data via file system and database APIs, transactional guarantees, and consequently provides efficient and scalable access to both large and small data items regardless of the access pattern. Our evaluation shows that our user-level system has 2-6.6× better performance for random-write workloads and only a small average overhead for other workloads. © 2016 Australian Society of Sugar Cane Technologists. All rights reserved.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Wort: Write optimal radix tree for persistent memory storage systems 15

Wort: Write optimal radix tree for persistent memory storage...

引用

15th usenix conference on file and storage technologies, FAST 2017

作者： Lee, Se Kwon Hyun Lim, K. Song, Hyunsub Nam, Beomseok Noh, Sam H. Korea Republic of Hongik University Korea Republic of

ISBN: (纸本)9781931971362

Recent interest in persistent memory (PM) has stirred development of index structures that are efficient in PM. Recent such developments have all focused on variations of the B-tree. In this paper, we show that the radix tree, which is another less popular indexing structure, can be more appropriate as an efficient PM indexing structure. this is because the radix tree structure is determined by the prefix of the inserted keys and also does not require tree rebalancing operations and node granularity updates. However, the radix tree as-is cannot be used in PM. As another contribution, we present three radix tree variants, namely, WORT (Write Optimal Radix Tree), WOART (Write Optimal Adaptive Radix Tree), and ART+CoW. Of these, the first two are optimal for PM in the sense that they only use one 8-byte failure-atomic write per update to guarantee the consistency of the structure and do not require any duplicate copies for logging or CoW. Extensive performance studies show that our proposed radix tree variants perform considerable better than recently proposed B-tree variants for PM such NVTree, wB+Tree, and FPTree for synthetic workloads as well as in implementations within Memcached. © proceedings of the 15th usenix conference on file and storage technologies, FAST 2017. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Panache: A parallel file system cache for global file access 8

Panache: A parallel file system cache for global file access

引用

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

作者： Eshel, Marc Haskin, Roger Hildebrand, Dean Naik, Manoj Schmuck, Frank Tewari, Renu IBM Almaden Research

ISBN: (纸本)9781931971744

Cloud computing promises large-scale and seamless access to vast quantities of data across the globe. Applications will demand the reliability, consistency, and performance of a traditional cluster file system regardless of the physical distance between data centers. Panache is a scalable, high-performance, clustered file system cache for parallel data-intensive applications that require wide area file access. Panache is the first file system cache to exploit parallelism in every aspect of its design—parallel applications can access and update the cache from multiple nodes while data and metadata is pulled into and pushed out of the cache in parallel. Data is cached and updated using pNFS, which performs parallel I/O between clients and servers, eliminating the single-server bottleneck of vanilla client-server file access protocols. Furthermore, Panache shields applications from fluctuating WAN latencies and outages and is easy to deploy as it relies on open standards for high-performance file serving and does not require any proprietary hardware or software to be installed at the remote cluster. In this paper, we present the overall design and implementation of Panache and evaluate its key features with multiple workloads across local and wide area networks.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

DEPART: Replica Decoupling for Distributed Key-Value storage 20

DEPART: Replica Decoupling for Distributed Key-Value Storage

引用

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

作者： Zhang, Qiang Li, Yongkun Lee, Patrick P. C. Xu, Yinlong Wu, Si Univ Sci & Technol China Hefei Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China USTC Anhui Prov Key Lab High Performance Comp Hefei Peoples R China

ISBN: (纸本)9781939133267

Modern distributed key-value (KV) stores adopt replication for fault tolerance by distributing replicas of KV pairs across nodes. However, existing distributed KV stores often manage all replicas in the same index structure, thereby leading to significant I/O costs beyond the replication redundancy. We propose a notion called replica decoupling, which decouples the storage management of the primary and redundant copies of replicas, so as to not only mitigate the I/O costs in indexing, but also provide tunable performance. In particular, we design a novel two-layer log that enables tunable ordering for the redundant copies to achieve balanced read/write performance. We implement a distributed KV store prototype, DEPART, atop Cassandra. Experiments show that DEPART outperforms Cassandra in all performance aspects under various consistency levels and parameter settings. Specifically, under the eventual consistency setting, DEPART achieves up to 1.43 x, 2.43 x, 2.68 x, and 1.44 x throughput for writes, reads, scans, and updates, respectively.

关键词： storage management

来源：评论

学校读者我要写书评

暂无评论

Evaluating performance and energy in file system server workloads 8

Evaluating performance and energy in file system server work...

引用

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

作者： Sehgal, Priya Tarasov, Vasily Zadok, Erez Stony Brook University United States

ISBN: (纸本)9781931971744

Recently, power has emerged as a critical factor in designing components of storage systems, especially for power-hungry data centers. While there is some research into power-aware storage stack components, there are no systematic studies evaluating each component's impact separately. this paper evaluates the file system's impact on energy consumption and performance. We studied several popular Linux file systems, with various mount and format options, using the fileBench workload generator to emulate four server workloads: Web, database, mail, and file server. In case of a server node consisting of a single disk, CPU power generally exceeds disk-power consumption. However, file system design, implementation, and available features have a significant effect on CPU/disk utilization, and hence on performance and power. We discovered that default file system options are often suboptimal, and even poor. We show that a careful matching of expected workloads to file system types and options can improve power-performance efficiency by a factor ranging from 1.05 to 9.4 times.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Hybrid data reliability for emerging key-value storage devices 18

Hybrid data reliability for emerging key-value storage devic...

引用

18th usenix conference on file and storage technologies, FAST 2020

作者： Pitchumani, Rekha Kee, Yang-Suk Memory Solutions Lab Samsung Semiconductor Inc.

ISBN: (纸本)9781939133120

Rapid growth in data storage technologies created the modern data-driven world. Modern workloads and application have influenced the evolution of storage devices from simple block devices to more intelligent object devices. Emerging, nextgeneration Key-Value (KV) storage devices allow storage and retrieval of variable-length user data directly onto the devices and can be addressed by user-desired variable-length keys. Traditional reliability schemes for multiple block storage devices, such as Redundant Array of Independent Disks (RAID), have been around for a long time and used by most systems with multiple devices. Now, the question arises as to what an equivalent for such emerging object devices would look like, and how it would compare against the traditional mechanism. In this paper, we present Key-Value Multi-Device (KVMD), a hybrid data reliability manager that employs a variety of reliability techniques with different trade-offs, for key-value devices. We present three reliability techniques suitable for variable length values, and evaluate the hybrid data reliability mechanism employing these techniques using KV SSDs from Samsung. Our evaluation shows that, compared to Linux mdadm-based RAID throughput degradation for block devices, data reliability for KV devices can be achieved at a comparable or lower throughput degradation. In addition, the KV API enables much quicker rebuild and recovery of failed devices, and also allows for both hybrid reliability configuration set automatically based on, say, value sizes, and custom per-object reliability configuration for user data. Copyright © Proc. of the 18th usenix conference on file and storage Tech., FAST 2020. All rights reserved.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

ScalaRAID: Optimizing Linux Software RAID System for Next-Generation storage 22

ScalaRAID: Optimizing Linux Software RAID System for Next-Ge...

引用

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

作者： Yi, Shushu Yang, Yanning Tang, Yunxiao Zhou, Zixuan Li, Junzhe Yue, Chen Jung, Myoungsoo Zhang, Jie Peking Univ Comp Hardware & Syst Evolut Lab Beijing Peoples R China Nanjing Univ Comp Hardware & Syst Evolut Lab Nanjing Peoples R China Beijing Univ Posts & Telecommun Comp Hardware & Syst Evolut Lab Beijing Peoples R China Korea Adv Inst Sci & Technol Comp Hardware & Syst Evolut Lab Daejeon South Korea

ISBN: (纸本)9781450393997

RAID has been widely adopted to enhance the performance, capacity, and reliability of the existing storage systems. However, we observe that the Linux software RAID (mdraid) suffers from its poor implementation of the lock mechanism. To address this, we propose ScalaRAID, which refines the role domain of locks and designs a new data structure to prevent different threads from preempting the RAID resources. By doing so, ScalaRAID can maximize the thread-level parallelism and reduce the time consumption of I/O request handling. Our evaluation results reveal that ScalaRAID can improve throughput by 89.4% while decreasing 99.99(th) percentile latency by 85.4% compared to mdraid.

关键词： Solid State Drive RAID Operating System Lock

来源：评论

学校读者我要写书评

暂无评论

Closing the B⁺-tree vs. LSM-tree Write Amplification Gap on Modern storage Hardware with Built-in Transparent Compression 20

Closing the B<SUP>+</SUP>-tree vs. LSM-tree Write Amplificat...

引用

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

作者： Qiao, Yifan Chen, Xubin Zheng, Ning Li, Jiangpeng Liu, Yang Zhang, Tong Rensselaer Polytech Inst Troy NY 12180 USA Google Inc Kirkland WA USA ScaleFlux Inc Milpitas CA USA

ISBN: (纸本)9781939133267

this paper studies how B+-tree could take full advantage of modern storage hardware with built-in transparent compression. Recent years witnessed significant interest in applying log-structured merge tree (LSM-tree) as an alternative to B+-tree, driven by the widely accepted belief that LSM-tree has distinct advantages in terms of storage cost and write amplification. this paper aims to revisit this belief upon the arrival of storage hardware with built-in transparent compression. Advanced storage appliances and emerging computational storage drives perform hardware-based lossless data compression, transparent to OS and user applications. Beyond straight-forwardly reducing the storage cost gap between B+-tree and LSM-tree, such storage hardware creates new opportunities to re-think the implementation of B+-tree. this paper presents three simple design techniques that can leverage such modem storage hardware to significantly reduce the B+-tree write amplification. Experiments on a commercial storage drive with built-in transparent compression show that the proposed design techniques can reduce the B+-tree write amplification by over 10x. Compared with RocksDB (a key-value store built upon LSM-tree), the enhanced B+-tree implementation can achieve similar or even smaller write amplification.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Measurement and analysis of TCP throughput collapse in cluster-based storage systems 6

Measurement and analysis of TCP throughput collapse in clust...

引用

6th usenix conference on file and storage technologies

作者： Phanishayee, Arnar Krevat, Elie Vasudevan, Vijay Andersen, David G. Ganger, Gregory R. Gibson, Garth A. Seshan, Srinivasan Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781931971560

Cluster-based and iSCSI-based storage systems rely on standard TCP/IP-over-Ethernet for client access to data. Unfortunately, when data is striped over multiple networked storage nodes, a client can experience a TCP throughput collapse that results in much lower read bandwidth than should be provided by the available network links. Conceptually, this problem arises because the client simultaneously reads fragments of a data block from multiple sources that together send enough data to overload the switch buffers on the client's link. this paper analyzes this Incast problem, explores its sensitivity to various system parameters, and examines the effectiveness of alternative TCP- and Ethernet-level strategies in mitigating the TCP throughput collapse.

关键词： Ethernet

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：