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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

740 篇 会议
41 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

607 篇 工学
- 593 篇 计算机科学与技术...
- 344 篇 软件工程
- 93 篇 信息与通信工程
- 67 篇 控制科学与工程
- 64 篇 电气工程
- 40 篇 网络空间安全
- 12 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 农业工程
- 2 篇 建筑学
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
234 篇 理学
- 218 篇 数学
- 61 篇 统计学（可授理学、...
- 12 篇 物理学
- 6 篇 系统科学
- 4 篇 化学
- 3 篇 大气科学
- 3 篇 生物学
48 篇 管理学
- 28 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 18 篇 工商管理
10 篇 经济学
- 10 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

224 篇 distributed comp...
35 篇 distributed algo...
26 篇 distributed comp...
25 篇 computer systems...
17 篇 algorithms
15 篇 consensus
15 篇 distributed syst...
14 篇 fault tolerance
12 篇 distributed algo...
11 篇 computer network...
10 篇 message passing
10 篇 approximation al...
9 篇 self-stabilizati...
9 篇 shared memory
8 篇 cloud computing
8 篇 randomized algor...
6 篇 parallel algorit...
6 篇 computation theo...
6 篇 coloring
6 篇 sensor networks

机构

7 篇 ben gurion univ ...
5 篇 technion
5 篇 department of co...
4 篇 technion haifa
4 篇 college of compu...
4 篇 department of co...
4 篇 eth comp engn & ...
4 篇 yale univ dept c...
3 篇 univ of californ...
3 篇 univ of toronto ...
3 篇 computer enginee...
3 篇 cispa helmholtz ...
3 篇 yale university
3 篇 university of fr...
3 篇 technion israel ...
3 篇 hebrew univ jeru...
3 篇 mit cambridge ma...
3 篇 irisa rennes
3 篇 eth zurich
3 篇 cnrs university ...

作者

13 篇 kuhn fabian
13 篇 awerbuch baruch
13 篇 raynal michel
12 篇 peleg david
12 篇 kutten shay
11 篇 toueg sam
11 篇 patt-shamir boaz
11 篇 wattenhofer roge...
10 篇 guerraoui rachid
10 篇 gafni eli
10 篇 dolev danny
9 篇 elkin michael
9 篇 rajsbaum sergio
9 篇 attiya hagit
8 篇 khandekar rohit
8 篇 pandurangan gopa...
8 篇 aspnes james
8 篇 fraigniaud pierr...
7 篇 korman amos
7 篇 herlihy maurice

语言

774 篇 英文
6 篇 其他
1 篇 中文

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

共 781 条记录，以下是161-170 订阅

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

详细简洁

排序：

Adaptively Secure Broadcast, Revisited 11

Adaptively Secure Broadcast, Revisited

引用

30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Garay, Juan A. Katz, Jonathan Kumaresan, Ranjit Zhou, Hong-Sheng AT&T Labs - Research New Jersey USA University of Maryland College Park USA

ISBN: (纸本)9781450307192

We consider the classical problem of synchronous broadcast with dishonest majority, when a public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pessimistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary number of corruptions. Our positive result holds under a strong, simulation-based definition in the universal-composability framework. We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine.

关键词： Broadcast fault-tolerant distributed computing adaptive security cryptographic protocols

来源：评论

学校读者我要写书评

暂无评论

B-neck: A distributed and quiescent max-min fair algorithm 11

B-neck: A distributed and quiescent max-min fair algorithm

引用

proceedings of the 30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing

作者： Mozo, Alberto López-Presa, Jose Luis Fernández Anta, Antonio Dpto. Arquitectura Y Tecnología de Computadores U. Politécnica de Madrid Madrid Spain DIATEL U. Politécnica de Madrid Madrid Spain Institute IMDEA Networks Madrid Spain

ISBN: (纸本)9781450307192

In this brief announcement we propose B-Neck, a max-min fair distributed algorithm that is also quiescent. As far as we know, B-Neck is the first max-min fair distributed algorithm that does not require a continuous injection of control traffic to compute the rates. When changes occur, affected sessions are asynchronously informed, so they can start the process of computing their new rate (i.e., sessions do not need to poll the network for changes). The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing. © 2011 Authors.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Transactional storage for geo-replicated systems 11

Transactional storage for geo-replicated systems

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Sovran, Yair Power, Russell Aguilera, Marcos K. Li, Jinyang NYU New York NY 10003 USA

ISBN: (纸本)9781450309776

We describe the design and implementation of Walter, a key-value store that supports transactions and replicates data across distant sites. A key feature behind Walter is a new property called Parallel Snapshot Isolation (PSI). PSI allows Walter to replicate data asynchronously, while providing strong guarantees within each site. PSI precludes write-write conflicts, so that developers need not worry about conflict-resolution logic. To prevent write-write conflicts and implement PSI, Walter uses two new and simple techniques: preferred sites and counting sets. We use Walter to build a social networking application and port a Twitter-like application.

关键词： Transactions asynchronous replication geo-distributed systems distributed storage key-value store parallel snapshot isolation

来源：评论

学校读者我要写书评

暂无评论

distributed computing with rules of thumb 11

Distributed computing with rules of thumb

引用

proceedings of the 30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing

作者： Jaggard, Aaron D. Schapira, Michael Wright, Rebecca N. Department of Computer Science Colgate University Hamilton NY United States DIMACS Rutgers University New Brunswick NJ United States Department of Computer Science Princeton University Princeton NJ United States Department of Computer Science DIMACS Rutgers University New Brunswick NJ United States

ISBN: (纸本)9781450307192

We present our recent work (ICS 2011) on dynamic environments in which computational nodes, or decision makers, follow simple and unsophisticated rules of behavior (e.g., repeatedly "best replying" to others' actions, and minimizing "regret") that have been extensively studied in game theory and economics. We aim to understand when convergence of the resulting dynamics to an equilibrium point is guaranteed if nodes' interaction is not synchronized (e.g., as in Internet protocols and large-scale markets). We take the first steps of this research agenda. We exhibit a general non-convergence result and consider its implications across a wide variety of interesting and timely applications: routing, congestion control, game theory, social networks and circuit design. We also consider the relationship between classical nontermination results in distributed computing theory and our result, explore the impact of scheduling on convergence, study the computational and communication complexity of asynchronous dynamics and present some basic observations regarding the effects of asynchrony on no-regret dynamics. © 2011 Authors.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

A Complexity Separation Between the Cache-Coherent and distributed Shared Memory Models 11

A Complexity Separation Between the Cache-Coherent and Distr...

引用

30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Golab, Wojciech Hewlett Packard Labs Palo Alto CA 94304 USA

ISBN: (纸本)9781450307192

We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitates costly memory accesses called remote memory references (RMRs), which generate communication on the interconnect joining processors and main memory. In this paper we compare two popular shared memory architecture models, namely the cache-coherent (CC) and distributed shared memory (DSM) models, in terms of their power for solving synchronization problems efficiently with respect to RMRs. The particular problem we consider entails one process sending a "signal" to a subset of other processes. We show that a variant of this problem can be solved very efficiently with respect to RMRs in the CC model, but not so in the DSM model, even when we consider amortized RMR complexity. To our knowledge, this is the first separation in terms of amortized RMR complexity between the CC and DSM models. It is also the first separation in terms of RMR complexity (for asynchronous systems) that does not rely in any way on wait-freedom-the requirement that a process makes progress in a bounded number of its own steps.

关键词： Shared memory models remote memory references complexity

来源：评论

学校读者我要写书评

暂无评论

Detecting failures in distributed systems with the FALCON spy network 11

Detecting failures in distributed systems with the FALCON sp...

引用

23rd acm symposium on Operating Systems principles (SOSP 2011)

作者： Leners, Joshua B. Wu, Hao Hung, Wei-Lun Aguilera, Marcos K. Walfish, Michael Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450309776

A common way for a distributed system to tolerate crashes is to explicitly detect them and then recover from them. Interestingly, detection can take much longer than recovery, as a result of many advances in recovery techniques, making failure detection the dominant factor in these systems' unavailability when a crash occurs. This paper presents the design, implementation, and evaluation of Falcon, a failure detector with several features. First, Falcon's common-case detection time is sub-second, which keeps unavailability low. Second, Falcon is reliable: it never reports a process as down when it is actually up. third, Falcon sometimes kills to achieve reliable detection but aims to kill the smallest needed component. Falcon achieves these features by coordinating a network of spies, each monitoring a layer of the system. Falcon's main cost is a small amount of platform-specific logic. Falcon is thus the first failure detector that is fast, reliable, and viable. As such, it could change the way that a class of distributed systems is built.

关键词： Failure detectors high availability reliable detection layer-specific monitors layer-specific probes STONITH

来源：评论

学校读者我要写书评

暂无评论

Incentive-compatible distributed greedy protocols 11

Incentive-compatible distributed greedy protocols

引用

proceedings of the 30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing

作者： Nisan, Noam Schapira, Michael Valiant, Gregory Zohar, Aviv School of Engineering and Computer Science Hebrew University Jerusalem Israel Department of Computer Science Princeton University Princeton NJ United States Department of Computer Science UC Berkeley Berkeley CA United States Microsoft Research Silicon Valley Lab. Mountain View CA United States

ISBN: (纸本)9781450307192

Under many distributed protocols, the prescribed behavior for participants is to behave greedily, i.e., to repeatedly "best respond" to the others' actions. We present recent work (Proc. ICS'11) where we tackle the following general question: "When is it best for a long-sighted participant to adhere to a distributed greedy protocol?". We take a game-theoretic approach and exhibit a class of games where greedy behavior (i.e., repeated best-response) is incentive compatible for all players. We identify several environments of interest that fall within this class, thus establishing the incentive compatibility of the natural distributed greedy protocol for each. These environments include models of the Border Gateway Protocol (BGP) [4], which handles routing on the Internet, and of the Transmission Control Protocol (TCP) [3], and also stable-roommates assignments [2] and cost-sharing [5], which have been extensively studied in economic theory. © 2011 Authors.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Minimum Congestion Mapping in a Cloud 11

Minimum Congestion Mapping in a Cloud

引用

30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Bansal, Nikhil Lee, Kang-Won Nagarajan, Viswanath Zafer, Murtaza IBM T.J. Watson Research Center Yorktown Heights USA

ISBN: (纸本)9781450307192

We study a basic resource allocation problem that arises in cloud computing environments. The physical network of the cloud is represented as a graph with vertices denoting servers and edges corresponding to communication links. A workload is a set of processes with processing requirements and mutual communication requirements. The workloads arrive and depart over time, and the resource allocator must map each workload upon arrival to the physical network. We consider the objective of minimizing the congestion. We show that solving a subproblem (Single Map) about snapping a single workload to the physical graph essentially suffices to solve the general problem. In particular, an alpha-approximation for Single Map gives an O(alpha log nD) competitive algorithm for the general problem, where n is the number of nodes in the physical network and D is the maximum to minimum workload duration ratio. We also show how to solve SingleMap for two natural class of workloads, namely depth-d trees and complete-graph workloads. For depth-d tree, we give an n(O(d)) time O(d(2) log(nd))-approximation based on a strong LP relaxation inspired by the Sherali-A dams hierarchy.

关键词： Cloud computing Graph Mapping Congestion Minimization Approximation Algorithms

来源：评论

学校读者我要写书评

暂无评论

Tight Bounds for Anonymous Adopt-Commit Objects 11

Tight Bounds for Anonymous Adopt-Commit Objects

引用

23rd annual symposium on Parallelism in Algorithms and Architectures

作者： Aspnes, James Ellen, Faith Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781450307437

We give matching upper and lower bounds of Theta (min (log m/log log m, n)) for the space and individual step complexity of a wait-free m-valued adopt-commit object implemented using multi-writer registers for n anonymous processes. While the upper bound is deterministic, the lower bound holds for randomized adopt-commit objects as well. Our results are based on showing that adopt-commit objects are equivalent, up to small additive constants, to a simpler class of objects that we call weak conflict-detectors. It follows that the same lower bound holds on the individual step complexity of m-valued wait-free anonymous consensus, even for randomized algorithms with global coins against an oblivious adversary. The upper bound can also be used to slightly improve the cost of randomized consensus in the probabilistic-write model.

关键词： distributed computing shared memory anonymity adopt-commit objects conflict detectors consensus

来源：评论

学校读者我要写书评

暂无评论

Optimal-time adaptive strong renaming, with applications to counting 11

Optimal-time adaptive strong renaming, with applications to ...

引用

proceedings of the 30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing

作者： Alistarh, Dan Aspnes, James Censor-Hillel, Keren Gilbert, Seth Zadimoghaddam, Morteza EPFL Lausanne Switzerland Yale University New Haven CT United States MIT Boston MA United States National University of Singapore Singapore Singapore MIT Boston CT United States

ISBN: (纸本)9781450307192

We give two new randomized algorithms for strong renaming, both of which work against an adaptive adversary in asynchronous shared memory. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of n processes with step complexity O(log3 n). The second transforms any sorting network into a strong adaptive renaming protocol, with an expected cost equal to the depth of the sorting network. Using an AKS sorting network, this gives a strong adaptive renaming algorithm with step complexity O(log k), where k is the contention in the current execution. We show this to be optimal based on a classic lower bound of Jayanti. We also show that any such strong renaming protocol can be used to build a monotone-consistent counter with logarithmic step complexity (at the cost of adding a max register) or a linearizable fetch-and-increment register (at the cost of increasing the step complexity by a logarithmic factor). © 2011 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：