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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Message from the 12th usenix conference on file and storage technologies program co-chairs

Proceedings of the 12th USENIX Conference on File and Storag...

引用

proceedings of the 12th usenix conference on file and storage technologies, FAST 2014 2014年 VI页

作者： Schroeder, Bianca thereska, Eno University of Toronto Canada Microsoft Research

来源：评论

学校读者我要写书评

暂无评论

Optimizing every operation in a write-optimized file system 16

Optimizing every operation in a write-optimized file system

引用

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

作者： Jun Yuan Yang Zhan William Jannen Prashant Pandey Amogh Akshintala Kanchan Chandnani Pooja Deo Zardosht Kasheff Leif Walsh Michael A. Bender Martin Farach-Colton Rob Johnson Bradley C. Kuszmaul Donald E. Porter Stony Brook University Facebook Two Sigma Rutgers University Massachusetts Institute of Technology

ISBN: (纸本)9781931971287

file systems that employ write-optimized dictionaries (WODs) can perform random-writes, metadata updates, and recursive directory traversals orders of magnitude faster than conventional file systems. However, previous WOD-based file systems have not obtained all of these performance gains without sacrificing performance on other operations, such as file deletion, file or directory renaming, or sequential *** three techniques, late-binding journaling, zoning, and range deletion, we show that there is no fundamental trade-off in write-optimization. these dramatic improvements can be retained while matching conventional file systems on all other *** 0.2 delivers order-of-magnitude better performance than conventional file systems on directory scans and small random writes and matches the performance of conventional file systems on rename, delete, and sequential I/O. For example, BetrFS 0.2 performs directory scans 2.2× faster, and small random writes over two orders of magnitude faster, than the fastest conventional file system. But unlike BetrFS 0.1, it renames and deletes files commensurate with conventional file systems and performs large sequential I/O at nearly disk bandwidth. the performance benefits of these techniques extend to applications as well. BetrFS 0.2 continues to outperform conventional file systems on many applications, such as as rsync, git-diff, and tar, but improves git-clone performance by 35% over BetrFS 0.1, yielding performance comparable to other file systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of the ECMWF storage landscape 13

Analysis of the ECMWF storage landscape

引用

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

作者： Grawinkel, Matthias Nagel, Lars Mäsker, Markus Padua, Federico Brinkmann, André Sorth, Lennart Johannes Gutenberg University Mainz Germany ECMWF

ISBN: (纸本)9781931971201

Despite domain-specific digital archives are growing in number and size, there is a lack of studies describing their architectures and runtime characteristics. this paper investigates the storage landscape of the European Centre for Medium-Range Weather Forecasts (ECMWF) whose storage capacity has reached 100 PB and experiences an annual growth rate of about 45%. Out of this storage, we examine a 14.8 PB user archive and a 37.9 PB object database for metereological data over a period of 29 and 50 months, respectively. We analzye the system’s log files to characterize traffic and user behavior, metadata snapshots to identify the current content of the storage systems, and logs of tape libraries to investigate cartridge movements. We have built a caching simulator to examine the efficiency of disk caches for various cache sizes and algorithms, and we investigate the potential of tape prefetching strategies. While the findings of the user archive resemble previous studies on digital archives, our study of the object database is the first one in the field of large-scale active archives.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Uncovering bugs in distributed storage systems during testing (not in production!) 16

Uncovering bugs in distributed storage systems during testin...

引用

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

作者： Pantazis Deligiannis Matt McCutchen Paul thomson Shuo Chen Alastair F. Donaldson John Erickson Cheng Huang Akash Lal Rashmi Mudduluru Shaz Qadeer Wolfram Schulte Imperial College London Massachusetts Institute of Technology Microsoft

ISBN: (纸本)9781931971287

Testing distributed systems is challenging due to multiple sources of nondeterminism. Conventional testing techniques, such as unit, integration and stress testing, are ineffective in preventing serious but subtle bugs from reaching production. Formal techniques, such as TLA+, can only verify high-level specifications of systems at the level of logic-based models, and fall short of checking the actual executable code. In this paper, we present a new methodology for testing distributed systems. Our approach applies advanced systematic testing techniques to thoroughly check that the executable code adheres to its high-level specifications, which significantly improves coverage of important system *** methodology has been applied to three distributed storage systems in the Microsoft Azure cloud computing platform. In the process, numerous bugs were identified, reproduced, confirmed and fixed. these bugs required a subtle combination of concurrency and failures, making them extremely difficult to find with conventional testing techniques. An important advantage of our approach is that a bug is uncovered in a small setting and witnessed by a full system trace, which dramatically increases the productivity of debugging.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Calvinfs: Consistent WAN replication and scalable metadata management for distributed file systems 13

Calvinfs: Consistent WAN replication and scalable metadata m...

引用

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

作者： thomson, Alexander Abadi, Daniel J. Google Yale University United States

ISBN: (纸本)9781931971201

Existing file systems, even the most scalable systems that store hundreds of petabytes (or more) of data across thousands of machines, store file metadata on a single server or via a shared-disk architecture in order to ensure consistency and validity of the metadata. this paper describes a completely different approach for the design of replicated, scalable file systems, which leverages a high-throughput distributed database system for metadata management. this results in improved scalability of the metadata layer of the file system, as file metadata can be partitioned (and replicated) across a (shared-nothing) cluster of independent servers, and operations on file metadata transformed into distributed transactions. In addition, our file system is able to support standard file system semantics—including fully linearizable random writes by concurrent users to arbitrary byte offsets within the same file—across wide geographic areas. Such high performance, fully consistent, geographically distributed files systems do not exist today. We demonstrate that our approach to file system design can scale to billions of files and handle hundreds of thousands of updates and millions of reads per second—while maintaining consistently low read latencies. Furthermore, such a deployment can survive entire datacenter outages with only small performance hiccups and no loss of availability.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Reliable, consistent, and efficient data sync for mobile apps 13

Reliable, consistent, and efficient data sync for mobile app...

引用

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

作者： Go, Younghwan Agrawal, Nitin Aranya, Akshat Ungureanu, Cristian NEC Labs America KAIST

ISBN: (纸本)9781931971201

Mobile apps need to manage data, often across devices, to provide users with a variety of features such as seamless access, collaboration, and offline editing. To do so reliably, an app must anticipate and handle a host of local and network failures while preserving data consistency. For mobile environments, frugal usage of cellular bandwidth and device battery are also essential. the above requirements place an enormous burden on the app developer. We built Simba, a data-sync service that provides mobile app developers with a high-level local-programming abstraction unifying tabular and object data – a need common to mobile apps – and transparently handles data storage and sync in a reliable, consistent, and efficient manner. In this paper we present a detailed description of Simba’s client software which acts as the gateway to the data sync infrastructure. Our evaluation shows Simba’s effectiveness in rapid development of robust mobile apps that are consistent under all failure scenarios, unlike apps developed with Dropbox. Simba-apps are also demonstrably frugal with cellular resources.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Boosting quasi-asynchronous I/O for better responsiveness in mobile devices 13

Boosting quasi-asynchronous I/O for better responsiveness in...

引用

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

作者： Jeong, Daeho Lee, Youngjae Kim, Jin-Soo Samsung Electronics Co. Suwon Korea Republic of Sungkyunkwan University Suwon Korea Republic of

ISBN: (纸本)9781931971201

Providing quick system response for mobile devices is of great importance due to their interactive nature. However, we observe that the latency of file system operations increases dramatically under heavy asynchronous I/Os in the background. A careful analysis reveals that most of the delay arises from an unexpected situation where the file system operations are blocked until one or more asynchronous I/O operations are completed. We call such an I/O – which is issued as an asynchronous I/O but has the property of a synchronous I/O as some tasks are blocked on it – Quasi-Asynchronous I/O (QASIO). We classify the types of dependencies between tasks and QASIOs and then show when such dependencies occur in the Linux kernel. Also, we propose a novel scheme to detect QASIOs at run time and boost them over the other asynchronous I/Os in the I/O scheduler. Our measurement results on the latest smartphone demonstrate that the proposed scheme effectively improves the responsiveness of file system operations.

关键词： file organization

来源：评论

学校读者我要写书评

暂无评论

Having your cake and eating it too: Jointly Optimal Erasure Codes for I/O, storage and Network-bandwidth 13

Having your cake and eating it too: Jointly Optimal Erasure ...

引用

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

作者： Rashmi, K.V. Nakkiran, Preetum Wang, Jingyan Shah, Nihar B. Ramchandran, Kannan University of California Berkeley United States

ISBN: (纸本)9781931971201

Erasure codes, such as Reed-Solomon (RS) codes, are increasingly being deployed as an alternative to data-replication for fault tolerance in distributed storage systems. While RS codes provide significant savings in storage space, they can impose a huge burden on the I/O and network resources when reconstructing failed or otherwise unavailable data. A recent class of erasure codes, called minimum-storage-regeneration (MSR) codes, has emerged as a superior alternative to the popular RS codes, in that it minimizes network transfers during reconstruction while also being optimal with respect to storage and reliability. However, existing practical MSR codes do not address the increasingly important problem of I/O overhead incurred during reconstructions, and are, in general, inferior to RS codes in this regard. In this paper, we design erasure codes that are simultaneously optimal in terms of I/O, storage, and network bandwidth. Our design builds on top of a class of powerful practical codes, called the product-matrix-MSR codes. Evaluations show that our proposed design results in a significant reduction the number of I/Os consumed during reconstructions (a 5× reduction for typical parameters), while retaining optimality with respect to storage, reliability, and network bandwidth.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

Host-side filesystem journaling for durable shared storage 13

Host-side filesystem journaling for durable shared storage

引用

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

作者： Hatzieleftheriou, Andromachi Anastasiadis, Stergios V. Department of Computer Science and Engineering University of Ioannina Ioannina45110 Greece

ISBN: (纸本)9781931971201

Hardware consolidation in the datacenter occasionally leads to scalability bottlenecks due to the heavy utilization of critical resources, such as the shared network bandwidth. Host-side caching on durable media is already applied at the block level in order to reduce the load of the storage backend. However, block-level caching is often criticized for added overhead, and restricted data sharing across different hosts. During client crashes, writeback caching can also lead to unrecoverable loss of written data that was previously acknowledged as stable. We improve the durability of shared storage in the datacenter by supporting journaling at the kernel-level client of an object-based distributed filesystem. storage virtualization at the file interface achieves clear consistency semantics across data and metadata blocks, supports native file sharing between clients over the same or different hosts, and provides flexible configuration of the time period during which the data is durably staged at the host side. Over a prototype implementation that we developed, we experimentally demonstrate improved performance up to 58% for specific durability guarantees, and reduced network and disk bandwidth at the storage servers by up to 42% and 82%, respectively.

关键词： Durability

来源：评论

学校读者我要写书评

暂无评论

Reducing file system tail latencies with chopper 13

Reducing file system tail latencies with chopper

引用

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

作者： He, Jun Nguyen, Duy Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Remzi H. Department of Computer Sciences University of Wisconsin–Madison United States Department of Statistics University of Wisconsin–Madison United States

ISBN: (纸本)9781931971201

We present Chopper, a tool that efficiently explores the vast input space of file system policies to find behaviors that lead to costly performance problems. We focus specifically on block allocation, as unexpected poor layouts can lead to high tail latencies. Our approach utilizes sophisticated statistical methodologies, based on Latin Hypercube Sampling (LHS) and sensitivity analysis, to explore the search space efficiently and diagnose intricate design problems. We apply Chopper to study the overall behavior of two file systems, and to study Linux ext4 in depth. We identify four internal design issues in the block allocator of ext4 which form a large tail in the distribution of layout quality. By removing the underlying problems in the code, we cut the size of the tail by an order of magnitude, producing consistent and satisfactory file layouts that reduce data access latencies.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：