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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,301 篇 会议
53 篇 期刊文献
1 册 图书

馆藏范围

1,355 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,071 篇 工学
- 1,039 篇 计算机科学与技术...
- 439 篇 软件工程
- 152 篇 信息与通信工程
- 149 篇 电气工程
- 75 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
298 篇 理学
- 272 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

247 篇 distributed comp...
95 篇 distributed algo...
76 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 congest model
22 篇 local model
22 篇 algorithms
21 篇 fault tolerance
21 篇 distributed grap...
19 篇 cloud computing
17 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 graph algorithms
14 篇 fault-tolerance
14 篇 randomized algor...

机构

29 篇 swiss fed inst t...
26 篇 technion haifa
18 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 univ michigan an...
11 篇 tel aviv univ te...
11 篇 aalto univ espoo
10 篇 carnegie mellon ...
10 篇 technion dept co...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
8 篇 weizmann inst sc...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 technion
6 篇 ecole polytech f...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 univ toronto on

作者

25 篇 kuhn fabian
22 篇 ghaffari mohsen
19 篇 censor-hillel ke...
18 篇 suomela jukka
17 篇 raynal michel
17 篇 pandurangan gopa...
16 篇 chang yi-jun
16 篇 elkin michael
16 篇 fraigniaud pierr...
14 篇 peleg david
14 篇 toueg sam
14 篇 wattenhofer roge...
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 balliu alkida
13 篇 patt-shamir boaz
13 篇 maus yannic
13 篇 olivetti dennis
13 篇 guerraoui rachid
12 篇 rajsbaum sergio

语言

1,341 篇 英文
13 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"

共 1355 条记录，以下是131-140 订阅

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

详细简洁

排序：

Stochastic Coordination in Heterogeneous Load Balancing Systems 21

Stochastic Coordination in Heterogeneous Load Balancing Syst...

引用

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

作者： Goren, Guy Vargaftik, Shay Moses, Yoram Technion Haifa Israel VMware Res Herzliyya Israel

ISBN: (纸本)9781450385480

Current-day data centers and high-volume cloud services employ a broad set of heterogeneous servers. In such settings, client requests typically arrive at multiple entry points, and dispatching them to servers is an urgent distributed systems problem. This paper presents an efficient solution to the load balancing problem in such systems that improves on and overcomes problems of previous solutions. The load balancing problem is formulated as a stochastic optimization problem, and an efficient algorithmic solution is obtained based on a subtle mathematical analysis of the problem. Finally, extensive evaluation of the solution on simulated data shows that it outperforms previous solutions. Moreover, the resulting dispatching policy can be computed very efficiently, making the solution practically viable.

关键词： distributed load balancing Heterogeneous load balancing Stochastically coordinated dispatching Parallel server model

来源：评论

学校读者我要写书评

暂无评论

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors 25

Local Constant Approximation for Dominating Set on Graphs Ex...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Marthe Bonamy Cyril Gavoille Timothe Picavet Alexandra Wesolek LaBRI University of Bordeaux CNRS Bordeaux France LaBRI University of Bordeaux Bordeaux France Technische Universität Berlin Berlin Germany

ISBN: (纸本)9798400718854

We show that graphs excluding K2,t as a minor admit a f(t)-round 50-approximation deterministic distributed algorithm for Minimum Dominating Set. The result extends to Minimum Vertex Cover. Though fast and approximate distributed algorithms for such problems were already known for H-minor-free graphs, all of them have an approximation ratio depending on the size of H. To the best of our knowledge, this is the first example of a large non-trivial excluded minor leading to fast and constant-approximation distributed algorithms, where the ratio is independent of the size of H. A new key ingredient in the analysis of these distributed algorithms is the use of asymptotic dimension.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed Replacement Paths 25

Optimal Distributed Replacement Paths

引用

proceedings of the acm symposium on principles of distributed computing

作者： Yi-Jun Chang Yanyu Chen Dipan Dey Gopinath Mishra Hung Thuan Nguyen Bryce Sanchez National University of Singapore Singapore Singapore Tata Institute of Fundamental Research Mumbai India

ISBN: (纸本)9798400718854

We study the replacement paths problem in the CONGEST model of distributed computing. Given an s-t shortest path P, the goal is to compute, for every edge e in P, the shortest-path distance from s to t avoiding e. For unweighted directed graphs, we establish the tight randomized round complexity bound for this problem as [EQUATION] by showing matching upper and lower bounds. Our upper bound extends to (1 + ϵ)-approximation for weighted directed graphs. Our lower bound applies even to the second simple shortest path problem, which asks only for the smallest replacement path length. These results improve upon the very recent work of Manoharan and Ramachandran (SIROCCO 2024), who showed a lower bound of [EQUATION] and an upper bound of [EQUATION], where hst is the number of hops in the given s-t shortest path P.

关键词： CONGEST

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: What's Live? Understanding distributed Consensus 21

Brief Announcement: What's Live? Understanding Distributed C...

引用

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

作者： Chand, Saksham Liu, Yanhong A. SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Apple Inc Cupertino CA 95014 USA

ISBN: (纸本)9781450385480

distributed consensus algorithms such as Paxos have been studied extensively. Many different liveness properties and assumptions have been stated for them, but there are no systematic comparisons for better understanding of these properties. This paper systematically studies and compares different liveness properties stated for over 30 prominent consensus algorithms and variants. We introduced a precise high-level language and formally specified these properties in the language. We then create a hierarchy of liveness properties combining two hierarchies of the assumptions used and a hierarchy of the assertions made, and compare the strengths and weaknesses of algorithms that ensure these properties. Our formal specifications and systematic comparisons led to the discovery of a range of problems in various stated liveness properties. We also developed TLA+ specifications of these liveness properties, and we used model checking of execution steps to illustrate liveness patterns for Paxos.

关键词： distributed consensus liveness

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Towards Energy-Efficient distributed Agreement 25

Brief Announcement: Towards Energy-Efficient Distributed Agr...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Hugo Mirault Peter Robinson School of Computer and Cyber Sciences Augusta University Augusta GA USA

ISBN: (纸本)9798400718854

We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called energy complexity), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping nodes are lost. We present new deterministic consensus algorithms that tolerate up to f < n crash failures, where n is the number of nodes. Our algorithms match the optimal time complexity lower bound of f + 1 rounds. For multi-value consensus, where the input values are chosen from some possibly large set, we achieve an energy complexity of [EQUATION] rounds, whereas for binary consensus, we show that [EQUATION] rounds are possible.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm 25

Distributed Freeze Tag: a sustainable solution to discover a...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Cyril Gavoille Nicolas Hanusse Gabriel Le Bouder Taïssir Marcé LaBRI Université de Bordeaux CNRS Bordeaux France

ISBN: (纸本)9798400718854

The Freeze-Tag Problem consists in waking up a swarm of robots starting with one initially awake robot. While there exists a wide literature on the centralized setting, where the locations of the robots are known in advance, we focus on the distributed version where the locations of the robots, P, are unknown, and where awake robots only detect other robots up to distance 1. Assuming that moving at distance δ takes a time δ, we show that waking up the whole swarm takes O(ρ + ℓ2 log(ρ/ℓ)), where ρ is the largest distance from the initial robot to any point of P, and ℓ is the connectivity threshold of P. Moreover, the result is complemented by a matching lower bound. We also provide other distributed algorithms, complemented with lower bounds, whenever each robot has a bounded amount of energy.

关键词： mobile agents

来源：评论

学校读者我要写书评

暂无评论

Decision Power of Weak Asynchronous Models of distributed computing 21

Decision Power of Weak Asynchronous Models of Distributed Co...

引用

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

作者： Czerner, Philipp Guttenberg, Roland Helfrich, Martin Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network satisfies a given property. The study classifies models according to four criteria, and shows that twenty-four initially possible combinations collapse into seven equivalence classes with respect to their decision power, i.e. the properties that the automata of each class can decide. However, Esparza and Reiter only show (proper) inclusions between the classes, and so do not characterise their decision power. In this paper we do so for labelling properties, i.e. properties that depend only on the labels of the nodes, but not on the structure of the graph. In particular, majority (whether more nodes carry label a than b) is a labelling property. Our results show that only one of the seven equivalence classes identified by Esparza and Reiter can decide majority for arbitrary networks. We then study the expressive power of the classes on bounded-degree networks, and show that three classes can. In particular, we present an algorithm for majority that works for all bounded-degree networks under adversarial schedulers, i.e. even if the scheduler must only satisfy that every node makes a move infinitely often, and prove that no such algorithm can work for arbitrary networks.

关键词： distributed computing graph automata weak asynchronous models labelling properties communication graphs decision power

来源：评论

学校读者我要写书评

暂无评论

Nearly-Optimal distributed Ruling Sets for Trees and high-girth graphs 25

Nearly-Optimal Distributed Ruling Sets for Trees and high-gi...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Malte Baumecker Yannic Maus Jara Uitto Graz University of Technology Graz Austria Aalto University Helsinki Finland

ISBN: (纸本)9798400718854

Given a graph G = (V, E), a β-ruling set is a subset S ⊆ V that is i) independent, and ii) every node υ ∈ V has a node of S within distance β. In this paper we present almost optimal distributed algorithms for finding ruling sets in trees and high girth graphs in the classic LOCAL model. As our first contribution we present an O(log log n)-round randomized algorithm for computing 2-ruling sets on trees, almost matching the Ω (log log n/log log log n) lower bound given by Balliu et al. [FOCS'20]. Second, we show that 2-ruling sets can be solved in Õ(log5/3 log n) rounds in high-girth graphs. Lastly, we show that O(log log log n)-ruling sets can be computed in Õ(log log n) rounds in high-girth graphs matching the lower bound up to triple-log factors. All of these results either improve polynomially or exponentially on the previously best algorithms and use a smaller domination distance β.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs 21

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

引用

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

作者： Bodwin, Greg Parter, Merav Univ Michigan EECS Ann Arbor MI 48109 USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450385480

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-sensitive: if one selects a particular canonical shortest path for each node pair, it is no longer guaranteed that one can build replacement paths by concatenating two selected shortest paths. They left as an open problem whether a method of shortest path tiebreaking with this desirable property is generally possible. We settle this question affirmatively with the first general construction of restorable tiebreaking schemes. We then show applications to various problems in fault-tolerant network design. These include a faster algorithm for subset replacement paths, more efficient fault-tolerant (exact) distance labeling schemes, fault-tolerant subset distance preservers and +4 additive spanners with improved sparsity, and fast distributed algorithms that construct these objects. For example, an almost immediate corollary of our restorable tiebreaking scheme is the first nontrivial distributed construction of sparse fault-tolerant distance preservers resilient to three faults.

关键词： shortest path tiebreaking fault tolerance spanners labeling schemes replacement paths distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Contention Resolution with Predictions 21

Contention Resolution with Predictions

引用

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

作者： Gilbert, Seth Newport, Calvin Vaidya, Nitin Weaver, Alex Natl Univ Singapore Singapore Singapore Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450385480

In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring. The goal is to leverage the predictive power of this distribution to improve on worst-case time complexity bounds. Using a novel connection between contention resolution and information theory, we prove lower bounds on the expected time complexity with respect to the Shannon entropy of the corresponding network size random variable, for both the collision detection and no collision detection assumptions. We then analyze upper bounds for these settings, assuming now that the distribution provided as input might differ from the actual distribution generating network sizes. We express their performance with respect to both entropy and the statistical divergence between the two distributions-allowing us to quantify the cost of poor predictions. Finally, we turn our attention to the related perfect advice setting, parameterized with a length b >= 0, in which all active processes in a given execution are provided the best possible b bits of information about their network. We provide tight bounds on the speed-up possible with respect to b for deterministic and randomized algorithms, with and without collision detection. These bounds provide a fundamental limit on the maximum power that can be provided by any predictive model with a bounded output size.

关键词： distributed algorithms contention resolution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：