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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

351 篇 会议
11 篇 期刊文献

馆藏范围

362 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

332 篇 工学
- 329 篇 计算机科学与技术...
- 81 篇 电气工程
- 64 篇 软件工程
- 51 篇 信息与通信工程
- 19 篇 控制科学与工程
- 16 篇 网络空间安全
- 3 篇 机械工程
- 3 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 建筑学
- 2 篇 化学工程与技术
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
71 篇 理学
- 62 篇 数学
- 11 篇 统计学（可授理学、...
- 6 篇 物理学
- 3 篇 大气科学
- 3 篇 系统科学
- 2 篇 化学
- 1 篇 生物学
10 篇 管理学
- 6 篇 管理科学与工程(可...
- 4 篇 工商管理
- 4 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 农学
1 篇 医学

主题

48 篇 distributed algo...
40 篇 distributed comp...
26 篇 distributed comp...
17 篇 distributed algo...
14 篇 consensus
11 篇 approximation al...
11 篇 congest model
10 篇 fault tolerance
10 篇 algorithms
9 篇 coloring
9 篇 distributed grap...
9 篇 shared memory
8 篇 message passing
8 篇 local model
8 篇 self-stabilizati...
8 篇 randomized algor...
7 篇 distributed syst...
7 篇 leader election
7 篇 communication co...
7 篇 lower bounds

机构

10 篇 swiss fed inst t...
9 篇 ben gurion univ ...
9 篇 univ freiburg fr...
7 篇 technion haifa
6 篇 technion dept co...
6 篇 tel aviv univ te...
5 篇 mit cambridge ma...
5 篇 carnegie mellon ...
5 篇 univ new mexico ...
5 篇 aalto univ espoo
4 篇 princeton univ p...
4 篇 ben gurion univ ...
4 篇 eth comp engn & ...
3 篇 weizmann inst sc...
3 篇 georgetown univ ...
3 篇 univ michigan an...
3 篇 computer enginee...
3 篇 univ iowa dept c...
3 篇 cnrs
3 篇 technion israel ...

作者

12 篇 kuhn fabian
12 篇 elkin michael
10 篇 pandurangan gopa...
9 篇 korman amos
8 篇 ghaffari mohsen
8 篇 patt-shamir boaz
8 篇 wattenhofer roge...
8 篇 censor-hillel ke...
6 篇 awerbuch baruch
6 篇 raynal michel
6 篇 toueg sam
6 篇 suomela jukka
6 篇 haeupler bernhar...
6 篇 barenboim leonid
6 篇 fraigniaud pierr...
5 篇 balliu alkida
5 篇 vaidya nitin h.
5 篇 maus yannic
5 篇 olivetti dennis
5 篇 guerraoui rachid

语言

360 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing"

共 362 条记录，以下是71-80 订阅

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

详细简洁

排序：

Passing Messages while Sharing Memory 18

Passing Messages while Sharing Memory

引用

37th acm sigact-sigops symposium on principles of distributed computing (PODC)

作者： Aguilera, Marcos K. Ben-David, Naama Calciu, Irina Guerraoui, Rachid Petrank, Erez Toueg, Sam VMware Res Bengaluru India CMU Pittsburgh PA USA Ecole Polytech Fed Lausanne Lausanne Switzerland Technion Haifa Israel Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450357951

We introduce a new distributed computing model called m&m that allows processes to both pass messages and share memory. Motivated by recent hardware trends, we find that this model improves the power of the pure message-passing and shared-memory models. As we demonstrate by example with two fundamental problems-consensus and eventual leader election-the added power leads to new algorithms that are more robust against failures and asynchrony. Our consensus algorithm combines the superior scalability of message passing with the higher fault tolerance of shared memory, while our leader election algorithms reduce the system synchrony needed for correctness. these results point to a wide new space for future exploration of other problems, techniques, and benefits.

关键词： leader election consensus message passing expander graphs shared memory partial synchrony distributed computing models

来源：评论

学校读者我要写书评

暂无评论

distributed deterministic edge coloring using bounded neighborhood independence 11

Distributed deterministic edge coloring using bounded neighb...

引用

30th Annual acm sigact-sigops symposium on principles of distributed computing (PODC)

作者： Barenboim, Leonid Elkin, Michael Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel

ISBN: (纸本)9781450307192

We study the edge-coloring problem in the message-passing model of distributed computing. this is one of the most fundamental problems in this area. Currently, the best-known deterministic algorithms for (2 Delta -1)-edge-coloring requires O(Delta) + log* n time (Panconesi and Rizzi in Distrib Comput 14(2):97-100, 2001), where Delta is the maximum degree of the input graph. Also, recent results of Barenboim and Elkin (2010) for vertex-coloring imply that one can get an O(Delta)-edge-coloring in time, and an -edge-coloring in O(log Delta log n) time, for an arbitrarily small constant . In this paper we devise a significantly faster deterministic edge-coloring algorithm. Specifically, our algorithm computes an O(Delta)-edge-coloring in time, and an -edge-coloring in O(log Delta) + log* n time. this result improves the state-of-the-art running time for deterministic edge-coloring with this number of colors in almost the entire range of maximum degree Delta. Moreover, it improves it exponentially in a wide range of Delta, specifically, for 2 (Omega(log*n)) a parts per thousand currency sign Delta a parts per thousand currency sign polylog(n). In addition, for small values of Delta (up to log(1 - delta) n, for some fixed delta > 0) our deterministic algorithm outperforms all the existing randomized algorithms for this problem. Also, our algorithm is the first O(Delta)-edge-coloring algorithm that has running time o(Delta) + log* n, for the entire range of Delta. All previous (deterministic and randomized) O(Delta)-edge-coloring algorithms require time. On our way to these results we study the vertex-coloring problem on graphs with bounded neighborhood independence. this is a large family of graphs, which strictly includes line graphs of r-hypergraphs (i.e., hypergraphs in which each hyperedge contains r or less vertices) for r = O(1), and graphs of bounded growth. We devise a very fast deterministic algorithm for vertex-coloring graphs with bounded neighborhood independe

关键词： Defective-coloring Legal-coloring Line-graphs

来源：评论

学校读者我要写书评

暂无评论

Relays: Towards a link layer for robust and secure fog computing 37

Relays: Towards a link layer for robust and secure fog compu...

引用

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

作者： Scheideler, Christian Paderborn University Paderborn Germany

In my presentation I will propose a new link-layer model for distributed computing based on so-called relays that promises to be useful for the design of robust and secure distributed systems based on overlay networks... 详细信息

ISBN: (纸本)9781450357760

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

A Complexity Separation Between the Cache-Coherent and distributed Shared Memory Models 11

A Complexity Separation Between the Cache-Coherent and Distr...

引用

30th Annual acm sigact-sigops symposium on principles of distributed computing (PODC)

作者： Golab, Wojciech Hewlett Packard Labs Palo Alto CA 94304 USA

ISBN: (纸本)9781450307192

We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitates costly memory accesses called remote memory references (RMRs), which generate communication on the interconnect joining processors and main memory. In this paper we compare two popular shared memory architecture models, namely the cache-coherent (CC) and distributed shared memory (DSM) models, in terms of their power for solving synchronization problems efficiently with respect to RMRs. the particular problem we consider entails one process sending a "signal" to a subset of other processes. We show that a variant of this problem can be solved very efficiently with respect to RMRs in the CC model, but not so in the DSM model, even when we consider amortized RMR complexity. To our knowledge, this is the first separation in terms of amortized RMR complexity between the CC and DSM models. It is also the first separation in terms of RMR complexity (for asynchronous systems) that does not rely in any way on wait-freedom-the requirement that a process makes progress in a bounded number of its own steps.

关键词： Shared memory models remote memory references complexity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: A Platform for Experimenting with Mobile Algorithms in a Laboratory

Brief Announcement: A Platform for Experimenting with Mobile...

引用

28th Annual acm symposium on principles of distributed computing

作者： Killijian, Marc-Olivier Roy, Matthieu LAAS CNRS F-31077 Toulouse France

ISBN: (纸本)9781605583969

In this work, we present a platform for testing algorithms on mobile systems. We advocate that the interest of the platform lies in many aspects: it shows that simulators are not accurate, especially with regards to wireless communication and delays assumptions. Such a platform can be used to refine simulators assumptions. Moreover, to the best of our knowledge, our platform is the first attempt to implement mobility patterns, that permit to test multiple distributed algorithms in the same movement configuration, allowing for reproducible experiments. Last, but not least, we want to open our platform to test other distributed and mobile algorithms, with the hope that it will open new problems and pose new challenges.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Algorithms for Dynamic Coverage in Sensor Networks

Brief Announcement: Distributed Algorithms for Dynamic Cover...

引用

16th Annual acm symposium on principles of distributed computing

作者： Lin, Lan Lee, Hyunyoung Univ Denver Dept Comp Sci Denver CO 80208 USA

ISBN: (纸本)9781595936165

the coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks may affect qualities of sensor coverage. We present three suites of algorithms for dynamically maintaining the coverage and the measures of its qualities. Using only local knowledge, our algorithms capture the dynamic changes of network topology and efficiently maintain the coverage by updating the radii of sensors combined with limited sensor mobility. Our algorithms have the advantages of low communication complexity with no need of a tight bound on message propagation delay.

关键词： distributed algorithms sensor networks sensor coverage

来源：评论

学校读者我要写书评

暂无评论

distributed Uniformity Testing 18

Distributed Uniformity Testing

引用

37th acm sigact-sigops symposium on principles of distributed computing (PODC)

作者： Fischer, Orr Meir, Uri Oshman, Rotem Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450357951

In the uniformity testing problem, we are given access to samples from some unknown distribution it on a fixed domain {1,.., n}, and our goal is to distinguish the case where is the uniform distribution from the case where is c-far from uniform in L1 distance. Centralized uniformity testing has been extensively studied, and it is known that O( //c2) samples are necessary and sufficient. In this paper we study distributed uniformity testing: in a network of k nodes, each node i has access to si samples from the underlying distribution it. Our goal is to test uniformity, while minimizing the number of samples per node, as well as the running time. We consider several distributed models: the LOCAL model, the CONGEST model, and a 0-round model where nodes cannot communicate with each other at all. We give upper bounds for each model, and a lower bound for the 0-round model. the key to our results is analyzing the centralized uniformity-testing problem in an unusual error regime, for which we give new upper and lower bounds.

关键词： unusual error regime communication complexity property testing distributed uniformity testing

来源：评论

学校读者我要写书评

暂无评论

On Tradeoff Between Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication Tolerating Mixed Adversary

On Tradeoff Between Network Connectivity, Phase Complexity a...

引用

27th Annual acm symposium on principles of distributed computing

作者： Ashwinkumar, B., V Patra, Arpita Choudhary, Ashish Srinathan, Kannan Rangan, C. Pandu Indian Inst Technol Dept Comp Sci & Engn Madras Tamil Nadu India Ctr Secur IIIT Theory & Algorithm Res Hyderabad Andhra Pradesh India

ISBN: (纸本)9781595939890

In this paper, we study the inherent tradeoff between the network connectivity, phase complexity and communication complexity of perfectly reliable message transmission (PRMT) problem in undirected synchronous, network, tolerating a mixed adversary A(t(b), t(f)), who has unbounded computing power and can corrupt t(b) and t(f) nodes in the network in Byzantine and fail-stop fashion respectively.

关键词： Unbounded computing Power

来源：评论

学校读者我要写书评

暂无评论

A Brief Tutorial on distributed and Concurrent Machine Learning 18

A Brief Tutorial on Distributed and Concurrent Machine Learn...

引用

37th acm sigact-sigops symposium on principles of distributed computing (PODC)

作者： Alistarh, Dan IST Austria Klosterneuburg Austria

ISBN: (纸本)9781450357951

the area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning. the goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other. the tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures. the tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. the presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. the tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.

关键词： Machine Learning distributed Systems Shared Memory Message Passing Stochastic Gradient Descent

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：