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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

116 篇 会议
3 篇 期刊文献

馆藏范围

119 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

91 篇 工学
- 90 篇 计算机科学与技术...
- 64 篇 软件工程
- 15 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 电气工程
- 2 篇 仪器科学与技术
- 2 篇 电子科学与技术（可...
- 2 篇 网络空间安全
- 1 篇 光学工程
- 1 篇 生物医学工程（可授...
38 篇 理学
- 36 篇 数学
- 15 篇 统计学（可授理学、...
- 4 篇 物理学
10 篇 管理学
- 7 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学

主题

40 篇 distributed comp...
8 篇 computer systems...
4 篇 distributed comp...
3 篇 distributed algo...
3 篇 randomized algor...
2 篇 computer science
2 篇 spanner
2 篇 database systems
2 篇 game-theoretic m...
2 篇 distributed algo...
2 篇 mobile agents
2 篇 algorithms
2 篇 consensus
2 篇 price of anarchy
2 篇 computer program...
2 篇 scheduling
2 篇 computer network...
2 篇 cryptography
2 篇 nash equilibrium
2 篇 sensor networks

机构

3 篇 irisa campus bea...
2 篇 irisa rennes ced...
2 篇 department of co...
2 篇 eth zurich
2 篇 mitre corporatio...
2 篇 boston college
2 篇 at&t bell lab mu...
2 篇 ibm san jose res...
1 篇 georgia institut...
1 篇 yale university ...
1 篇 university of ot...
1 篇 dept. of electri...
1 篇 sch. of elec./co...
1 篇 diag university ...
1 篇 school of comput...
1 篇 weizmann inst sc...
1 篇 university of co...
1 篇 univ of californ...
1 篇 department of ma...
1 篇 science and tech...

作者

4 篇 raynal michel
3 篇 kutten shay
2 篇 peleg david
2 篇 todinca ioan
2 篇 alex a. shvartsm...
2 篇 rogert wattenhof...
2 篇 fabian kuhn
2 篇 tixeuil sébastie...
2 篇 anon
2 篇 mohan c.
2 篇 michel raynal
2 篇 helary jean-mich...
2 篇 gafni eli
2 篇 isard michael
2 篇 lynch nancy
2 篇 dolev danny
2 篇 achour mostefaou...
2 篇 aspnes james
2 篇 fraigniaud pierr...
2 篇 nancy lynch

语言

118 篇 英文
1 篇 其他

检索条件"任意字段=Proceedings of the twenty-second annual symposium on Principles of distributed computing"

共 119 条记录，以下是81-90 订阅

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

详细简洁

排序：

The inherent price of indulgence 02

The inherent price of indulgence

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Dutta, Partha Guerraoui, Rachid Distributed Programming Laboratory Swiss Fed. Inst. Technol. Lausanne Lausanne Switzerland

ISBN: (纸本)9781581134858

This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of round-by-round fault detectors. We show that any P-based t-resilient consensus algorithm requires at least t+2 rounds for a global decision even in runs that are synchronous. We then prove the bound to be tight by exhibiting a new P-based t-resilient consensus algorithm that reaches a global decision at round t + 2 in every synchronous run. Our new algorithm is in this sense significantly faster than the most efficient indulgent algorithm we knew of (which requires 2t + rounds). We contrast our lower bound with the well-known t + 1 round tight lower bound on consensus for the synchronous model, pointing out the price of indulgence.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Building secure file systems out of byzantine storage 02

Building secure file systems out of byzantine storage

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Mazières, David Shasha, Dennis New York University Department of Computer Science New York NY United States

ISBN: (纸本)9781581134858

This paper shows how to implement a trusted network file system on an untrusted server. While cryptographic storage techniques exist that allow users to keep data secret from untrusted servers, this work concentrates on the detection of tampering attacks and stale data. Ideally, users of an untrusted storage server would immediately and unconditionally notice any misbehavior on the part of the server. This ideal is unfortunately not achievable. However, we define a notion of data integrity called fork consistency in which, if the server delays just one user from seeing even a single change by another, the two users will never again see one another's changes-a failure easily detectable with on-line communication. We give a practical protocol for a multi-user network file system called SUNDR, and prove that SUNDR offers fork consistency whether or not the server obeys the protocol.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Nonatomic mutual exclusion with local spinning 02

Nonatomic mutual exclusion with local spinning

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Anderson, James H. Kim, Yong-Jik Department of Computer Science Univ. North Carolina at Chapel Hill Chapel Hill NC 27514 United States

ISBN: (纸本)9781581134858

We present an N-process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs Θ(log N) remote memory references to enter and exit its critical section. No atomic read/write algorithm with better asymptotic worst-case time complexity is currently known. This suggests that atomic memory is not fundamentally required if one is interested in worst-case time complexity. The same cannot be said if one is interested in fast-path or adaptive algorithms. We show that such algorithms fundamentally require memory accesses to be atomic. In particular, we show that for any N-process nonatomic algorithm, there exists a single-process execution in which the lone competing process executes Ω(log N/log log N) remote operations to enter its critical section. Moreover, these operations must access Ω(√log N/log log N) distinct variables.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Space-optimal multi-writer snapshot objects are slow

Space-optimal multi-writer snapshot objects are slow

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Fatourou, Panagiota Fich, Faith Ruppert, Eric University of Toronto Toronto Ont. 1827 Canada York University Toronto Ont. 1877 Canada

We consider the problem of wait-free implementation of a multi-writer snapshot object with m ≥ 2 components shared by n > m processes. It is known that this can be done using m multi-writer registers. We give a matching lower bound, slightly improving the previous space lower bound. The main focus of the paper, however, is on time complexity. The best known upper bound on the number of steps a process has to take to perform one operation of the snapshot is O(n). When m is much smaller than n, an implementation whose time complexity is a function of m rather than n would be better. We show that this cannot be achieved for any space-optimal implementation: We prove that Ω(n) steps are required to perform a SCAN operation in the worst case, even if m = 2. This significantly improves previous Ω(min(m, n)) lower bounds. Our proof also yields insight into the structure of any space-optimal implementation, showing that processes simulating the snapshot operations must access the registers in a very constrained way.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Minimal replication cost for availability

Minimal replication cost for availability

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Yu, Haifeng Vahdat, Amin Computer Science Department Duke University Durham NC 27708 United States

Today, the utility of many replicated Internet services is limited by availability rather than raw performance. To better understand the effects of replica placement on availability, we propose the problem of minimal replication cost for availability. Let replication cost be the cost associated with replica deployment, dynamic replica creation and teardown at n candidate locations. Given client access patterns, replica failure patterns, network partition patterns, a required consistency level and a target level of availability, the minimal replication cost is the lower bound on a system's replication cost. Solving this problem also answers the dual question of optimal availability given a constraint on replication cost. We design the first algorithm we are aware of to solve the problem, through reduction to integer linear programming and enumeration of pruned serialization orders. Using practical faultloads and workloads, we demonstrate that the exponential complexity of our algorithm is tractable for practical problems with hundreds of candidate locations. The lower bound computed by our algorithm is tight, but the tightness can be sacrificed by a proposed optimization for large problems. We also show that with low replica creation and teardown costs, the bound is close to tight in practical problems even with the optimization.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant routing in peer-to-peer systems

Fault-tolerant routing in peer-to-peer systems

引用

proceedings of the twenty - First annual ACM symposium on principles of distributed computing PODC 2002

作者： Aspnes, James Diamadi, Zoë Shah, Gauri Yale University New Haven CT 06520 United States

We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of a random graph embedded in a metric space whose points represent resource identifiers, where the probability of a connection between two nodes depends only on the distance between them in the metric space. We study the performance of a peer-to-peer system where nodes are embedded at grid points in a simple metric space: a one-dimensional real line. We prove upper and lower bounds on the message complexity of locating particular resources in such a system, under a variety of assumptions about failures of either nodes or the connections between them. Our lower bounds in particular show that the use of inverse power-law distributions in routing, as suggested by Kleinberg [5], is close to optimal. We also give heuristics to efficiently maintain a network supporting efficient routing as nodes enter and leave the system. Finally, we give some experimental results that suggest promising directions for future work.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Optimally work-competitive scheduling for cooperative computing with merging groups 02

Optimally work-competitive scheduling for cooperative comput...

引用

proceedings of the twenty-first annual symposium on principles of distributed computing

作者： Chryssis Georgiou Alexander Russell Alex A. Shvartsman University of Connecticut Storrs CT

No abstract available.

ISBN: (纸本)9781581134858

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic and self-stabilizing distributed matching 02

Dynamic and self-stabilizing distributed matching

引用

proceedings of the twenty-first annual symposium on principles of distributed computing

作者： Subhendu Chattopadhyay Lisa Higham Karen Seyffarth University of Calgary Calgary Alberta Canada

ISBN: (纸本)9781581134858

Finding a maximal or maximum matching in a graph is a well-understood problem for which efficient sequential algorithms exist. Applications of matchings in distributed settings make it desirable to find self-stabilizing asynchronous distributed solutions to these problems. We first present a self-stabilizing algorithm for finding a maximal matching in a general anonymous network under read/write atomicity with linear round complexity. This is followed by a self-stabilizing algorithm, with quadratic time complexity, for finding a maximum matching in a bipartite network under composite atomicity. These results represent significant progress in the area of distributed algorithms for matchings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Searching for a black hole in arbitrary networks: optimal mobile agent protocols 02

Searching for a black hole in arbitrary networks: optimal mo...

引用

proceedings of the twenty-first annual symposium on principles of distributed computing

作者： Stefan Dobrev Paola Flocchini Giuseppe Prencipe Nicola Santoro University of Ottawa University of Pisa Carleton University

ISBN: (纸本)9781581134858

Protecting agents from host attacks is a pressing security concern in networked environments supporting mobile agents. In this paper, we consider a black hole: a highly harmful host that disposes of visiting agents upon their arrival, leaving no observable trace of such a destruction. The task to identify the location of the harmful host is clearly dangerous for the searching agents. We study under what conditions and at what cost a team of autonomous asynchronous mobile agents can successfully accomplish this task; we are concerned with solutions that are generic (i.e., topology-independent). We study the size of the optimal solution (i.e., the minimum number of agents needed to locate the black hole), and the cost of the minimal solution (i.e., the number of moves performed by the agents executing a size-optimal solution protocol). We establish tight bounds on size and cost depending on the a priori knowledge the agents have about the network, and on the consistency of the local labellings. In particular, we prove that: with topological ignorance Δ + 1 agents are needed and suffice, and the cost is Θ(n2), where Δ is the maximal degree of a node and n is the number of the nodes in the network; with topological ignorance but in presence of sense of direction only two agents suffice and the cost is Θ(n2); and with complete topological knowledge only two agents suffice and the cost is Θ(n log n). All the upper-bound proofs are constructive.

关键词： mobile agents distributed computing black holes

来源：评论

学校读者我要写书评

暂无评论

The LATEX legacy

The LATEX legacy

引用

20th annual ACM symposium on principles of distributed computing

作者： Rowley, C.

The second edition of The Manual [23] begins: 'LATEX is a system for typesetting documents. Its first widely available version, mysteriously numbered 2.09, appeared in 1985.' It is too early for a complete critical assessment of the impact of LATEX 2.09 because its world-wide effects on many aspects of many cultures, not least scientific publication, remain strong after 15 years - and that itself is significant in a technological world where a mere 15 months of fame can make and break an idea. Therefore this paper provides simply a review and evaluation of the relationship between TEX, LATEX and some of the major technical developments in the world of quality automated formatting since the publication of LATEX 2.09 in 1985. It is neither definitive nor comprehensive but I hope it is informative.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共12页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：