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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 电气工程
- 74 篇 控制科学与工程
- 41 篇 网络空间安全
- 17 篇 电子科学与技术（可...
- 7 篇 化学工程与技术
- 6 篇 农业工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 4 篇 交通运输工程
297 篇 理学
- 271 篇 数学
- 68 篇 统计学（可授理学、...
- 17 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 7 篇 生物学
60 篇 管理学
- 32 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 19 篇 工商管理
18 篇 教育学
- 18 篇 教育学
10 篇 经济学
- 10 篇 应用经济学
10 篇 法学
- 7 篇 社会学
- 4 篇 法学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

244 篇 distributed comp...
95 篇 distributed algo...
78 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
28 篇 distributed syst...
23 篇 approximation al...
23 篇 computer systems...
23 篇 algorithms
23 篇 congest model
22 篇 local model
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...

机构

30 篇 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...
8 篇 weizmann inst sc...
8 篇 ben gurion univ ...
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...
15 篇 wattenhofer roge...
14 篇 peleg david
14 篇 toueg sam
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,328 篇 英文
26 篇 其他
1 篇 中文

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

共 1355 条记录，以下是251-260 订阅

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

详细简洁

排序：

Quantum distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model 19

Quantum Distributed Algorithm for the All-Pairs Shortest Pat...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Izumi, Taisuke Le Gall, Francois Nagoya Inst Technol Showa Ku Nagoya Aichi Japan Kyoto Univ Grad Sch Informat Sakyo Ku Kyoto Japan

ISBN: (纸本)9781450362177

The All-Pairs Shortest Path problem (APSP) is one of the most central problems in distributed computation. In the CONGEST-CLIQUE model, in which n nodes communicate with each other over a fully connected network by exchanging messages of O(log n) bits in synchronous rounds, the best known general algorithm for APSP uses (O) over tilde (n(1/3)) rounds. Breaking this barrier is a fundamental challenge in distributed graph algorithms. In this paper we investigate for the first time quantum distributed algorithms in the CONGEST-CLIQUE model, where nodes can exchange messages of O(log n) quantum bits, and show that this barrier can be broken: we construct a (O) over tilde (n(1/4))-round quantum distributed algorithm for the APSP over directed graphs with polynomial weights in the CONGEST-CLIQUE model. This speedup in the quantum setting contrasts with the case of the standard CONGEST model, for which Elkin et al. (PODC 2014) showed that quantum communication does not offer significant advantages over classical communication. Our quantum algorithm is based on a relationship discovered by Vassilevska Williams and Williams (Jacm 2018) between the APSP and the detection of negative triangles in a graph. The quantum part of our algorithm exploits the framework for quantum distributed search recently developed by Le Gall and Magniez (PODC 2018). Our main technical contribution is a method showing how to implement multiple quantum searches (one for each edge in the graph) in parallel without introducing congestions.

关键词： distributed algorithms quantum algorithms all-pairs shortest paths CONGEST-CLIQUE model

来源：评论

学校读者我要写书评

暂无评论

Vorpal: Vector Clock Ordering For Large Persistent Memory Systems 19

Vorpal: Vector Clock Ordering For Large Persistent Memory Sy...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Korgaonkar, Kunal Izraelevitz, Joseph Zhao, Jishen Swanson, Steven Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781450362177

In systems with non-volatile main memories (NVMMs), programmers must carefully control the order in which writes become persistent. Otherwise, what will remain in persistence after a crash may be unusable upon recovery. Prior art has already explored semantic models for specifying this persist order, but most enforcement algorithms for the order are not scalable to large server machines because they assume that the machine contains only one or two memory controllers. In this paper, we describe a collection of provably-correct algorithms for enforcing the persist-order across writes, generated at many different cores, and persisted across numerous different memory controllers. Relative to existing solutions, our algorithms improve performance by 48% by reducing both traffic and serialization overheads.

关键词： scale-up architectures vector clocks parallel architectures distributed systems clocks persistent memories storage architectures non-volatile memories computer architecture non-volatile main memories

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Fast Concurrent Data Sketches 38

Brief Announcement: Fast Concurrent Data Sketches

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Rinberg, Arik Spiegelman, Alexander Bortnikov, Edward Hillel, Eshcar Keidar, Idit Serviansky, Hadar Technion Haifa Israel VMware Res Palo Alto CA USA Yahoo Res Sunnyvale CA USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450362177

Data sketches are approximate succinct summaries of long data streams. They are widely used for processing massive amounts of data and answering statistical queries about it. Existing libraries producing sketches are very fast, but do not allow parallelism for creating sketches using multiple threads or querying them while they are being built. We present a generic approach to parallelising data sketches efficiently and allowing them to be queried in real time, while bounding the error that such parallelism introduces. Utilising relaxed semantics and the notion of strong linearisability we prove our algorithm's correctness and analyse the error it induces in two specific sketches. Our implementation achieves high scalability while keeping the error small. We have contributed one of our concurrent sketches to the open-source data sketches library.

关键词： concurrency synchronization persistence design analysis of distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

From Classical to Blockchain Consensus: What Are the Exact Algorithms? 19

From Classical to Blockchain Consensus: What Are the Exact A...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Liu, Yanhong A. Stoller, Scott D. SUNY Stony Brook Stony Brook NY 11794 USA

ISBN: (纸本)9781450362177

This tutorial describes well-known algorithms for distributed consensus problems, from classical consensus to blockchain consensus, and discusses exact algorithms that are high-level as in pseudocode and directly executable at the same time. The tutorial consists of five parts: (1) A introduction to different distributed consensus problems, from classical consensus and Byzantine consensus to blockchain consensus. (2) An overview of well-known algorithms, from Paxos for classical consensus to the Bitcoin algorithm for blockchain consensus, including important variants such as Viewstamped Replication and Virtual Synchrony, as well as Proof-of-Stake vs. Proof-of-Work. (3) An overview of a method and language, DistAlgo, for expressing distributed algorithms precisely at a high-level as pseudocode and having them be directly executable at the same time. (4) A study of exact algorithms expressed at a high level for the most extensively studied algorithm variants, including Lamport's Paxos for classical consensus and Nakamoto's Bitcoin algorithm for blockchain consensus. (5) A demo of the direct execution of these exact algorithms by distributed processes.

关键词： distributed consensus blockchain consensus Paxos algorithm Bitcoin algorithm synchronization conditions high-level queries

来源：评论

学校读者我要写书评

暂无评论

On the Parallels between Paxos and Raft, and how to Port Optimizations 19

On the Parallels between Paxos and Raft, and how to Port Opt...

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Wang, Zhaoguo Zhao, Changgeng Mu, Shuai Chen, Haibo Li, Jinyang Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China NYU Dept Comp Sci New York NY 10003 USA SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781450362177

In recent years, Raft has surpassed Paxos to become the more popular consensus protocol in the industry. While many researchers have observed the similarities between the two protocols, no one has shown how Raft and Paxos are formally related to each other. In this paper, we present a formal mapping between Raft and Paxos, and use this knowledge to port a certain class of optimizations from Paxos to Raft. In particular, our porting method can automatically generate an optimized protocol specification with guaranteed correctness. As case studies, we port and evaluate two optimizations, Mencius and Paxos Quorum Lease to Raft.

关键词： Paxos Raft optimization porting

来源：评论

学校读者我要写书评

暂无评论

A distributed hypervisor for resource aggregation 24

A distributed hypervisor for resource aggregation

引用

24th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2019

作者： Chen, Yubin Ding, Zhuocheng Zhang, Jin Wang, Yun Qi, Zhengwei Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450362252

Scale-out has become the standard answer to data analysis, machine learning and many other fields. Contrary to common belief, scale-up machines can outperform scale-out clusters for a considerable portion of tasks. However, those scale-up machines are not economical and may not be affordable for small businesses. This paper presents GiantVM, a distributed hypervisor that aggregates resources from multiple physical machines, providing the guest OS with a uniform hardware abstraction. We propose techniques to deal with the challenges of CPU, Memory, and I/O virtualization in distributed environments. © 2019 Copyright held by the owner/author(s).

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Towards the Locality of Vizing's Theorem 2019

Towards the Locality of Vizing's Theorem

引用

51st Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Su, Hsin-Hao Vu, Hoa T. Boston Coll Chestnut Hill MA 02167 USA

ISBN: (纸本)9781450367059

Vizing showed that it suffices to color the edges of a simple graph using Delta + 1 colors, where Delta is the maximum degree of the graph. However, up to this date, no efficient distributed edge-coloring algorithm is known for obtaining such coloring, even for constant degree graphs. The current algorithms that get closest to this number of colors are the randomized (Delta + (Theta) over tilde(root Delta))-edge-coloring algorithm that runs in polylog( n) rounds by Chang et al. [SODA 2018] and the deterministic (Delta + polylog(n))-edge-coloring algorithm that runs in poly(Delta, log n) rounds by Ghaffari et al. [STOC 2018]. We present two distributed edge-coloring algorithms that run in poly(Delta, log n) rounds. The first algorithm, with randomization, uses only Delta + 2 colors. The second algorithm is a deterministic algorithm that uses Delta + O(log n/log log n) colors. Our approach is to reduce the distributed edge-coloring problem into an online and restricted version of balls-into-bins problem. If l is the maximum load of the bins, our algorithm uses Delta + 2l - 1 colors. We show how to achieve l = 1 with randomization and l = O(log n/log log n) without randomization.

关键词： distributed algorithms edge coloring randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast Approximate Shortest Paths in the Congested Clique 19

Fast Approximate Shortest Paths in the Congested Clique

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Censor-Hillel, Keren Dory, Michal Korhonen, Janne H. Leitersdorf, Dean Technion Dept Comp Sci Haifa Israel IST Austria Klosterneuburg Austria

ISBN: (纸本)9781450362177

We design fast deterministic algorithms for distance computation in the Congested CLIQE model. Our key contributions include: center dot A (2 + epsilon)-approximation for all-pairs shortest paths problem in O(log(2) n/epsilon) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constantfactor approximation for APSP in this model. center dot A (1+ epsilon)-approximation for multi-source shortest paths problem from O(root n) sources in O(log(2) n/epsilon) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in (O) over tilde (n(1/6)) rounds.

关键词： distributed computing approximation algorithms congested clique all-pairs shortest paths single-source shortest paths diameter matrix multiplication hopsets

来源：评论

学校读者我要写书评

暂无评论

Tight distributed listing of cliques 21

Tight distributed listing of cliques

引用

proceedings of the Thirty-Second Annual acm-SIAM symposium on Discrete Algorithms

作者： Keren Censor-Hillel Yi-Jun Chang François Le Gall Dean Leitersdorf Technion ETH Zürich Nagoya University

ISBN: (纸本)9781611976465

Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few tight bounds are known in this area. For triangle (i.e., 3-clique) listing, an optimal Õ(n1/3)-round distributed algorithm has been constructed by Chang et al. [SODA 2019, PODC 2019]. Recent works of Eden et al. [DISC 2019] and of Censor-Hillel et al. [PODC 2020] have shown sublinear algorithms for Kp-listing, for each p ≥ 4, but still leaving a significant gap between the upper bounds and the known lower bounds of the *** this paper, we completely close this gap. We show that for each p > 4, there is an Õ(n1−2/p)-round distributed algorithm that lists all p-cliques Kp in the communication network. Our algorithm is optimal up to a polylogarithmic factor, due to the [EQUATION]-round lower bound of Fischer et al. [SPAA 2018], which holds even in the CONGESTED CLIQUE model. Together with the triangle-listing algorithm by Chang et al. [SODA 2019, PODC 2019], our result thus shows that the round complexity of Kp-listing, for all p, is the same in both the CONGEST and CONGESTED CLIQUE models, at [EQUATION] *** p = 4, our result additionally matches the [EQUATION] lower bound for K4-detection by Czumaj and Konrad [DISC 2018], implying that the round complexities for detection and listing of K4 are equivalent in the CONGEST model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Can distributed Uniformity Testing Be Local? 19

Can Distributed Uniformity Testing Be Local?

引用

38th acm symposium on principles of distributed computing (PODC)

作者： Meir, Uri Minzer, Dor Oshman, Rotem Tel Aviv Univ Tel Aviv Israel Inst Adv Study Princeton NJ 08540 USA

ISBN: (纸本)9781450362177

In the distributed uniformity testing problem, k servers draw samples from some unknown distribution, and the goal is to determine whether the unknown distribution is uniform or whether it is epsilon-far from uniform, where epsilon is a proximity parameter. Each server decides whether to accept or reject, and these decisions are sent to a referee, who makes a final decision based on the servers' local decisions. Uniformity testing is a particularly useful building-block, because it is complete for the problem of testing identity to any fixed distribution. It was recently shown that distributing the task of uniformity testing allows each server to draw fewer samples than are needed in the centralized case, but so far the number of samples required for distributed uniformity testing has not been well understood. In this paper we settle this question, and also investigate the cost of using local decision rules, such as rejecting iff at least one server wants to reject (the usual decision rule used in local distributed decision). To answer these questions, we develop a new Fourier-based technique for proving lower bounds on the sample complexity of distribution testing, which lends itself particularly well to the distributed case. Using our technique, we tightly characterize the number of samples required for uniformity testing when the referee can apply any decision function to the servers' local decisions. We also show that if the network rejects whenever one server wants to reject, then the cost of uniformity testing is much higher, and in fact we do not gain compared to the centralized case unless the number of servers is exponential in Omega(1/epsilon). Finally, we apply our lower bound technique to the case where the referee applies a threshold decision rule, and also generalize a lower bound from [1] for learning an unknown input distribution.

关键词： distributed computing uniformity testing boolean analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：