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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

语言

428 篇 英文
7 篇 其他

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

共 435 条记录，以下是421-430 订阅

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

详细简洁

排序：

TBBT: scalable and accurate trace replay for file server evaluation 05

TBBT: scalable and accurate trace replay for file server eva...

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Ningning Zhu Jiawu Chen Tzi-Cker Chiueh Stony Brook University Stony Brook NY

this paper describes the design, implementation, and evaluation of TBBT, the first comprehensive NFS trace replay tool. Given an NFS trace, TBBT automatically detects and repairs missing operations in the trace, derives a file system image required to successfully replay the trace, ages the file system image appropriately, initializes the file server under test with that image, and finally drives the file server with a workload that is derived from replaying the trace according to user-specified parameters. TBBT can scale a trace temporally or spatially to meet the need of a simulation run without violating dependencies among file system operations in the trace.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WEAVER codes: highly fault tolerant erasure codes for storage systems 05

WEAVER codes: highly fault tolerant erasure codes for storag...

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： James Lee Hafner IBM Almaden Research Center

We present the WEAVER codes, new families of simple highly fault tolerant XOR-based erasure codes for storage systems (with fault tolerance up to 12). the design features of WEAVER codes are (a) placement of data and parity blocks on the same strip, (b) constrained parity in-degree and (c) balance and symmetry. these codes are in general not maximum distance separable (MDS) but have optimal storage efficiency among all codes with constrained parity in-degree. though applicable to RAID controller systems, the WEAVER codes are probably best suited in dRAID systems (distributed Redundant Arrangement of Independent Devices). We discuss the advantages these codes have over many other erasure codes for storage systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TOCTTOU vulnerabilities in UNIX-style file systems: an anatomical study 05

TOCTTOU vulnerabilities in UNIX-style file systems: an anato...

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Jinpeng Wei Calton Pu Georgia Institute of Technology

Due to their non-deterministic nature, Time of Check To Time of Use (TOCTTOU) vulnerabilities in Unix-style file systems (e.g., Linux) are difficult to find and prevent. We describe a comprehensive model of TOCTTOU vulnerabilities, enumerating 224 file system call pairs that may lead to successful TOCTTOU attacks. Based on this model, we built kernel monitoring tools that confirmed known vulnerabilities and discovered new ones (in often-used system utilities such as rpm, vi, and emacs). We evaluated the probability of successfully exploiting these newly discovered vulnerabilities and analyzed in detail the system events during such attacks. Our performance evaluation shows that the dynamic monitoring of system calls introduces non-negligible overhead in microbenchmark of those file system calls, but their impact on application benchmarks such as Andrew and PostMark is only a few percent.

关键词： race detection

来源：评论

学校读者我要写书评

暂无评论

Providing tunable consistency for a parallel file store 05

Providing tunable consistency for a parallel file store

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Murali Vilayannur Partho Nath Anand Sivasubramaniam Department of Computer Science and Engineering Pennsylvania State University

Consistency, throughput, and scalability form the backbone of a cluster-based parallel file system. With little or no information about the workloads to be supported, a file system designer has to often make a one-glove-fits-all decision regarding the consistency policies. Taking a hard stance on consistency demotes throughput and scalability to second-class status, having to make do with whatever leeway is available. Leaving the choice and granularity of consistency policies to the user at open/mount time provides an attractive way of providing the best of all worlds. We present the design and implementation of such a file-store, CAPFS (Content Addressable Parallel file System), that allows the user to define consistency semantic policies at runtime. A client-side plug-in architecture based on user-written plug-ins leaves the choice of consistency policies to the end-user. the parallelism exploited by use of multiple data stores provides for bandwidth and scalability. We provide extensive evaluations of our prototype file system on a concurrent read/write workload and a parallel tiled visualization code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A security model for full-text file system search in multi-user environments 05

A security model for full-text file system search in multi-u...

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Stefan Büttcher Charles L. A. Clarke School of Computer Science University of Waterloo Waterloo Ontario Canada

Most desktop search systems maintain per-user indices to keep track of file contents. In a multi-user environment, this is not a viable solution, because the same file has to be indexed many times, once for every user that may access the file, causing both space and performance problems. Having a single system-wide index for all users, on the other hand, allows for efficient indexing but requires special security mechanisms to guarantee that the search results do not violate any file *** present a security model for full-text file system search, based on the UNIX security model, and discuss two possible implementations of the model. We show that the first implementation, based on a postprocessing approach, allows an arbitrary user to obtain information about the content of files for which he does not have read permission. the second implementation does not share this problem. We give an experimental performance evaluation for both implementations and point out query optimization opportunities for the second one.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A logic of file systems 05

A logic of file systems

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Muthian Sivathanu Andrea C. Arpaci-Dusseau Remzi H. Arpaci-Dusseau Somesh Jha Google Inc. Computer Sciences Department University of Wisconsin Madison

Years of innovation in file systems have been highly successful in improving their performance and functionality, but at the cost of complicating their interaction with the disk. A variety of techniques exist to ensure consistency and integrity of file system data, but the precise set of correctness guarantees provided by each technique is often unclear, making them hard to compare and reason about. the absence of a formal framework has hampered detailed verification of file system *** present a logical framework for modeling the interaction of a file system with the storage system, and show how to apply the logic to represent and prove correctness properties. We demonstrate that the logic provides three main benefits. First, it enables reasoning about existing file system mechanisms, allowing developers to employ aggressive performance optimizations without fear of compromising correctness. Second, the logic simplifies the introduction and adoption of new file system functionality by facilitating rigorous proof of their correctness. Finally, the logic helps reason about smart storage systems that track semantic information about the file system.A key aspect of the logic is that it enables incremental modeling, significantly reducing the barrier to entry in terms of its actual use by file system designers. In general, we believe that our framework transforms the hitherto esoteric and error-prone "art" of file system design into a readily understandable and formally verifiable process.

关键词：

来源：评论

学校读者我要写书评

暂无评论

STAR: an efficient coding scheme for correcting triple storage node failures 05

STAR: an efficient coding scheme for correcting triple stora...

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Cheng Huang Lihao Xu Microsoft Research One Microsoft Way Redmond WA Wayne State University Detroit MI

Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding complexity for correcting (or recovering) storage node failures is essential for practical systems. In this paper, we describe a new coding scheme, which we call the STAR code, for correcting triple storage node failures (erasures). the STAR code is an extension of the double-erasure-correcting EVENODD code, and a modification of the generalized triple-erasure-correcting EVENODD code. the STAR code is an MDS code, and thus is optimal in terms of node failure recovery capability for a given data redundancy. We provide detailed STAR code's decoding algorithms for correcting various triple node failures. We show that the decoding complexity of the STAR code is much lower than those of the existing comparable codes, thus the STAR code is practically very meaningful for storage systems that need higher reliability

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accurate and efficient replaying of file system traces 05

Accurate and efficient replaying of file system traces

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Nikolai Joukov Timothy Wong Erez Zadok Stony Brook University

Replaying traces is a time-honored method for benchmarking, stress-testing, and debugging systems--and more recently--forensic analysis. One benefit to replaying traces is the reproducibility of the exact set of operations that were captured during a specific workload. Existing trace capture and replay systems operate at different levels: network packets, disk device drivers, network file systems, or system calls. System call replayers miss memory-mapped operations and cannot replay I/O-intensive workloads at original speeds. Traces captured at other levels miss vital information that is available only at the file system *** designed and implemented Replayfs, the first system for replaying file system traces at the VFS level. the VFS is the most appropriate level for replaying file system traces because all operations are reproduced in a manner that is most relevant to file-system developers. thanks to the uniform VFS API, traces can be replayed transparently onto any existing file system, even a different one than the one originally traced, without modifying existing file systems. Replayfs's user-level compiler prepares a trace to be replayed efficiently in the kernel where multiple kernel threads prefetch and schedule the replay of file system operations precisely and efficiently. these techniques allow us to replay I/O-intensive traces at different speeds, and even accelerate them on the same hardware that the trace was captured on originally.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ursa minor: versatile cluster-based storage 05

Ursa minor: versatile cluster-based storage

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Michael Abd-El-Malek William V. Courtright Chuck Cranor Gregory R. Ganger James Hendricks Andrew J. Klosterman Michael Mesnier Manish Prasad Brandon Salmon Raja R. Sambasivan Shafeeq Sinnamohideen John D. Strunk Eno thereska Matthew Wachs Jay J. Wylie Carnegie Mellon University

No single encoding scheme or fault model is optimal for all data. A versatile storage system allows them to be matched to access patterns, reliability requirements, and cost goals on a per-data item basis. Ursa Minor is a cluster-based storage system that allows data-specific selection of, and on-line changes to, encoding schemes and fault models. thus, different data types can share a scalable storage infrastructure and still enjoy specialized choices, rather than suffering from "one size fits all." Experiments with Ursa Minor show performance benefits of 2-3× when using specialized choices as opposed to a single, more general, configuration. Experiments also show that a single cluster supporting multiple workloads simultaneously is much more efficient when the choices are specialized for each distribution rather than forced to use a "one size fits all" configuration. When using the specialized distributions, aggregate cluster throughput nearly doubled.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Zodiac: efficient impact analysis for storage area networks 05

Zodiac: efficient impact analysis for storage area networks

引用

proceedings of the 4th conference on usenix conference on file and storage technologies - Volume 4

作者： Aameek Singh Madhukar Korupolu Kaladhar Voruganti Georgia Institute of Technology IBM Almaden Research Center

Currently, the fields of impact analysis and policy based management are two important storage management topics that are not being treated in an integrated manner. Policy-based storage management is being adopted by most storage vendors because it lets system administrators specify high level policies and moves the complexity of enforcing these policies to the underlying management software. Similarly, proactive impact analysis is becoming an important aspect of storage management because system administrators want to assess the impact of making a change before actually making it. Impact analysis is increasingly becoming a complex task when one is dealing with a large number of devices and workloads. Adding the policy dimension to impact analysis (that is, what policies are being violated due to a particular action) makes this problem even more *** this paper we describe a new framework and a set of optimization techniques that combine the fields of impact analysis and policy management. In this framework system administrators define policies for performance, interoperability, security, availability, and then proactively assess the impact of desired changes on both the system observables and policies. Additionally, the proposed optimizations help to reduce the amount of data and the number of policies that need to be evaluated. this improves the response time of impact analysis operations. Finally, we also propose a new policy classification scheme that classifies policies based on the algorithms that can be used to optimize their evaluation. Such a classification is useful in order to efficiently evaluate user-defined policies. We present an experimental study that quantitatively analyzes the framework and algorithms on real life storage area network policies. the algorithms presented in this paper can be leveraged by existing impact analysis and policy engine tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：