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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

On Efficient distributed Construction of Near Optimal Routing Schemes 16

On Efficient Distributed Construction of Near Optimal Routin...

引用

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

作者： Elkin, Michael Neiman, Ofer Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel

ISBN: (纸本)9781450339643

Given a distributed network represented by a weighted undirected graph G = (V, E) on n vertices, and a parameter k, we devise a distributed algorithm that computes a routing scheme in O (n(1/2+1/k) + D) . n(nu) (1) rounds, where D is the hop diameter of the network. The running time nearly matches the lower bound of (Omega) over tilde (n(1/2) + D) rounds (which holds for any scheme with polynomial stretch). The routing tables are of size (Omega) over tilde (n(1/k)), the labels are of size O(k log(2) n), and every packet is routed on a path suffering stretch at most 4k - 5+o(1). Our construction nearly matches the state-ofthe-art for routing schemes built in a centralized sequential manner. The previous best algorithms for building routing tables in a distributed small messages model were by [I,P13a, STOC 2013] and [LP15, PODC 2015]. The former has similar properties but suffers from substantially larger routing tables of size O(n(1/2+1/k)), while the latter has sub-optimal running time of (O) over tilde (min{(nD)(1/2) . n(1/k), n(2/3+2/(3k)) + D})

关键词： Routing CONGEST model

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: A Family of Leaderless Generalized-Consensus Algorithms 16

Brief Announcement: A Family of Leaderless Generalized-Conse...

引用

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

作者： Losa, Giuliano Peluso, Sebastiano Ravindran, Binoy Virginia Tech ECE Blacksburg VA 24061 USA

ISBN: (纸本)9781450339643

Leaderless consensus algorithms in the vein of EPaxos have performance advantages, especially for geo-replication, but are also very intricate, making them hard to modify and adapt for specific use cases. In this paper we show that their core principle can be captured in a generic leaderless generalized-consensus algorithm that uses two new abstractions: a dependency-set algorithm, which suggests dependencies for commands, and a map-agreement algorithm, which ensures that, for each submitted command, processes agree on a dependency set. Our generic algorithm gives rise to a family of algorithms whose members are obtained by using concrete dependency-set and map-agreement algorithms. On top of enabling modular correctness proofs of leaderless consensus algorithms, we expect that the modular structure of our generic leaderless algorithm will allow a principled theoretical and empirical evaluation of the trade-offs that can be achieved by different implementations of our two abstractions.

关键词： distributed consensus modularity paxos generalized consensus leaderless agreement

来源：评论

学校读者我要写书评

暂无评论

POSTER: distributed Control: The Benefits of Eliminating Global Synchronization via Effective Scheduling 17

POSTER: Distributed Control: The Benefits of Eliminating Glo...

引用

proceedings of the 22nd acm SIGPLAN symposium on principles and Practice of Parallel Programming

作者： Jesun Shariar Firoz Thejaka Amila Kanewala Marcin Zalewski Martina Barnas Andrew Lumsdaine Indiana University Bloomington IN USA Pacific Northwest National Laboratory Seattle WA USA

ISBN: (纸本)9781450344937

In distributed computing, parallel overheads such as \emph{synchronization overhead} may hinder performance. We introduce the idea of \emph{distributed Control} (DC) where global synchronization is reduced to \emph{termination detection} and each worker proceeds ahead optimistically, based on the local knowledge of the global computation. To avoid "wasted'' work, \DC relies on local work prioritization. However, the work order obtained by local prioritization is susceptible to interference from the runtime. We show that employing effective scheduling policies and optimizations in the runtime, in conjunction with eliminating global barriers, improves performance in two graph applications: single-source shortest paths and connected components.

关键词： graph processing distributed runtimes single- source shortest paths connected components

来源：评论

学校读者我要写书评

暂无评论

SPIRIT: A Runtime System for distributed Irregular Tree Applications 16

SPIRIT: A Runtime System for Distributed Irregular Tree Appl...

引用

21st acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Hegde, Nikhil Liu, Jianqiao Kulkarni, Milind Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450340922

Repeated, depth-first traversal of trees is a common algorithmic pattern in an important set of applications from diverse domains such as cosmological simulations, data mining, and computer graphics. As these applications operate over massive data sets, it is often necessary to distribute the trees to process all of the data. In this work, we introduce SPIRIT, a runtime system to ease the writing of distributed tree applications. SPIRIT automates the challenging tasks of tree distribution, optimizing communication and parallelizing independent computations. The common algorithmic pattern in tree traversals is exploited to effectively schedule parallel computations and improve locality. As a result, pipeline parallelism in distributed traversals is identified, which is complemented by load-balancing, and locality-enhancing, message aggregation optimizations. Evaluation of SPIRIT on tree traversal in Point Correlation ( PC) shows a scalable system, achieving speedups upto 38x on a 16-node, 64 process system compared to a 1-node, baseline configuration. We also find that SPIRIT results in substantially less communication and achieves significant performance improvements over implementations in other distributed graph systems.

关键词： Irregular programs distributed computing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Multi-Broadcasting under the SINR Model 16

Brief Announcement: Multi-Broadcasting under the SINR Model

引用

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

作者： Reddy, Sai Praneeth Vaya, Shailesh Indian Inst Technol Delhi Dept Comp Sci New Delhi India Xerox Res Ctr India Prestige Tech Pk Bangalore Karnataka India

ISBN: (纸本)9781450339643

We study the multi-broadcast problem in multi-hop wireless networks under the SINR model deployed in the 2D Euclidean plane. In multi-broadcast, there are k initial rumours, potentially belonging to different nodes , that must be forwarded to all n nodes of the network. We present deterministic algorithms for multi-broadcast for different settings that reflect the different types of knowledge about the topology of the network available to the nodes: (i) the whole network topology (ii) their own coordinates and coordinates of their neighbors (iii) only their own coordinates, and (iv) only their own ids and the ids of their neighbors. For the former two settings, we present solutions that are scalable with respect to the diameter of the network and the polylogarithm of the network size, i.e., log c n for some constant c > 0 , while the solutions for the latter two have round complexity that is superlinear in the number of nodes. The last result is of special significance, as it is the first result for the SINR model that does not require nodes to know their coordinates in the plane (a very specialized type of knowledge), but intricately exploits the understanding that nodes are implanted in the 2D Euclidean plane.

关键词： Multi-broadcasting SINR Model distributed Algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive resource management and scheduling for cloud computing 3

Adaptive resource management and scheduling for cloud comput...

引用

3rd Internatioal Workshop on Adaptive Resource Management and Scheduling for Cloud computing, ARMS-CC 2016

作者： Pop, Florin Prodan, Radu Computer Science Department University Politehnica of Bucharest Romania Institute for Computer Science University of Innsbruck Austria

来源：评论

学校读者我要写书评

暂无评论

Adding Approximate Counters 16

Adding Approximate Counters

引用

21st acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Steele, Guy L., Jr. Tristan, Jean-Baptiste Oracle Labs Burlington MA 01803 USA

ISBN: (纸本)9781450340922

We describe a general framework for adding the values of two approximate counters to produce a new approximate counter value whose expected estimated value is equal to the sum of the expected estimated values of the given approximate counters. (To the best of our knowledge, this is the first published description of any algorithm for adding two approximate counters.) We then work out implementation details for five different kinds of approximate counter and provide optimized pseudocode. For three of them, we present proofs that the variance of a counter value produced by adding two counter values in this way is bounded, and in fact is no worse, or not much worse, than the variance of the value of a single counter to which the same total number of increment operations have been applied. Addition of approximate counters is useful in massively parallel divide-and-conquer algorithms that use a distributed representation for large arrays of counters. We describe two machine-learning algorithms for topic modeling that use millions of integer counters, and confirm that replacing the integer counters with approximate counters is effective, speeding up a GPU-based implementation by over 65% and a CPU-based by nearly 50%, as well as reducing memory requirements, without degrading their statistical effectiveness.

关键词： approximate counters distributed computing divide and conquer multithreading parallel computing statistical counters

来源：评论

学校读者我要写书评

暂无评论

A Faster distributed Radio Broadcast Primitive 35

A Faster Distributed Radio Broadcast Primitive

引用

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

作者： Haeupler, Bernhard Wajc, David Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450339643

We present a faster distributed broadcasting primitive for the classical radio network model. The most basic distributed radio network broadcasting primitive - called Decay - dates back to a PODC'87 result of Bar-Yehuda, Goldreich, and Itai. In any radio network with some informed source nodes, running Decay for O(d log n + log(2) n) rounds informs all nodes at most d hops away from a source with high probability. Since 1987 this primitive has been the most important building block for implementing many other functionalities in radio networks. The only improvements to this decades-old algorithm are slight variations due to [Czumaj, Rytter;FOCS'03] and [Kowalski and Pelc, PODC'03] which achieve the same functionality in O(d log n/d + log(2) n) rounds. To obtain a speedup from this, d and thus also the network diameter need to be near linear, i.e., larger than n(1-epsilon). Our new distributed primitive spreads messages for d hops in O (dlog n log log n/log d + log(O(1)) n) rounds with high probability. log. This improves over Decay for any super-polylogarithmic d = log(omega(1)) n and achieves near-optimal 0 (d log log n) running time for d = n(epsilon). This also makes progress on an open question of Peleg.

关键词： radio networks broadcast d-hop broadcast problem decay

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Space-Time Tradeoffs for distributed Verification 16

Brief Announcement: Space-Time Tradeoffs for Distributed Ver...

引用

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

作者： Baruch, Mor Ostrovsky, Rafail Rosenbaum, Will Tel Aviv Univ Sch Elect Engn Tel Aviv Israel Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA

ISBN: (纸本)9781450339643

Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS) [12], locally checkable proofs (LCP) [10], and non-deterministic local decision (NLD) [8]. In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [11] presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex. In this paper we introduce the notion of a t-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of t-PLS between time, label size, message length, and computation space. We construct a universal t-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and t factor smaller labels. In addition, we provide a general technique to prove lower bounds for spacetime tradeoffs of t-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal t-PLS for acyclicity uses label size and computation space O((log n)/t). We further describe a recursive O(log* n) space verifier for acyclicity which does not assume previous knowledge of the run-time t.

关键词： distributed algorithms proof-labeling schemes space-time tradeoffs

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Self-Stabilizing Clock Synchronization with 3-bit Messages 16

Brief Announcement: Self-Stabilizing Clock Synchronization w...

引用

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

作者： Boczkowski, Lucas Korman, Amos Natale, Emanuele CNRS Inst Rech Informat Fondamentale F-75700 Paris France Univ Paris Diderot Paris France Univ Roma La Sapienza Dipartimento Informat Rome Italy

ISBN: (纸本)9781450339643

This paper is motivated by the aspiration to identify the weakest computational models that allow for efficient, robust distributed computation. We focus on one of the most fundamental building-blocks in distributed computing, namely, Broadcast. In this problem, a unique source agent s needs to disseminate a bit b to the rest of the population. To account for unpredictability issues that may result from uncoordinated executions, we consider a self-stabilizing setting, in which a correct configuration must be reached eventually, despite processors starting the execution with arbitrary initial states (that do not violate the requirement for the existence of a unique source). Similarly to many works on broadcast, we consider a synchronous communication model on a complete anonymous network, in which in each round, each agent can extract information from two other agents, chosen uniformly at random. Our focus is on identifying the smallest message size that is required in order to achieve fast self stabilizing broadcast. We first observe that with an extra bit added to the message-size and a small additive penalty to the running time, the self-stabilizing broadcast problem can be reduced to a self-stabilizing clock-synchronization problem, where agents aim to synchronize their clocks modulo some integer T. Our main technical contribution lies in solving the latter problem in poly-logarithmic time using only 3 bits per interaction. This allows for a self-stabilizing broadcast protocol that uses only 4 bits per interaction and converges in (O) over tilde (logn) time.

关键词： distributed consensus clock synchronization self stabilization broadcast

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：