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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,075 篇 工学
- 1,046 篇 计算机科学与技术...
- 460 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 77 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
92 篇 distributed algo...
82 篇 distributed comp...
33 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
20 篇 distributed grap...
19 篇 message passing
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...

作者

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

语言

1,382 篇 英文
7 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1390 条记录，以下是241-250 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Elle: Finding Isolation Violations in Real-World Databases 21

Elle: Finding Isolation Violations in Real-World Databases

引用

proceedings of the 2021 acm symposium on principles of distributed computing

作者： Kyle Kingsbury Jepsen Cincinnati OH USA

ISBN: (纸本)9781450385480

distributed databases are supposed to manipulate data safely, ensuring properties like serializability even when nodes or networks fail. Unfortunately, they often don't. We found consistency violations in 26 systems over the last eight years, ranging from stale reads to catastrophic data loss. We review the Jepsen testing library [1], which combines automated deployment, fault injection, and property-based testing techniques to uncover safety violations and performance characteristics in a broad range of distributed *** then present Elle [2], a new library for analyzing Jepsen histories and finding consistency violations in linear time. We build on Adya's formalism [3] of transactional anomalies as cycles in a dependency graph. Unfortunately these graphs are invisible to clients. However, by carefully choosing the datatypes and operations we submit to a database, we can generate histories whose client-observable structure constrains the dependency graph of every Adya history the database could have *** can identify every anomaly in the Adya formalism (except for predicates) in linear time, allowing us to validate a broad range of isolation properties up to strict serializability. It automatically finds minimal counterexamples, helping an engineer see exactly which transactions were incompatible with (e.g.) snapshot isolation. It is sound, but since some information may be missing from observed histories, not complete. We use Jepsen and Elle to find consistency errors in a broad variety of datastores, including PostgreSQL, Dgraph, and Redis-Raft.

关键词： consistency transactions testing distributed systems

来源：评论

学校读者我要写书评

暂无评论

An Automatic Speedup Theorem for distributed Problems 19

An Automatic Speedup Theorem for Distributed Problems

引用

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

作者： Brandt, Sebastian Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450362177

Recently, Brandt et al. [STOC'16] proved a lower bound for the distributed Lovasz Local Lemma, which has been conjectured to be tight for sufficiently relaxed LLL criteria by Chang and Pettie [FOCS'17]. At the heart of their result lies a speedup technique that, for graphs of girth at least 2t + 2, transforms any t -round algorithm for one specific LLL problem into a (t - 1)-round algorithm for the same problem. We substantially improve on this technique by showing that such a speedup exists for any locally checkable problem Pi, with the difference that the problem Pi(1) the inferred (t - 1)-round algorithm solves is not (necessarily) the same problem as Pi. Our speedup is automatic in the sense that there is a fixed procedure that transforms a description for Pi into a description for Pi(1) and reversible in the sense that any (t - 1)-round algorithm for Pi(1) can be transformed into a t-round algorithm for Pi. In particular, for any locally checkable problem. with exact deterministic time complexity T (n, Delta) <= t on graphs with n nodes, maximum node degree Delta, and girth at least 2t + 2, there is a sequence of problems Pi(1), Pi(2),... with time complexities T (n, Delta) - 1, T (n, Delta) - 2,..., that can be inferred from Pi. As a first application of our generalized speedup, we solve a longstanding open problem of Naor and Stockmeyer [STOC'93]: we show that weak 2-coloring in odd-degree graphs cannot be solved in o(log*Delta) rounds, thereby providing a matching lower bound to their upper bound.

关键词： distributed graph algorithms locally checkable problems weak coloring

来源：评论

学校读者我要写书评

暂无评论

The Consensus Number of a Cryptocurrency 19

The Consensus Number of a Cryptocurrency

引用

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

作者： Guerraoui, Rachid Kuznetsov, Petr Monti, Matteo Pavlovic, Matej Seredinschi, Dragos-Adrian Ecole Polytech Fed Lausanne Lausanne Switzerland Telecom Paris IP Paris LTCI Paris France

ISBN: (纸本)9781450362177

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spending;this is usually solved by achieving consensus on the order of transfers among the participants. By treating the asset transfer problem as a concurrent object and determining its consensus number, we show that consensus is not necessary to prevent double-spending. We first consider the problem as defined by Nakamoto, where only a single process-the account owner-can withdraw from each account. Safety and liveness need to be ensured for correct account owners, whereas misbehaving account owners might be unable to perform transfers. We show that the consensus number of an asset transfer object is 1. We then consider a more general k-shared asset transfer object where up to k processes can atomically withdraw from the same account, and show that this object has consensus number k. We first establish these these results in the context of shared memory with benign faults, in order to properly understand the level of difficulty of the asset transfer problem. Then, we translate our result in the more practically relevant message passing setting with Byzantine players. We describe an asynchronous Byzantine fault-tolerant asset transfer implementation that is both simpler and more efficient than state-of-the-art consensus-based solutions. Our results are applicable to both the permissioned (private) and permissionless (public) setting, as normally their differentiation is hidden by the abstractions on top of which our algorithms are based.

关键词： distributed computing distributed asset transfer blockchain consensus

来源：评论

学校读者我要写书评

暂无评论

Hardness of distributed Optimization 19

Hardness of Distributed Optimization

引用

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

作者： Bacrach, Nir Censor-Hillel, Keren Dory, Michal Efron, Yuval Leitersdorf, Dean Paz, Ami Technion Haifa Israel CNRS Paris France Univ Paris Paris France

ISBN: (纸本)9781450362177

This paper studies lower bounds for fundamental optimization problems in the congest model. We show that solving problems exactly in this model can be a hard task, by providing (Omega) over tilde (n(2)) lower bounds for cornerstone problems, such as minimum dominating set (MDS), Hamiltonian path, Steiner tree and max-cut. These are almost tight, since all of these problems can be solved optimally in O(n(2)) rounds. Moreover, we show that even in bounded-degree graphs and even in simple graphs with maximum degree 5 and logarithmic diameter, it holds that various tasks, such as finding a maximum independent set (MaxIS) or a minimum vertex cover, are still difficult, requiring a near-tight number of (Omega) over tilde (n) rounds. Furthermore, we show that in some cases even approximations are difficult, by providing an (Omega) over tilde (n(2)) lower bound for a (7/8 + epsilon)-approximation for MaxIS, and a nearly-linear lower bound for an O(log n)-approximation for the k-MDS problem for any constant k >= 2, as well as for several variants of the Steiner tree problem. Our lower bounds are based on a rich variety of constructions that leverage novel observations, and reductions among problems that are specialized for the congest model. However, for several additional approximation problems, as well as for exact computation of some central problems in P, such as maximum matching and max flow, we show that such constructions cannot be designed, by which we exemplify some limitations of this framework.

关键词： distributed computing optimization problems approximation algorithms congest communication complexity

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Coded State Machine - Scaling State Machine Execution under Byzantine Faults 38

Brief Announcement: Coded State Machine - Scaling State Mach...

引用

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

作者： Li, Songze Sahraei, Saeid Yu, Mingchao Avestimehr, Salman Kannan, Sreeram Viswanath, Pramod Univ Southern Calif Los Angeles CA 90089 USA Univ Washington Seattle WA 98195 USA Univ Illinois Champaign IL USA

ISBN: (纸本)9781450362177

We introduce Coded State Machine (CSM), an information-theoretic framework to securely and efficiently execute multiple state machines on Byzantine nodes. The standard method of solving this problem is using State Machine Replication, which achieves high security at the cost of low efficiency. CSM simultaneously achieves the optimal linear scaling in storage, throughput, and security with increasing network size. The storage is scaled via the design of Lagrange coded states and coded input commands that require the same storage size as their origins. The computational efficiency is scaled using a novel delegation algorithm, called INTERMIX, which is an information-theoretically verifiable matrix-vector multiplication algorithm of independent interest.

关键词： state machine execution Byzantine faults security computational efficiency information theory verifiable computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：