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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

TFS: A transparent file system for contributory storage 5

TFS: A transparent file system for contributory storage

引用

5th usenix conference on file and storage technologies

作者： Cipar, James Corner, Mark D. Berger, Emery D. Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781931971508

Contributory applications allow users to donate unused resources on their personal computers to a shared pool. Applications such as SETI@home, Folding@home, and Freenet are now in wide use and provide a variety of services, including data processing and content distribution. However, while several research projects have proposed contributory applications that support peer-to-peer storage systems, their adoption has been comparatively limited. We believe that a key barrier to the adoption of contributory storage systems is that contributing a large quantity of local storage interferes with the principal user of the machine. To overcome this barrier, we introduce the Transparent file System (TFS). TFS provides background tasks with large amounts of unreliable storage-all of the currently available space-without impacting the performance of ordinary file access operations. We show that TFS allows a peer-to-peer contributory storage system to provide 40% more storage at twice the performance when compared to a user-space storage mechanism. We analyze the impact of TFS on replication in peer-to-peer storage systems and show that TFS does not appreciably increase the resources needed for file replication.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of verifiable audit trails for a versioning file system 5

Design and implementation of verifiable audit trails for a v...

引用

5th usenix conference on file and storage technologies

作者： Peterson, Zachary N. J. Burns, Randal Ateniese, Giuseppe Bono, Stephen Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9781931971508

We present constructs that create, manage, and verify digital audit trails for versioning file systems. Based upon a small amount of data published to a third party, a file system commits to a version history At a later date, an auditor uses the published data to verify the contents of the file system at any point in time. Digital audit trails create an analog of the paper audit process for file data, helping to meet the requirements of electronic records legislation. Our techniques address the I/O and computational efficiency of generating and verifying audit trails, the aggregation of audit information in directory hierarchies, and independence to file system architectures.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A five-year study of file-system metadata 5

A five-year study of file-system metadata

引用

5th usenix conference on file and storage technologies

作者： Agrawal, Nitin Bolosky, William J. Douceur, John R. Lorch, Jacob R. Univ Wisconsin Madison WI 53706 USA Microsoft Res Bengaluru India

ISBN: (纸本)9781931971508

For five years, we collected annual snapshots of file-system metadata from over 60,000 Windows PC file systems in a large corporation. In this paper, we use these snapshots to study temporal changes in file size, file age, file-type frequency, directory size, namespace structure, file-system population, storage capacity and consumption, and degree of file modification. We present a generative model that explains the namespace structure and the distribution of directory sizes. We find significant temporal trends relating to the popularity of certain file types, the origin of file content, the way the namespace is used, and the degree of variation among file systems, as well as more pedestrian changes in sizes and capacities. We give examples of consequent lessons for designers of file systems and related software.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Data ONTAP GX: A scalable storage cluster 5

Data ONTAP GX: A scalable storage cluster

引用

5th usenix conference on file and storage technologies

作者： Eisler, Michael Corbett, Peter Kazar, Michael Nydick, Daniel S. Wagner, J. Christopher Network Appliance Inc United States IronPort Systems Inc. United States

ISBN: (纸本)9781931971508

Data ONTAP GX is a clustered Network Attached file server composed of a number of cooperating filers. Each filer manages its own local file system, which consists of a number of disconnected flexible volumes. A separate namespace infrastructure runs within the cluster, which connects the volumes into one or more namespaces by means of internal junctions. the cluster collectively exposes a potentially large number of separate virtual servers, each with its own independent namespace, security and administrative domain. the cluster implements a protocol routing and translation layer which translates requests in all incoming file protocols into a single unified internal file access protocol called SpinNP. the translated requests are then forwarded to the correct filer within the cluster for servicing by the local file system instance. this provides data location transparency, which is used to support transparent data migration, load balancing, mirroring for load sharing and data protection, and fault tolerance. the cluster itself greatly simplifies the administration of a large number of filers by consolidating them into a single system image. Results from benchmarks (over one million file operations per second on a 24 node cluster) and customer experience demonstrate linear scaling.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Strong accountability for network storage 5

Strong accountability for network storage

引用

5th usenix conference on file and storage technologies

作者： Yumerefendi, Aydan R. Chase, Jeffrey S. Duke Univ Durham NC 27706 USA

ISBN: (纸本)9781931971508

this paper presents the design, implementation, and evaluation Of CATS, a network storage service with strong accountability properties. A CATS server annotates read and write responses with evidence of correct execution, and offers audit and challenge interfaces that enable clients to verify that the server is faithful. A faulty server cannot conceal its misbehavior, and evidence of misbehavior is independently verifiable by any participant. CATS clients are also accountable for their actions on the service. A client cannot deny its actions, and the server can prove the impact of those actions on the state views it presented to other clients. Experiments with a CATS prototype evaluate the cost of accountability under a range of conditions and expose the primary factors influencing the level of assurance and the performance of a strongly accountable storage server. the results show that strong accountability is practical for network storage systems in settings with strong identity and modest degrees of write-sharing. the accountability concepts and techniques used in CATS generalize to a broader class of networl services.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proportional-share scheduling for distributed storage systems 5

Proportional-share scheduling for distributed storage system...

引用

5th usenix conference on file and storage technologies

作者： Wang, Yin Merchant, Arif Univ Michigan Ann Arbor MI 48109 USA HP Labs Bengaluru India

ISBN: (纸本)9781931971508

Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are a number of algorithms for providing differentiated quality of service to clients of a centralized storage system, the problem has not been solved for distributed storage systems. Providing performance guarantees in distributed storage systems is more complex because clients may have different data layouts and access their data through different coordinators (access nodes), yet the performance guarantees required are global. this paper presents a distributed scheduling framework. It is an adaptation of fair queuing algorithms for distributed servers. Specifically, upon scheduling each request, it enforces an extra delay (possibly zero) that corresponds to the amount of service the client gets on other servers. Different performance goals, e.g., per storage node proportional sharing, total service proportional sharing or mixed, can be met by different delay functions. the delay functions can be calculated at coordinators locally so excess communication is avoided. the analysis and experimental results show that the framework can enforce performance goals under different data layouts and workloads.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Cobalt: Separating content distribution from authorization in distributed file systems 5

Cobalt: Separating content distribution from authorization i...

引用

5th usenix conference on file and storage technologies

作者： Veeraraghavan, Kaushik Myrick, Andrew Flinn, Jason Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9781931971508

How should a distributed file system manage access to protected content? On one hand, distributed storage should make data access pervasive: authorized users should be able to access their data from any location. On the other hand, content protection is designed to restrict access - this is often accomplished by limiting the set of computers from which content can be accessed. In this paper, we propose a new method for storing content in distributed storage called Cobalt. Rather than grant access to data based on the computer that reads the data, Cobalt grants access based on the physical proximity of authorized users. Protected content is stored encrypted in the distributed Blue file System;files can only be decrypted through the cooperation of a personal, mobile device such as cell phone. the Cobalt device is verified by content providers: it acts as a proxy that protects their interests by only decrypting data when policies specified during content acquisition are satisfied. Wireless communication with the device is used to determine the physical proximity of its user;when the Cobalt device moves out of range, protected content is made inaccessible. Our results show that Cobalt adds only modest overhead to content acquisition and playback, yet it enables new forms of interaction such as the ability to access protected content on ad hoc media players and create playlists that adapt to the tastes of nearby users.

关键词： Cobalt

来源：评论

学校读者我要写书评

暂无评论

Karma: Know-it-all replacement for a multilevel cAche 5

Karma: Know-it-all replacement for a multilevel cAche

引用

5th usenix conference on file and storage technologies

作者： Yadgar, Gala Factor, Michael Schuster, Assaf Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel IBM Haifa Res Labs Haifa Israel

ISBN: (纸本)9781931971508

Multilevel caching, common in many storage configurations, introduces new challenges to traditional cache management: data must be kept in the appropriate cache and replication avoided across the various cache levels. Some existing solutions focus on avoiding replication across the levels of the hierarchy, working well without information about temporal locality-information missing at all but the highest level of the hierarchy. Others use application hints to influence cache contents. We present Karma, a global non-centralized, dynamic and informed management policy for multiple levels of cache. Karma leverages application hints to make informed allocation and replacement decisions in all cache levels, preserving exclusive caching and adjusting to changes in access patterns. We show the superiority of Karma through comparison to existing solutions including LRU, 2Q, ARC, MultiQ, LRU-SP, and Demote, demonstrating better cache performance than all other solutions and up to 85% better performance than LRU on representative workloads.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Argon: Performance insulation for shared storage servers 5

Argon: Performance insulation for shared storage servers

引用

5th usenix conference on file and storage technologies

作者： Wachs, Matthew Abd-El-Malek, Michael thereska, Eno Ganger, Gregory R. Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781931971508

Services that share a storage system should realize the same efficiency, within their share of time, as when they have the system to themselves. the Argon storage server explicitly manages its resources to bound the inefficiency arising from inter-service disk and cache interference in traditional systems. the goal is to provide each service with at least a configured fraction (e.g., 0.9) of the throughput it achieves when it has the storage server to itself, within its share of the server-a service allocated 1/nth of a server should get nearly 1/nth (or more) of the throughput it would get alone. Argon uses automatically-configured prefetch/write-back sizes to insulate streaming, efficiency from disk seeks introduced by competing workloads. It uses explicit disk time quanta to do the same for non-streaming workloads with internal locality. It partitions the cache among services, based on their observed access patterns, to insulate the hit rate each achieves from the access patterns of others. Experiments show that, combined, these mechanisms and Argon's automatic configuration of each achieve the insulation goal.

关键词： Argon

来源：评论

学校读者我要写书评

暂无评论

引用

5th usenix conference on file and storage technologies

作者： Tian, Lei Feng, Dan Jiang, Hong Zhou, Ke Zeng, Lingfang Chen, Jianxi Wang, Zhikun Song, Zhenlei Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China University of Nebraska-Lincoln United States

ISBN: (纸本)9781931971508

this paper proposes and evaluates a novel dynamic data reconstruction optimization algorithm, called popularity-based multi-threaded reconstruction optimization (PRO), which allows the reconstruction process in a RAID-structured storage system to rebuild the frequently accessed areas prior to rebuilding infrequently accessed areas to exploit access locality. this approach has the salient advantage of simultaneously decreasing reconstruction time and alleviating user and system performance degradation. It can also be easily adopted in various conventional reconstruction approaches. In particular, we optimize the disk-oriented reconstruction (DOR) approach with PRO. the PRO-powered DOR is shown to induce a much earlier onset of response-time improvement and sustain a longer time span of such improvement than the original DOR. Our benchmark studies on read-only web workloads have shown that the PRO-powered DOR algorithm consistently outperforms the original DOR algorithm in the failure-recovery process in terms of user response time, with a 3.6%similar to 23.9% performance improvement and up to 44.7% reconstruction time improvement simultaneously.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：