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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,381 篇 英文
8 篇 其他
1 篇 中文

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

共 1390 条记录，以下是311-320 订阅

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

详细简洁

排序：

Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited 18

Almost-Surely Terminating Asynchronous Byzantine Agreement R...

引用

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

作者： Bangalore, Laasya Choudhury, Ashish Patra, Arpita Int Inst Informat Technol Bangalore Bengaluru India Indian Inst Sci Bangalore Bengaluru India

ISBN: (纸本)9781450357951

The problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in the asynchronous network setting encounters inevitable non-termination issues. The impasse is overcome via randomization that allows construction of BA protocols in two flavours of termination guarantee - with overwhelming probability and with probability one. The latter type termed as almost-surely terminating BAs are the focus of this paper. An eluding problem in the domain of almost-surely terminating BAs is achieving a constant expected running time. Our work makes progress in this direction. In a setting with n parties and an adversary with unbounded computing power controlling at most t parties in Byzantine fashion, we present two asynchronous almost-surely terminating BA protocols: With the optimal resilience of t < n/3, our first protocol runs for expected 0(n) time. The existing protocols in the same setting either runs for expected O(n(2)) time (Abraham et al, PODC 2008) or requires exponential computing power from the honest parties (Wang, CoRR 2015). In terms of communication complexity, our construction outperforms all the known constructions that offer almost-surely terminating feature. With the resilience of t < n/3+epsilon for any epsilon > 0, our second protocol runs for expected O(1/epsilon) time. The expected running time of our protocol turns constant when is a constant fraction. The known constructions with constant expected running time either require to be at least 1 (Feldman-Micali, STOC 1988), implying t < n/4, or calls for exponential computing power from the honest parties (Wang, CoRR 2015). We follow the traditional route of building BA via common coin protocol that in turn reduces to asynchronous verifiable secret sharing (AVSS). Our constructions are built on a variant of AVSS that is termed as shunning. A shunning AVSS fails to offer the pr

关键词： distributed computing Byzantine Agreement Secret Sharing

来源：评论

学校读者我要写书评

暂无评论

distributed Spanner Approximation 18

Distributed Spanner Approximation

引用

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

作者： Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel

ISBN: (纸本)9781450357951

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result is that an a-approximation for the minimum directed k-spanner problem fork k >= 5 requires Omega(n/root alpha log n) rounds using deterministic algorithms or Omega(n/root alpha log n) rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round O(n(epsilon))-approximation algorithm in the LOCAL model of [Barenboim, Elkin and Gavoille, 2016], as well as a polylog-round (1 + epsilon)-approximation algorithm in the LOCAL model that we show here, our lower bounds for the CONGEST model imply a strict separation between the LOCAL and CONGEST models. Notably, to the best of our knowledge, this is the first separation between these models for a local approximation problem. Similarly, a separation between the directed and undirected cases is implied. We also prove a nearly-linear lower bound for the minimum weighted k-spanner problem for k >= 4, and we show lower bounds for the weighted 2-spanner problem. On the algorithmic side, apart from the aforementioned (1 + epsilon) approximation algorithm for minimum k-spanners, our main contribution is a new distributed construction of minimum 2-spanners that uses only polynomial local computations. Our algorithm has a guaranteed approximation ratio of O (log(m/n)) for a graph with n vertices and m edges, which matches the best known ratio for polynomial time sequential algorithms [Kortsarz and Peleg, 1994], and is tight if we restrict ourselves to polynomial local computations. Our approach allows us to extend our algorithm to work also for the directed, weighted, and client-server variants of the problem. It also provides a CONGEST algorithm for the minimum dominating set problem, with a guaranteed O (log Delta) approximation ratio.

关键词： approximation algorithms distributed network design spanners hardness of approximation

来源：评论

学校读者我要写书评

暂无评论

Barriers due to Congestion and Two Ways to Deal With Them 18

Barriers due to Congestion and Two Ways to Deal With Them

引用

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

作者： Censor-Hillel, Keren Technion Dept Comp Sci Haifa Israel

ISBN: (纸本)9781450357951

Restricting the bandwidth in models of distributed graph computations naturally introduces challenges that arise due to communication bottlenecks. In this talk, I will survey techniques for proving lower bounds on the complexity of fundamental graph problems under limited bandwidth. For some problems, allowing relaxed solutions can significantly reduce the required amount of communication, enabling efficient computations. Two successful approaches for overcoming provable barriers, namely, approximations and testing, will be exemplified and discussed in the context of distributed computing.

关键词： distributed Graph Algorithms Limited Bandwidth Lower bounds Approximations Testing

来源：评论

学校读者我要写书评

暂无评论

Tutorial: Consistency Choices in Modern distributed Systems 18

Tutorial: Consistency Choices in Modern Distributed Systems

引用

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

作者： Gotsman, Alexey IMDEA Software Inst Madrid Spain

ISBN: (纸本)9781450357951

distributed systems underlying large-scale Internet services often guarantee immediate availability and tolerate network failures at the expense of providing only weak data consistency guarantees. This is compensated for by new programming constructs, such as replicated data types (aka CRDTs) and novel forms of transactions. Navigating the spectrum of possible consistency models and programming constructs is far from trivial. This tutorial surveys recent developments that help in this: formal definitions of consistency model semantics and methods for reasoning about how the weakness of consistency models affects the correctness of applications using them.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Local distributed Sampling and Counting 18

On Local Distributed Sampling and Counting

引用

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

作者： Feng, Weiming Yin, Yitong Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450357951

In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper (Delta + 1)-list-colorings of the graph), and the task of distributed algorithm is to construct a feasible solution using local information. We study distributed sampling and counting problems, in which each instance specifies a joint distribution of feasible solutions. The task of distributed algorithm is to sample from this joint distribution, or to locally measure the volume of the probability space via the marginal probabilities. The latter task is also known as inference, which is a local counterpart of counting. For self-reducible classes of instances, the following equivalences are established in the LOCAL model up to polylogarithmic factors: For all joint distributions, approximate inference and approximate sampling are computationally equivalent. For all joint distributions defined by local constraints, exact sampling is reducible to either one of the above tasks. If further, sequentially constructing a feasible solution is trivial locally, then all above tasks are easy if and only if the joint distribution exhibits strong spatial mixing. Combining with the state of the arts of strong spatial mixing, we obtain efficient sampling algorithms in the LOCAL model for various important sampling problems, including: an O(root Delta log(3) n)-round algorithm for exact sampling matchings in graphs with maximum degree Delta, and an O(log(3) n)-round algorithm for sampling according to the hardcore model (weighted independent sets) in the uniqueness regime, which along with the Omega(diam) lower bound in [3] for sampling according to the hardcore model in the non-uniqueness regime, gives the first computational phase transition for distributed sampling.

关键词： distributed graph algorithms local computation sampling algorithms Gibbs distribution strong spatial mixing

来源：评论

学校读者我要写书评

暂无评论

Distributing computations in fog architectures 37

Distributing computations in fog architectures

引用

2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge computing Paradigms, TOPIC 2018, in conjunction with the 37th acm symposium on principles of distributed computing, PODC 2018

作者： Vidyasankar, Krishnamurthy Memorial University St. John's Newfoundland Canada

ISBN: (纸本)9781450357760

Internet of Things (IoT) services and applications include Connected Vehicles, Smart Grid, Smart Cities, Health Care and, in general, Wireless Sensors and Actuators Networks. Typically, the scenarios can be captured with a Fog computing architecture that consists of edge nodes that generate and possibly pre-process (sensor) data, fog nodes that do some processing quickly and do any actuations that may be needed, and cloud nodes that may perform further detailed analysis for long-term and archival purposes. This paradigm enables (i) quicker real time computations and actuations, avoiding the latency involved in communicating with the cloud for them, (ii) reducing the amount of data that is sent to the cloud, thus reducing network bandwidth requirement and delay in data transmission, and (iii) doing this without the need for 24/7 network connectivity to the cloud. However, the storage, compute and network connectivity capabilities of the edge and fog nodes may be limited. Hence the computations need to be distributed carefully among the processing nodes. In this paper, we develop a generic framework for distributing computations to the different nodes in a fog architecture. Our framework is applicable to an arbitrary hierarchy of the nodes, one or more homogeneous or heterogeneous source inputs, and to processing the input batches either individually or combined with other batches by way of merges and splits. It can serve initially as a schema for a given computation and later to optimize executions of instances. © 2018 Association for computing Machinery.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Asynchronous Secure distributed computing with Transferrable Non-equivocation Revisited 18

Brief Announcement: Asynchronous Secure Distributed Computin...

引用

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

作者： Bhadauria, Rishabh Choudhury, Ashish Int Inst Informat Technol Bangalore Bengaluru India

ISBN: (纸本)9781450357951

In this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n mutually distrusting parties, t of which can be under the control of a computationally bounded Byzantine adversary Adv, where t < n/2. It is well known that in the cryptographic setting where the parties have access to a public-key infrastructure (PKI) set-up and are connected by pair-wise channels, both ABA and ASMPC requires t < n/3. However, Clement et al. (PODC 2012) and Backes et al. (PODC 2014) showed that it is possible to design computationally-secure ABA and ASMPC protocols respectively, even with t < n/2, provided the parties are available with a transferrable non-equivocation mechanism. Non-equivocation is a message authentication mechanism, which prevents a corrupt sender from sending conflicting messages to different parties. The transferability of the mechanism enables a receiver to verifiably transfer any authenticated statement to other parties, on behalf of the sender. In this paper, we revisit the work of Clement et al. and Backes et al. and show the following: If n <= 3t, then it is impossible to achieve the traditional notion of validity by any ABA protocol, which demands that if the inputs of all honest parties are same, say x, then all honest parties should output x at the end of the protocol. Moreover, this holds even if the parties are equipped with a transferrable non-equivocation mechanism. The input phase of the ASMPC protocol of Backes et al (and hence the overall ASMPC protocol) may never terminate for the honest parties. The input phase runs an asynchronous primitive called Agreement on a Common Subset (ACS), which allows the honest parties to agree upon a common subset of n - t parties who provide their inputs for the computation. The ACS primitive runs n parallel instances of an ABA pr

关键词： non-equivocation fault-tolerance secure distributed computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Shuffle Management with SCache for DAG computing Frameworks 18

Efficient Shuffle Management with SCache for DAG Computing F...

引用

23rd acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Fu, Zhouwang Song, Tao Qi, Zhengwei Guan, Haibing Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9781450349826

In large-scale data-parallel analytics, shuffle, or the cross-network read and aggregation of partitioned data between tasks with data dependencies, usually brings in large overhead. To reduce shuffle overhead, we present SCache, an open source plug-in system that particularly focuses on shuffle optimization. By extracting and analyzing shuffle dependencies prior to the actual task execution, SCache can adopt heuristic pre-scheduling combining with shuffle size prediction to pre-fetch shuffle data and balance load on each node. Meanwhile, SCache takes full advantage of the system memory to accelerate the shuffle process. We have implemented SCache and customized Spark to use it as the external shuffle service and co-scheduler. The performance of SCache is evaluated with both simulations and testbed experiments on a 50-node Amazon EC2 cluster. Those evaluations have demonstrated that, by incorporating SCache, the shuffle overhead of Spark can be reduced by nearly 89%, and the overall completion time of TPC-DS queries improves 40% on average.

关键词： distributed DAG Frameworks Shuffle Optimization

来源：评论

学校读者我要写书评

暂无评论

Overview of Persistent Memory in distributed Systems Architecture - Past, Present, Future 18

Overview of Persistent Memory in Distributed Systems Archite...

引用

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

作者： Peglar, Robert Adv Computat & Storage LLC St Louis MO USA

ISBN: (纸本)9781450357951

During the past half-century, persistent memory has had an interesting history and relationship to the design of computing and storage systems. In this talk, the history of systems design using persistent memory (as well as non-persistent, aka volatile memory) will be briefly discussed, as well as approaches to data storage. The majority of the talk will focus on two areas. First, the current state of the persistent memory art, as well as a taxonomy of persistent memory. Second, current methods and issues surrounding the use of persistent memory in systems, in particular distributed systems. The relationship between processing (e.g. CPUs) and persistent memory will be discussed in detail, illustrating certain challenges and opportunities with regard to several forms of distributed computation, in particular concerning large-scale multi-processor designs using shared persistent memory technology.

关键词： Persistent Memory

来源：评论

学校读者我要写书评

暂无评论

The Energy Complexity of Broadcast 18

The Energy Complexity of Broadcast

引用

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

作者： Chang, Yi-Jun Dani, Varsha Hayes, Thomas P. He, Qizheng Li, Wenzheng Pettie, Seth Univ Michigan Ann Arbor MI 48109 USA Univ New Mexico Albuquerque NM 87131 USA Tsinghua Univ IIIS Beijing Peoples R China

ISBN: (纸本)9781450357951

Energy is often the most constrained resource in networks of battery powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (transceiver usage) not computation. As an imperfect proxy for true energy usage, we define energy complexity to be the number of time slots a device transmits/listens;idle time and computation are free. In this paper we investigate the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks. We consider models with collision detection (CD) and without (No-CD), as well as both randomized and deterministic algorithms. Some take-away messages from this work are as follows. Time lower bounds imply energy lower bounds. The energy complexity of Broadcast in a multi-hop network is connected to the time complexity of LeaderElection in a single-hop (clique) network. Many existing lower bounds on time complexity immediately transfer to energy complexity. For example, in the CD and No-CD models, Broadcast requires Omega(log n) and Omega(log(2) n) energy, respectively, w.h.p. Energy-and time-efficient broadcasting. It requires Omega(D) time to solve Broadcast even allowing unlimited energy budget, where D is the diameter of the network. The complexity measures of energy and time are in conflict, and it is an open problem whether both can be minimized simultaneously. We show that it is possible to achieve near optimality in time complexity with only poly log n energy cost. For any constant epsilon > 0, Broadcast can be solved in O(D1+c log(O(1/epsilon)) n) time with O(log(O(1/epsilon)) n) energy.

关键词： Broadcast energy-aware computing wireless network distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：