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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency 22

Brief Announcement: Deterministic Consensus and Checkpointin...

引用

acm symposium on principles of distributed computing (PODC)

作者： Chlebus, Bogdan S. Kowalski, Dariusz R. Olkowski, Jan Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA Univ Maryland Dept Comp Sci College Pk MD USA

ISBN: (纸本)9781450392624

We study consensus and checkpointing in synchronous distributed systems. There are n nodes that communicate by sending messages, and any two nodes can communicate directly. The nodes are prone to crashing, with an upper bound t on the number of crashes. Algorithms use overlay networks of choice to save on the amount of communication. We explore using Ramanujan graphs as such overlay networks. We demonstrate that Ramanujan graphs have topological properties conducive to fault-tolerance and time/communication efficiency of distributed algorithms. Our consensus algorithm assumes binary input values, runs in O(t) time and sends O(n+t log t) bits. The algorithm sends the optimum number O(n) of bits for t = O(n/log n), thus for this range of t it improves on the algorithm by Galil, Mayer and Yung [FOCS 1995] that also sends O(n) bits but works in exponential time. The consensus algorithm can be implemented such that a node sends a message to at most one node at a round while maintaining the asymptotic time and communication performance bounds. Our checkpointing algorithm runs in linear time O(n) and with O(n log(7) n) messages. It improves on the most communication-efficient and time-optimal algorithm by Galil, Mayer and Yung [FOCS 1995], which may have O(n(1+epsilon)) messages sent, for any chosen constant epsilon > 0.

关键词： distributed algorithm message passing synchrony node crash consensus checkpointing Ramanujan graph runtime performance communication performance

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Almost Universally Optimal distributed Laplacian Solver 22

Brief Announcement: Almost Universally Optimal Distributed L...

引用

acm symposium on principles of distributed computing (PODC)

作者： Anagnostides, Ioannis Lenzen, Christoph Haeupler, Bernhard Zuzic, Goran Gouleakis, Themis Carnegie Mellon Univ Pittsburgh PA 15213 USA CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany Swiss Fed Inst Technol Zurich Switzerland Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781450392624

This paper refines the distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21) via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts. Specifically, if is an element of > 0 is the error of the Laplacian solver, we obtain two main results. First, in the supported version of the CONGEST model, we establish an almost universally optimal Laplacian solver. Namely, we show that any Laplacian system on an..-node graph with shortcut quality SQ(G) can be solved after n(o)( 1) SQ(G) log(1/is an element of) rounds, almost matching our lower bound of e Omega( SQ(G)) rounds on any graph G Our techniques also imply almost universally optimal Laplacian solvers in the full generality of CONGEST, conditional on the efficient construction of shortcuts. In particular, they unconditionally imply a novel Dn(o)(1) log( 1/is an element of) Laplacian solver for excluded-minor graphs with hop-diameter... Moreover, following a recent line of work in distributed algorithms, we consider a hybrid communication model which enhances CONGEST with limited global power in the form of the nodecapacitated clique (NCC) model. In this model, we show the existence of a Laplacian solver with round complexity Dn(o)(1) log( 1/is an element of). The unifying thread of these results, and our main technical contribution, is the development of nearly-optimal distributed algorithms for a novel congested generalization of the standard part-wise aggregation problem. This primitive accelerates the Laplacian solver of Forster, Goranci, Liu, Peng, Sun, and Ye, and we believe it will find further applications in the future.

关键词： distributed algorithms Laplacian solvers universal optimality Hybrid model

来源：评论

学校读者我要写书评

暂无评论

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions 22

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expa...

引用

acm symposium on principles of distributed computing (PODC)

作者： Chang, Yi-Jun Su, Hsin-Hao Natl Univ Singapore Singapore Singapore Boston Coll Boston MA 02467 USA

ISBN: (纸本)9781450392624

Many combinatorial optimization problems, including maximum weighted matching and maximum independent set, can be approximated within (1 +/-epsilon) factors in poly(log n, 1/epsilon) rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches, however, require sending messages of unlimited size, so they do not extend to the more realistic CONGEST model, which restricts the message size to be O(log n) bits. For example, despite the long line of research devoted to the distributed matching problem, it still remains a major open problem whether an (1 - epsilon)-approximate maximum weighted matching can be computed in poly(log n, 1/epsilon) rounds in the CONGEST model. In this paper, we develop a generic framework for obtaining poly(log n, 1/epsilon)-round (1 +/- epsilon)-approximation algorithms for many combinatorial optimization problems, including maximum weighted matching, maximum independent set, and correlation clustering, in graphs excluding a fixed minor in the CONGEST model. This class of graphs covers many sparse network classes that have been studied in the literature, including planar graphs, bounded-genus graphs, and bounded-treewidth graphs. Furthermore, we show that our framework can be applied to give an efficient distributed property testing algorithm for an arbitrary minor-closed graph property that is closed under taking disjoint union, significantly generalizing the previous distributed property testing algorithm for planarity in [Levi, Medina, and Ron, PODC 2018 & distributed computing 2021]. Our framework uses distributed expander decomposition algorithms [Chang and Saranurak, FOCS 2020] to decompose the graph into clusters of high conductance. We show that any graph excluding a fixed minor admits small edge separators. Using this result, we show the existence of a high-degree vertex in each cluster in an expander decomposition, which allows the entire graph topology of the cluster to be routed to a

关键词： distributed graph algorithms expander decompositions matching

来源：评论

学校读者我要写书评

暂无评论

PPoPP 2022 - proceedings of the 27th acm SIGPLAN symposium on principles and Practice of Parallel Programming

PPoPP 2022 - Proceedings of the 27th ACM SIGPLAN Symposium o...

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2022

ISBN: (纸本)9781450392044

The proceedings contain 46 papers. The topics discussed include: stream processing with dependency-guided synchronization;mashup: making serverless computing useful for HPC workflows via hybrid execution;parallel block-delayed sequences;near-optimal sparse Allreduce for distributed deep learning;Vapro: performance variance detection and diagnosis for production-run parallel applications;interference relation-guided SMT solving for multi-threaded program verification;extending the limit of molecular dynamics with ab initio accuracy to 10 billion atoms;scaling graph traversal to 281 trillion edges with 40 million cores;asymmetry-aware scalable locking;the performance power of software combining in persistence;and multi-queues can be state-of-the-art priority schedulers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach 36

Brief Announcement: Distributed Algorithms for Minimum Domin...

引用

36th International symposium on distributed computing, DISC 2022

作者： Alipour, Sharareh Salari, Mohammadhadi Tehran Institute for Advanced Studies Iran Simon Fraser University Burnaby Canada

ISBN: (纸本)9783959772556

In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set (MTDS) problem. We propose a new idea to compute approximate MDS and MTDS. This new approach can be implemented in a distributed model or parallel model. We also show how to use this new approach in other related problems such as set cover problem and k-distance dominating set problem. © Sharareh Alipour and Mohammadhadi Salari.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication 22

Early Adapting to Trends: Self-Stabilizing Information Sprea...

引用

acm symposium on principles of distributed computing (PODC)

作者： Korman, Amos Vacus, Robin Tel Aviv Univ French Natl Ctr Sci Res CNRS French Israeli Lab Fdn Comp Sci UMI FILOFOCSUP7HUJIWISInt Joint Res Unit Tel Aviv Israel French Natl Ctr Sci Res CNRS Inst Res Fundamental Comp Sci IRIF Paris France

ISBN: (纸本)9781450392624

How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication resources necessary to spread information under faulty conditions. Here we study the self-stabilizing bit-dissemination problem, introduced by Boczkowski, Korman, and Natale in [SODA 2017]. The problem considers a fully-connected network of n agents, with a binary world of opinions, one of which is called correct. At any given time, each agent holds an opinion bit as its public output. The population contains a source agent which knows which opinion is correct. This agent adopts the correct opinion and remains with it throughout the execution. We consider the basic PULL model of communication, in which each agent observes relatively few randomly chosen agents in each round. The goal of the non-source agents is to quickly converge on the correct opinion, despite having an arbitrary initial configuration, i.e., in a self-stabilizing manner. Once the population converges on the correct opinion, it should remain with it forever. Motivated by biological scenarios in which animals observe and react to the behavior of others, we focus on the extremely constrained model of passive communication, which assumes that when observing another agent the only information that can be extracted is the opinion bit of that agent. We prove that this problem can be solved in a poly-logarithmic in n number of rounds with high probability, while sampling a logarithmic number of agents at each round. Previous works solved this problem faster and using fewer samples, but they did that by decoupling the messages sent by agents from their output opinion, and hence do not fit the framework of passive communication. Moreover, these works use complex recursive algorithms with refined clocks that are unlikely to be used by biological entities. In contrast, our propo

关键词： Consensus protocols Population protocols Biological distributed algorithms Self-stabilization Passive communication

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents 22

Brief Announcement: Gathering Despite a Linear Number of Wea...

引用

acm symposium on principles of distributed computing (PODC)

作者： Hirose, Jion Nakamura, Junya Ooshita, Fukuhito Inoue, Michiko Nara Inst Sci & Technol Ikoma Nara Japan Toyohashi Univ Technol Toyohashi Aichi Japan Fukui Univ Technol Fukui Fukui Japan

ISBN: (纸本)9781450392624

We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist k agents with unique identifiers (IDs) in the network, and.. of them are weakly Byzantine agents, which behave arbitrarily except for falsifying their IDs. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, there exists a gathering algorithm that tolerates any number of Byzantine agents, while the fastest gathering algorithm requires Omega(f(2)) non-Byzantine agents. This paper proposes an algorithm that solves the gathering problem efficiently with Omega(f(2)) non-Byzantine agents since there is a large gap between the number of non-Byzantine agents in the previous works. The proposed algorithm achieves the gathering in O(f center dot |Lambda(good) | center dot X (Nu)) rounds in case of 9f + 8 <= k and simultaneous startup if.. is given to agents, where ||Lambda(good) | | is the length of the largest ID among nonByzantine agents, and |Lambda(good) | is the number of rounds required to explore any network composed of n nodes. This algorithm is faster than the most fault-tolerant existing algorithm and requires fewer non-Byzantine agents than the fastest algorithm if.. is given to agents, although the guarantees on simultaneous termination and startup delay are not the same. To achieve this property, we propose a new technique to simulate a Byzantine consensus algorithm for synchronous message-passing systems on agent systems.

关键词： Gathering distributed algorithms Byzantine environments

来源：评论

学校读者我要写书评

暂无评论

36th International symposium on distributed computing, DISC 2022

36th International Symposium on Distributed Computing, DISC ...

引用

36th International symposium on distributed computing, DISC 2022

ISBN: (纸本)9783959772556

The proceedings contain 49 papers. The topics discussed include: managing the cyber risk in a decoupled world: does this bring potential opportunities in computer science?;using linearizable objects in randomized concurrent programs;good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case;polynomial-time verification and testing of implementations of the snapshot data structure;almost universally optimal distributed Laplacian solvers via low-congestion shortcuts;byzantine connectivity testing in the congested clique;efficient classification of locally checkable problems in regular trees;holistic verification of blockchain consensus;how to meet at a node of any connected graph;liveness and latency of byzantine state-machine replication;and how to wake up your neighbors: safe and nearly optimal generic energy conservation in radio networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Framework for distributed Quantum Queries in the CONGEST Model 22

A Framework for Distributed Quantum Queries in the CONGEST M...

引用

acm symposium on principles of distributed computing (PODC)

作者： van Apeldoorn, Joran de Vos, Tijn Univ Amsterdam QuSoft Amsterdam Netherlands Univ Amsterdam IViR Amsterdam Netherlands Univ Salzburg Salzburg Austria

ISBN: (纸本)9781450392624

The Quantum CONGEST model is a variant of the CONGEST model, where messages consist of O(log(n)) qubits. In this paper, we give a general framework for implementing quantum query algorithms efficiently in a Quantum CONGEST network, using the concept of parallel-query quantum algorithms. We apply our framework for distributed quantum queries in two settings: problems where data is distributed over the network, and graph theoretical problems where the network defines the input. The first setting is slightly unusual in CONGEST but here our results follow almost directly from the quantum query setting. The second setting is more traditional for the CONGEST model but here our framework requires also some classical CONGEST steps to apply. In the setting with distributed data, we show how a network can pick one of k dates for a meeting such that a maximum number of nodes is available, using (O) over tilde(root kD + D) rounds, with D the network diameter. The classical complexity is linear in k. We also give an efficient algorithm for element distinctness: if all nodes together holds a list of k numbers, we show that the nodes can determine whether there are any duplicates in (O) over tilde (k(2/3) D-1/3 + D) rounds. Classically this problem requires (Omega) over tilde (k + D) rounds. We also generalize the protocol for the distributed Deutsch-Jozsa problem from the two-party setting considered by Buhrman, Cleve, and Wigderson [4] to general networks. This gives a novel separation between exact classical and exact quantum protocols in the CONGEST model. In the setting where the input is the network structure itself, our framework almost directly allows us to recover the O(root nD) round diameter computation algorithm of Le Gall and Magniez [21]. We extend this approach to also compute the radius in the same number of rounds, and to give an epsilon-additive approximation of the average eccentricity in (O) over tilde (D-3/2/epsilon) rounds. Finally, we give the first quantum

关键词： Quantum CONGEST element distinctness distributed Deutsch-Jozsa cycle detection girth

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Asymmetric Mutual Exclusion for RDMA 36

Brief Announcement: Asymmetric Mutual Exclusion for RDMA

引用

36th International symposium on distributed computing, DISC 2022

作者： Nelson-Slivon, Jacob Tseng, Lewis Palmieri, Roberto Lehigh University BethlehemPA United States Boston College MA United States

ISBN: (纸本)9783959772556

In this brief announcement, we define operation asymmetry, which captures how processes may interact with an object differently, and discuss its implications in the context of a popular network communication technology, remote direct memory access (RDMA). Then, we present a novel approach to mutual exclusion for RDMA-based distributed synchronization under operation asymmetry. Our approach avoids RDMA loopback for local processes and guarantees starvation-freedom and fairness. © Jacob Nelson-Slivon, Lewis Tseng, and Roberto Palmieri.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：