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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,338 篇 会议
54 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,034 篇 计算机科学与技术...
- 459 篇 软件工程
- 158 篇 信息与通信工程
- 146 篇 电气工程
- 78 篇 控制科学与工程
- 42 篇 网络空间安全
- 16 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 农业工程
- 6 篇 仪器科学与技术
- 6 篇 建筑学
- 6 篇 生物工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 材料科学与工程（可...
297 篇 理学
- 270 篇 数学
- 70 篇 统计学（可授理学、...
- 17 篇 物理学
- 10 篇 系统科学
- 9 篇 化学
- 8 篇 生物学
- 6 篇 大气科学
65 篇 管理学
- 34 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
15 篇 教育学
- 15 篇 教育学
13 篇 经济学
- 13 篇 应用经济学
9 篇 法学
- 7 篇 社会学
8 篇 农学
- 8 篇 作物学
1 篇 医学

主题

249 篇 distributed comp...
96 篇 distributed algo...
77 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 local model
22 篇 algorithms
21 篇 distributed grap...
20 篇 fault tolerance
19 篇 cloud computing
17 篇 shared memory
16 篇 self-stabilizati...
15 篇 message passing
15 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

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

作者

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

语言

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

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

共 1393 条记录，以下是111-120 订阅

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

详细简洁

排序：

distributed Edge Coloring in Time Polylogarithmic in Δ 22

Distributed Edge Coloring in Time Polylogarithmic in Δ

引用

acm symposium on principles of distributed computing (PODC)

作者： Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Gran Sasso Sci Inst Laquila Italy CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450392624

We provide new deterministic algorithms for the edge coloring problem, which is one of the classic and highly studied distributed local symmetry breaking problems. As our main result, we show that a (2 Delta - 1)-edge coloring can be computed in time poly log Delta + O(log* n) in the LOCAL model. This improves a result of Balliu, Kuhn, and Olivetti [PODC '20], who gave an algorithm with a quasi-polylogarithmic dependency on Delta. We further show that in the CONGEST model, an (8 + epsilon)Delta-edge coloring can be computed in poly log Delta + O(log* n) rounds. The best previous O(Delta)-edge coloring algorithm that can be implemented in the CONGEST model is by Barenboim and Elkin [PODC '11] and it computes a 2(O(1/epsilon)) Delta-edge coloring in time O(Delta(epsilon) + log* n) for any epsilon is an element of(0, 1].

关键词： edge coloring LOCAL model CONGEST model token dropping

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: An Improved distributed Approximate Single-Source Shortest Paths Algorithm 21

Brief Announcement: An Improved Distributed Approximate Sing...

引用

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

作者： Cao, Nairen Fineman, Jeremy T. Russell, Katina Georgetown Univ Washington DC 20007 USA

ISBN: (纸本)9781450385480

This brief announcement presents an algorithm for (1 + epsilon) approximate single-source shortest paths for directed graphs with non-negative real edge weights in the CONGEST model that runs in (O) over tilde (n(1/2) + D + n(2/5)(+o)((1)) D-2/5) log W/epsilon(2)) rounds, where W is the ratio between the largest and smallest non-zero edge weights.

关键词： distributed algorithm congest model shortest paths

来源：评论

学校读者我要写书评

暂无评论

POSTER: Remote OpenMP Offloading 27

POSTER: Remote OpenMP Offloading

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Patel, Atmn Doerfert, Johannes Univ Waterloo Waterloo Waterloo ON Canada Argonne Natl Lab Lemont Lemont IL USA

ISBN: (纸本)9781450392044

OpenMP has a long and successful history in parallel programming for CPUs, and more recently GPUs through accelerator offloading. In this work we show that the OpenMP accelerator offloading model is sufficient to seamlessly and efficiently utilize more than a single compute node, and its connected accelerators, without source code or compiler modifications. For applications that support multi-device offloading, any combination of local and remote CPUs and accelerators can be utilized simultaneously, fully transparent to the user. Our low-overhead implementation of Remote OpenMP Offloading is publicly available in the LLVM/OpenMP compiler infrastructure with LLVM 12 and later. To evaluate our work we provide detailed studies on micro benchmarks, as well as scaling results for two HPC proxy applications. We show perfect (weak) scaling across dozens of GPUs in multiple hosts with effectiveness that is directly proportional to the ratio of computation versus memory transfer time. Our work outlines the capabilities and limits of OpenMP 5.1 to efficiently utilize a distributed heterogeneous system without source, compiler, or language modifications.

关键词： OpenMP GPGPU distributed computing

来源：评论

学校读者我要写书评

暂无评论

Decentralized distributed Graph Coloring: Cluster Graphs 25

Decentralized Distributed Graph Coloring: Cluster Graphs

引用

proceedings of the acm symposium on principles of distributed computing

作者： Maxime Flin Magnús M. Halldórsson Alexandre Nolin Reykjavik University Reykjavik Iceland CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9798400718854

Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges, and they appear frequently as components in the study of distributed algorithms. In particular, we give a O (log* n)-round algorithm to (Δ + 1)-color cluster graphs of at least polylogarithmic degree. The previous best bound known was poly(log n) [Flin et al., SODA'24]. This properly generalizes results in the CONGEST model and shows that distributed graph problems can be solved quickly even when the node itself is decentralized.

关键词： distributed graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes 21

Brief Announcement: Variants of Approximate Agreement on Gra...

引用

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

作者： Ledent, Jeremy Univ Strathclyde MSP Grp Glasgow Lanark Scotland

ISBN: (纸本)9781450385480

Approximate agreement is a weaker version of consensus where two or more processes must agree on a real number within a distance e of each other. Many variants of this task have been considered in the literature: continuous or discrete ones;multi-dimensional ones;as well as agreement on graphs and other spaces. We focus on two variants of approximate agreement on graphs, edge agreement and clique agreement. We show that both tasks arise as special cases of a more general, higher-dimensional, approximate agreement task, where the processes must agree on the vertices of a simplex in a given simplicial complex. This new point of view gives rise to a novel topological perspective on the solvability of clique agreement.

关键词： distributed computing approximate agreement simplicial complex

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults 21

Brief Announcement: Making Synchronous BFT Protocols Secure ...

引用

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

作者： Kim, Justin Mehta, Vandan Nayak, Kartik Shrestha, Nibesh Montgomery High Sch Santa Rosa CA 95405 USA Rutgers State Univ New Brunswick NJ USA Duke Univ Durham NC 27706 USA Rochester Inst Technol Rochester NY 14623 USA

ISBN: (纸本)9781450385480

BFT protocols in the synchronous setting rely on a strong assumption: every message sent by a party will arrive at its destination within a known bounded time. To allow some degree of asynchrony while still tolerating a minority corruption, recently, in Crypto'19, a weaker synchrony assumption called mobile sluggish faults was introduced. In this work, we investigate the support for mobile sluggish faults in existing synchronous protocols such as Dfinity, Streamlet, Sync HotStuff, OptSync and the optimal latency BFT protocol. We identify key principles that can be used to "compile" these synchronous protocols to tolerate mobile sluggish faults.

关键词： distributed computing Byzantine Fault Tolerance Weak Synchrony

来源：评论

学校读者我要写书评

暂无评论

Quantum Communication Advantage for Leader Election and Agreement 25

Quantum Communication Advantage for Leader Election and Agre...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Frédéric Magniez Gopal Pandurangan School of Computing and Communications Lancaster University Lancaster United Kingdom Université Paris Cité CNRS IRIF Paris France Department of Computer Science University of Houston Houston Texas USA

ISBN: (纸本)9798400718854

This work focuses on understanding the quantum message complexity of two central problems in distributed computing, namely, leader election and agreement in synchronous message-passing communication networks. We show that quantum communication gives an advantage for both problems by presenting quantum distributed algorithms that significantly outperform their respective classical counterparts under various network *** prior works have studied and analyzed quantum distributed algorithms in the context of (improving) round complexity, a key conceptual contribution of our work is positing a framework to design and analyze the message complexity of quantum distributed algorithms. We present and demonstrate how quantum algorithmic techniques, such as Grover search, quantum counting, and quantum walks, can significantly enhance the message efficiency of distributed *** particular, our leader election protocol for diameter-2 networks uses quantum walks to achieve the improved message complexity. To the best of our knowledge, this is the first such application of quantum walks in distributed computing.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Stream Processing with Dependency-Guided Synchronization 22

Stream Processing with Dependency-Guided Synchronization

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Kallas, Konstantinos Niksic, Filip Stanford, Caleb Alur, Rajeev Univ Pennsylvania Philadelphia PA USA

ISBN: (纸本)9781450392044

Real-time data processing applications with low latency requirements have led to the increasing popularity of stream processing systems. While such systems offer convenient APIs that can be used to achieve data parallelism automatically, they offer limited support for computations that require synchronization between parallel nodes. In this paper, we propose dependency-guided synchronization (DGS), an alternative programming model for stateful streaming computations with complex synchronization requirements. In the proposed model, the input is viewed as partially ordered, and the program consists of a set of parallelization constructs which are applied to decompose the partial order and process events independently. Our programming model maps to an execution model called synchronization plans which supports synchronization between parallel nodes. Our evaluation shows that APIs offered by two widely used systems-Flink and Timely Dataflow-cannot suitably expose parallelism in some representative applications. In contrast, DGS enables implementations with scalable performance, the resulting synchronization plans offer throughput improvements when implemented manually in existing systems, and the programming overhead is small compared to writing sequential code.

关键词： data parallelism sharding synchronization distributed stream processing

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Vertex Splitting with Applications 36

Fast Distributed Vertex Splitting with Applications

引用

36th International symposium on distributed computing, DISC 2022

作者： Halldórsson, Magnús M. Maus, Yannic Nolin, Alexandre Reykjavik University Iceland TU Graz Austria CISPA Saarbrücken Germany

ISBN: (纸本)9783959772556

We present poly log log n-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into k parts such that a node of degree d(u) has ≈ d(u)/k neighbors in each part. Our techniques can be seen as the first progress towards general poly log log n-round algorithms for the Lovász Local Lemma. As the main application of our result, we obtain a randomized poly log log n-round CONGEST algorithm for (1 + Ε)∆-edge coloring n-node graphs of sufficiently large constant maximum degree ∆, for any Ε > 0. Further, our results improve the computation of defective colorings and certain tight list coloring problems. All the results improve the state-of-the-art round complexity exponentially, even in the LOCAL model. © Magnús M. Halldórsson, Yannic Maus, and Alexandre Nolin.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds on the State Complexity of Population Protocols 21

Lower Bounds on the State Complexity of Population Protocols

引用

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

作者： Czerner, Philipp Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol that computes it. Previous work by Blondin et al. has shown that the counting predicates x >= eta have state complexity O(log eta) for leaderless protocols and O(log log eta) for protocols with leaders. We obtain the first non-trivial lower bounds: the state complexity of x >= eta is Omega(log log log eta) for leaderless protocols, and the inverse of a non-elementary function for protocols with leaders.

关键词： distributed computing population protocols state complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共140页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：