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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A distributed algorithm for gathering many fat mobile robots in the plane 13

A distributed algorithm for gathering many fat mobile robots...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Agathangelou, Chrysovalandis Georgiou, Chryssis Mavronicolas, Marios Department of Computer Science University of Cyprus CY-1678 Nicosia Cyprus

ISBN: (纸本)9781450320658

We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots only make local decisions. We use a state-machine representation to formulate the gathering problem and develop a distributed algorithm that solves the problem for any number of fat robots. The main idea behind the algorithm is to enforce the robots to reach a configuration in which all the following hold: (i) The robots' centers form a convex hull in which all robots are on the convex hull's boundary;(ii) Each robot can see all other robots;(iii) The configuration is connected: every robot touches another robot and all robots form together a connected formation. We show that starting from any initial configuration, the fat robots eventually reach such a configuration and terminate yielding a solution to the gathering problem. Copyright 2013 acm.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

What can be decided locally without identifiers 13

What can be decided locally without identifiers

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Fraigniaud, Pierre Göös, Mika Korman, Amos Suomela, Jukka CNRS University Paris Diderot France Department of Computer Science University of Toronto Canada Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki Finland

ISBN: (纸本)9781450320658

Do unique node identifiers help in deciding whether a network G has a prescribed property P? We study this question in the context of distributed local decision, where the objective is to decide whether G has property P by having each node run a constant-time distributed decision algorithm. In a yes-instance all nodes should output yes, while in a no-instance at least one node should output no. Recently, Fraigniaud et al. (OPODIS 2012) gave several conditions under which identifiers are not needed, and they conjectured that identifiers are not needed in any decision problem. In the present work, we disprove the conjecture. More than that, we analyse two critical variations of the underlying model of distributed computing: (B): the size of the identifiers is bounded by a function of the size of the input network, (-B): the identifiers are unbounded, (C): the nodes run a computable algorithm, (-C): the nodes can compute any, possibly uncomputable function. While it is easy to see that under (B, C) identifiers are not needed, we show that under all other combinations there are properties that can be decided locally if and only if identifiers are present. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Tango: distributed Data Structures over a Shared Log 13

Tango: Distributed Data Structures over a Shared Log

引用

24th acm symposium on Operating Systems principles (SOSP)

作者： Balakrishnan, Mahesh Malkhi, Dahlia Wobber, Ted Wu, Ming Prabhakaran, Vijayan Wei, Michael Davis, John D. Rao, Sriram Zou, Tao Zuck, Aviad Microsoft Res Silicon Valley Mountain View CA 94043 USA Microsoft Res Asia Beijing Peoples R China Microsoft Redmond WA USA Univ Calif San Diego San Diego CA 92103 USA Cornell Univ Ithaca NY 14853 USA Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450323888

distributed systems are easier to build than ever with the emergence of new, data-centric abstractions for storing and computing over massive datasets. However, similar abstractions do not exist for storing and accessing meta-data. To fill this gap, Tango provides developers with the abstraction of a replicated, in-memory data structure (such as a map or a tree) backed by a shared log. Tango objects are easy to build and use, replicating state via simple append and read operations on the shared log instead of complex distributed protocols;in the process, they obtain properties such as linearizability, persistence and high availability from the shared log. Tango also leverages the shared log to enable fast transactions across different objects, allowing applications to partition state across machines and scale to the limits of the underlying log without sacrificing consistency.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Sparrow: distributed, Low Latency Scheduling 13

Sparrow: Distributed, Low Latency Scheduling

引用

24th acm symposium on Operating Systems principles (SOSP)

作者： Ousterhout, Kay Wendell, Patrick Zaharia, Matei Stoica, Ion Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9781450323888

Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. Scheduling highly parallel jobs that complete in hundreds of milliseconds poses a major challenge for task schedulers, which will need to schedulemillions of tasks per second on appropriate machines while offering millisecond-level latency and high availability. We demonstrate that a decentralized, randomized sampling approach provides near-optimal performance while avoiding the throughput and availability limitations of a centralized design. We implement and deploy our scheduler, Sparrow, on a 110-machine cluster and demonstrate that Sparrow performs within 12% of an ideal scheduler.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Parameterized model checking of fault-tolerant distributed algorithms by abstraction

Brief announcement: Parameterized model checking of fault-to...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： John, Annu Konnov, Igor Schmid, Ulrich Veith, Helmut Widder, Josef TU Wien Austria

ISBN: (纸本)9781450320658

We introduce an automated method for parameterized verification of fault-tolerant distributed algorithms. It rests on a novel parametric interval abstraction (PIA) technique, which works for systems with multiple parameters, for instance, where n and t are parameters describing the system size and the bound on the number of faulty processes, respectively. The PIA technique allows to map typical threshold-range intervals like [1,t + 1) and [t + 1,n - t) to values from a finite abstract domain. Applying PIA to both the local states of the processes and the global system state, the parameterized verification problem can be reduced to finite-state model checking. We demonstrate the practical feasibility of our method by verifying several variants of the well-known consistent broadcasting algorithm by Srikanth and Toueg for different fault models. To the best of our knowledge, this is the first successful automated parameterized verification of a Byzantine fault-tolerant distributed algorithm for message-passing systems. [7]. Supported by the Austrian National Research Network S11403 and S11405 (RiSE) of the Austrian Science Fund (FWF), and by the Vienna Science and Technology Fund (WWTF) grant PROSEED, ICT12-059, and VRG11-005.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Deterministic self-stabilizing leader election with O(loglog n)-bits

Brief announcement: Deterministic self-stabilizing leader el...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Blin, Lélia Tixeuil, Sébastien Université d'Evry Val d'Essonne LIP6-CNRS UMR 7606 France UPMC Sorbonne Universités LIP6-CNRS UMR 7606 Institut Universitaire de France France

ISBN: (纸本)9781450320658

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. Leader election is a fundamental building block in distributed computing, enabling to distinguish a unique node, in order to, e.g., execute particular actions. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of ω(log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(nlog 2 n) time. Our protocol has several attractive features that make it suitable for practical purposes. First, the communication model matches the one that is expected by existing compilers for real networks. Second, the size of the ring (or any upper bound for this size) needs not to be known by any node. third, the node identifiers can be of various sizes. Finally, no synchrony assumption besides a weak fair scheduler is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time, neither it does regarding minimal assumptions about the framework for our algorithm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Programming Models for High-Performance computing 13

Programming Models for High-Performance Computing

引用

13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)

作者： Snir, Marc Argonne Natl Lab Math & Comp Sci Div Argonne IL 60439 USA

ISBN: (纸本)9780769549965;9781467364652

The first version of the MPI standard was released in November 1993. At the time, many of the authors of this standard, myself included, viewed MPI as a temporary solution, to be used until it is replaced by a good programming language for distributed memory systems. Almost twenty years later, MPI is the main programming model for High-Performance computing, and practically all HPC applications use MPI, which is now in its third generation;nobody expects MPI to disappear in the coming decade. On the other hand, attempts to replace MPI with languages, such as High-Performance-Fortran, failed. Current attempts (UPC, Fortran, X10, Chapel, etc.) face major obstacles and seem unlikely to replace MPI.

关键词： message passing mannose phosphate isomerase remote procedure calls High Performance computing Programming distributed memory systems Language third generation Computer Programming Languages

来源：评论

学校读者我要写书评

暂无评论

Early-deciding consensus is expensive 13

Early-deciding consensus is expensive

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Dolev, Danny Lenzen, Christoph Hebrew University of Jerusalem Edmond Safra Campus 91904 Jerusalem Israel Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States

ISBN: (纸本)9781450320658

In consensus, the n nodes of a distributed system seek to take a consistent decision on some output, despite up to t of them crashing or even failing maliciously, i.e., behaving "Byzantine". It is known that it is impossible to guarantee that synchronous, deterministic algorithms consistently decide on an output in fewer than f + 1 rounds in executions in which the actual number of faults is f ≤ t. This even holds if faults are crash-only, and in this case the bound can be matched precisely. However, the question of whether this can be done efficiently, i.e., with little communication, so far has not been addressed. In this work, we show that algorithms tolerating Byzantine faults and deciding within f + 2 rounds must send ω(nt + t2f) messages;as a byproduct, our analysis shows that decision within f +1 rounds is impossible in this setting (unless f = t). Moreover, we prove that any crash-resilient algorithm deciding in f + 1 rounds has worst-case message complexity ω(n2f). Interestingly, this changes drastically if we restrict the fault model further. If crashes are orderly, i.e., in each round, each node picks an order in which its messages are sent, and crashing nodes successfully transmit a prefix of their sequence, deciding in f + 1 rounds can be guaranteed with O(nt) messages. Copyright 2013 acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed source detection with limited bandwidth 13

Efficient distributed source detection with limited bandwidt...

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Lenzen, Christoph Peleg, David Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States Dept. of Computer Science and Applied Math. Weizmann Institute of Science 76100 Rehovot Israel

ISBN: (纸本)9781450320658

Given a simple graph G = (V, E) and a set of sources SCV, denote for each node v Ε V by L(∞) the lexicographically ordered list of distance/source pairs (d(s, v), s), where s Ε S. For integers d, k Ε NU{∞}, we consider the source detection, or (S, d, k)-detection task, requiring each node v to learn the first k entries of L(∞) (if for all of them d(s, v) ≤ d) or all entries (d(s, v),s) Ε L (∞), satisfying that d(s, v) ≤ d (otherwise). Solutions to this problem provide natural generalizations of concurrent breadth-first search (BFS) tree constructions. For example, the special case of k = ∞ requires each source s Ε S to build a complete BFS tree rooted at s, whereas the special case of d = ∞ and S = V requires constructing a partial BFS tree comprising at least k nodes from every node in V. In this work, we give a simple, near-optimal solution for the source detection task in the CONGEST model, where messages contain at most C(logn) bits, running in d + k rounds. We demonstrate its utility for various routing problems, exact and approximate diameter computation, and spanner construction. For those problems, we obtain algorithms in the CONGEST model that are faster and in some cases much simpler than previous solutions. Copyright 2013 acm.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

On the complexity of universal leader election 13

On the complexity of universal leader election

引用

2013 acm symposium on principles of distributed computing, PODC 2013

作者： Kutten, Shay Pandurangan, Gopal Peleg, David Robinson, Peter Trehan, Amitabh Faculty of IE and M Technion Haifa 32000 Israel Div. of Mathematical Sciences Nanyang Technological Univ. Singapore 637371 Singapore Dept. of Computer Science Weizmann Institute Rehovot Israel

ISBN: (纸本)9781450320658

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most \obvious "complexity bounds have not been proven for randomized algorithms. The \obvious" lower bounds of (m) messages (m is the number of edges in the network) and (D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even (n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known). We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an ω (m) message lower bound for randomized broadcast algorithms. An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matc

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共79页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：