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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,317 篇 会议
154 篇 期刊文献
6 册 图书

馆藏范围

4,476 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,287 篇 工学
- 3,133 篇 计算机科学与技术...
- 1,641 篇 软件工程
- 413 篇 信息与通信工程
- 374 篇 电气工程
- 224 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
806 篇 理学
- 671 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 171 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

373 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
107 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
41 篇 high performance...

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
13 篇 georgia inst tec...
12 篇 univ toronto on
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 toueg sam

语言

4,359 篇 英文
114 篇 其他
4 篇 中文

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

共 4477 条记录，以下是771-780 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Reduction of inter-process communication in distributed simulation of road traffic 20

Reduction of inter-process communication in distributed simu...

引用

proceedings of the IEEE/acm 24th International symposium on distributed Simulation and Real Time Applications

作者： Tomas Potuzak Umiversity of West Bohemia Plzen Czech Republic

A detailed computer simulation is an important tool for the managing of road traffic. Since it can be very time consuming, it is often performed in a distributed computing environment. The simulated road traffic network is then divided into sub-networks simulated by processes on the nodes of the distributed computer. The inter-process communication necessary for the vehicle transfer and the synchronization can then significantly influence the performance of the distributed road traffic simulation. In this paper, two efficient communication protocols for distributed road traffic simulation, which we developed during our previous research, are compared. These protocols - the Long Step (LS) protocol and the Long Step Binary (LSB) protocol - reduce the inter-process communication using an aggregate message transfer and/or a lossy data compression. Semi-centralized, centralized, and distributed variants of both protocols were thoroughly tested and compared to a reference communication protocol representing a common protocol of distributed road traffic simulators. The tests indicate significant savings of the number of transferred messages and, more importantly, of the total computation time.

关键词： distributed simulation communication reduction aggregate transfer road traffic lossy data compression

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the Use of Randomness in Local distributed Graph Algorithms 19

On the Use of Randomness in Local Distributed Graph Algorith...

引用

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

作者： Ghaffari, Mohsen Kuhn, Fabian Swiss Fed Inst Technol CH-8092 Zurich Switzerland Univ Freiburg D-79110 Freiburg Germany

ISBN: (纸本)9781450362177

We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: We first ask the question of how much randomness is needed to obtain efficient randomized algorithms. We show that for all locally checkable problems with poly logn-time randomized algorithms, there are such algorithms even if either (I) there is a only a single (private) independent random bit in each poly logn-neighborhood of the graph, (II) the (private) bits of randomness of different nodes are only poly lognwise independent, or (III) there are only poly logn bits of global shared randomness (and no private randomness). Second, we study how much we can improve the error probability of randomized algorithms. For all locally checkable problems with poly logn-time randomized algorithms, we show that there are such algorithms that succeed with probability 1-n-2(epsilon(log logn)2) and more generallyT -round algorithms, for T = polylog n, with success probability 1 - n-2(epsilon log2 T). We also show that poly logn-time randomized algorithms with success probability 1 - 2(-2log epsilon) n for some epsilon > 0 can be derandomized to poly logn-time deterministic algorithms. Both of the directions mentioned above, reducing the amount of randomness and improving the success probability, can be seen as partial derandomization of existing randomized algorithms. In all the above cases, we also show that any significant improvement of our results would lead to a major breakthrough, as it would imply significantly more efficient deterministic distributed algorithms for a wide class of problems.

关键词： distributed symmetry breaking randomness shared randomness LOCAL model CONGEST model

来源：评论

学校读者我要写书评

暂无评论

distributed Minimum Degree Spanning Trees 19

Distributed Minimum Degree Spanning Trees

引用

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

作者： Dinitz, Michael Halldorsson, Magnus M. Izumi, Taisuke Newport, Calvin Johns Hopkins Univ Baltimore MD 21218 USA Reykjav Univ Reykjavik Iceland Nagoya Inst Technol Nagoya Aichi Japan Georgetown Univ Washington DC USA

ISBN: (纸本)9781450362177

The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree T for graph G, such that the maximum degree of T is the smallest among all spanning trees of G. Let d be this MDST degree for a given graph. In this paper, we present a randomized distributed approximation algorithm for the MDST problem that constructs a spanning tree with maximum degree in O(d + logn). With high probability in n, the algorithm runs in O((D + root n) log(4) n) rounds, in the broadcast-CONGEST model, where D is the graph diameter and n is the graph size. We then show how to derandomize this algorithm, obtaining the same asymptotic guarantees on degree and time complexity, but now requiring the standard CONGEST model. Although efficient approximation algorithms for the MDST problem have been known in the sequential setting since the 1990's (finding an exact solution is NP-hard), our algorithms are the first efficient distributed solutions. We conclude by proving a lower bound that establishes that any randomized MDST algorithm that guarantees a maximum degree in (Omega) over tilde (d) requires (Omega) over tilde (n(1/3)) rounds, and any deterministic solution requires (Omega) over tilde (n(1/2)) rounds. These bounds proves our deterministic algorithm to be asymptotically optimal, and eliminates the possibility of significantly more efficient randomized solutions.

关键词： CONGEST spanning tree minimum degree

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm 19

Partially Replicated Causally Consistent Shared Memory: Lowe...

引用

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

作者： Xiang, Zhuolun Vaidya, Nitin H. Univ Illinois Champaign IL 61820 USA Georgetown Univ Washington DC 20057 USA

ISBN: (纸本)9781450362177

The focus of this paper is on causal consistency in a partially replicated distributed shared memory (DSM) system that provides the abstraction of shared read/write registers. Maintaining causal consistency in distributed shared memory systems has received significant attention in the past, mostly on full replication wherein each replica stores a copy of all the registers in the shared memory. To ensure causal consistency, all causally preceding updates must be performed before an update is performed at any given replica. Therefore, some mechanism for tracking causal dependencies is required, such as vector timestamps with the number of vector elements being equal to the number of replicas in the context of full replication. In this paper, we investigate causal consistency in partially replicated systems, wherein each replica may store only a subset of the shared registers. Building on the past work, this paper makes three key contributions: We present a necessary condition on the metadata (which we refer as a timestamp) that must be maintained by each replica to be able to track causality accurately. The necessary condition identifies a set of directed edges in a share graph that a replica's timestamp must keep track of. We present an algorithm for achieving causal consistency using a timestamp that matches the above necessary condition, thus showing that the condition is necessary and sufficient. We define a measurement of timestamp space size and present a lower bound (in bits) on the size of the timestamps. The lower bound matches our algorithm in several special cases.

关键词： distributed shared memory causal consistency tight conditions lower bounds

来源：评论

学校读者我要写书评

暂无评论

Teaching Parallel and distributed computing in the Time of COVID 21

Teaching Parallel and Distributed Computing in the Time of C...

引用

proceedings of the 52nd acm Technical symposium on Computer Science Education

作者： Joel C. Adams Richard A. Brown Suzanne J. Matthews Elizabeth Shoop Calvin University Grand Rapids MI USA St. Olaf College Northfield MN USA U.S. Military Academy West Point NY USA Macalester College St. Paul MN USA

ISBN: (纸本)9781450380621

With both CS2013 and the most recent ABET computing criteria requiring coverage of parallel and distributed computing (PDC), many CS faculty are looking for ways to incorporate PDC concepts into their curricula. However, the COVID-19 pandemic and the switch to remote teaching introduces new difficulties to teaching a subject that many already find challenging. This BOF provides a forum for computing educators to discuss strategies they have used to teach PDC remotely. The organizers will share techniques that they have found effective (including the different tradeoffs those techniques involve) and foster a discussion in which others can share novel ways of teaching PDC remotely. The end-goals are: (i) to provide a venue in which those who have taught PDC remotely can share their experiences, in the hopes of identifying best practices; and (ii) to enable participants who are new to PDC to learn from the experiences of faculty who have already taught such courses in this new environment. No laptop required; any materials resulting from this session will be distributed via ***.

关键词： beowulf cluster mpi education parallel openmp computer science multithreading virtual remote distributed message-passing pandemic online teaching

来源：评论

学校读者我要写书评

暂无评论

Storage Systems are distributed Systems (So Verify Them That Way!) 14

Storage Systems are Distributed Systems (So Verify Them That...

引用

14th USENIX symposium on Operating Systems Design and Implementation (OSDI)

作者： Hance, Travis Lattuada, Andrea Hawblitzel, Chris Howell, Jon Johnson, Rob Parno, Bryan Carnegie Mellon Univ Pittsburgh PA 15213 USA Swiss Fed Inst Technol Zurich Switzerland Microsoft Res Redmond WA USA VMware Res Palo Alto CA USA

ISBN: (纸本)9781939133199

To verify distributed systems, prior work introduced a methodology for verifying both the code running on individual machines and the correctness of the overall system when those machines interact via an asynchronous distributed environment. The methodology requires neither domain-specific logic nor tooling. However, distributed systems are only one instance of the more general phenomenon of systems code that interacts with an asynchronous environment. We argue that the software of a storage system can (and should!) be viewed similarly. We evaluate this approach in VeriBetrKV, a key-value store based on a state-of-the-art B-epsilon tree. In building VeriBetrKV, we introduce new techniques to scale automated verification to larger code bases, still without introducing domain-specific logic or tooling. In particular, we show a discipline that keeps the automated verification development cycle responsive. We also combine linear types with dynamic frames to relieve the programmer from most heap-reasoning obligations while enabling them to break out of the linear type system when needed. VeriBetrKV exhibits similar query performance to unverified databases. Its insertion performance is 24 x faster than unverified BerkeleyDB and 8 x slower than RocksDB.

关键词： Systems analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 74 75 76 77 78 79 80 81 82 83 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：