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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,077 篇 工学
- 1,050 篇 计算机科学与技术...
- 446 篇 软件工程
- 152 篇 信息与通信工程
- 142 篇 电气工程
- 79 篇 控制科学与工程
- 41 篇 网络空间安全
- 23 篇 电子科学与技术（可...
- 7 篇 建筑学
- 6 篇 动力工程及工程热...
- 6 篇 化学工程与技术
- 6 篇 农业工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 生物医学工程（可授...
306 篇 理学
- 278 篇 数学
- 72 篇 统计学（可授理学、...
- 17 篇 物理学
- 13 篇 系统科学
- 8 篇 化学
- 8 篇 生物学
68 篇 管理学
- 36 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
11 篇 经济学
- 11 篇 应用经济学
10 篇 法学
- 8 篇 社会学
10 篇 教育学
- 10 篇 教育学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

246 篇 distributed comp...
94 篇 distributed algo...
80 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
22 篇 fault tolerance
22 篇 algorithms
20 篇 local model
20 篇 distributed grap...
18 篇 shared memory
17 篇 cloud computing
16 篇 message passing
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
25 篇 technion haifa
16 篇 univ freiburg fr...
15 篇 mit cambridge ma...
12 篇 tel aviv univ te...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 carnegie mellon ...
9 篇 technion dept co...
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

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

语言

1,369 篇 英文
12 篇 其他
1 篇 中文

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

共 1382 条记录，以下是121-130 订阅

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

详细简洁

排序：

Quantum Communication Advantage for Leader Election and Agreement 25

Quantum Communication Advantage for Leader Election and Agre...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Fabien Dufoulon Frédéric Magniez Gopal Pandurangan School of Computing and Communications Lancaster University Lancaster United Kingdom Université Paris Cité CNRS IRIF Paris France Department of Computer Science University of Houston Houston Texas USA

ISBN: (纸本)9798400718854

This work focuses on understanding the quantum message complexity of two central problems in distributed computing, namely, leader election and agreement in synchronous message-passing communication networks. We show that quantum communication gives an advantage for both problems by presenting quantum distributed algorithms that significantly outperform their respective classical counterparts under various network *** prior works have studied and analyzed quantum distributed algorithms in the context of (improving) round complexity, a key conceptual contribution of our work is positing a framework to design and analyze the message complexity of quantum distributed algorithms. We present and demonstrate how quantum algorithmic techniques, such as Grover search, quantum counting, and quantum walks, can significantly enhance the message efficiency of distributed *** particular, our leader election protocol for diameter-2 networks uses quantum walks to achieve the improved message complexity. To the best of our knowledge, this is the first such application of quantum walks in distributed computing.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

Fast distributed Vertex Splitting with Applications 36

Fast Distributed Vertex Splitting with Applications

引用

36th International symposium on distributed computing, DISC 2022

作者： Halldórsson, Magnús M. Maus, Yannic Nolin, Alexandre Reykjavik University Iceland TU Graz Austria CISPA Saarbrücken Germany

ISBN: (纸本)9783959772556

We present poly log log n-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into k parts such that a node of degree d(u) has ≈ d(u)/k neighbors in each part. Our techniques can be seen as the first progress towards general poly log log n-round algorithms for the Lovász Local Lemma. As the main application of our result, we obtain a randomized poly log log n-round CONGEST algorithm for (1 + Ε)∆-edge coloring n-node graphs of sufficiently large constant maximum degree ∆, for any Ε > 0. Further, our results improve the computation of defective colorings and certain tight list coloring problems. All the results improve the state-of-the-art round complexity exponentially, even in the LOCAL model. © Magnús M. Halldórsson, Yannic Maus, and Alexandre Nolin.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Stream Processing with Dependency-Guided Synchronization 22

Stream Processing with Dependency-Guided Synchronization

引用

27th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Kallas, Konstantinos Niksic, Filip Stanford, Caleb Alur, Rajeev Univ Pennsylvania Philadelphia PA USA

ISBN: (纸本)9781450392044

Real-time data processing applications with low latency requirements have led to the increasing popularity of stream processing systems. While such systems offer convenient APIs that can be used to achieve data parallelism automatically, they offer limited support for computations that require synchronization between parallel nodes. In this paper, we propose dependency-guided synchronization (DGS), an alternative programming model for stateful streaming computations with complex synchronization requirements. In the proposed model, the input is viewed as partially ordered, and the program consists of a set of parallelization constructs which are applied to decompose the partial order and process events independently. Our programming model maps to an execution model called synchronization plans which supports synchronization between parallel nodes. Our evaluation shows that APIs offered by two widely used systems-Flink and Timely Dataflow-cannot suitably expose parallelism in some representative applications. In contrast, DGS enables implementations with scalable performance, the resulting synchronization plans offer throughput improvements when implemented manually in existing systems, and the programming overhead is small compared to writing sequential code.

关键词： data parallelism sharding synchronization distributed stream processing

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds on the State Complexity of Population Protocols 21

Lower Bounds on the State Complexity of Population Protocols

引用

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

作者： Czerner, Philipp Esparza, Javier Tech Univ Munich Munich Germany

ISBN: (纸本)9781450385480

Population protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol that computes it. Previous work by Blondin et al. has shown that the counting predicates x >= eta have state complexity O(log eta) for leaderless protocols and O(log log eta) for protocols with leaders. We obtain the first non-trivial lower bounds: the state complexity of x >= eta is Omega(log log log eta) for leaderless protocols, and the inverse of a non-elementary function for protocols with leaders.

关键词： distributed computing population protocols state complexity

来源：评论

学校读者我要写书评

暂无评论

PROV-IO: An I/O-Centric Provenance Framework for Scientific Data on HPC Systems 22

PROV-IO: An I/O-Centric Provenance Framework for Scientific ...

引用

31st International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Han, Runzhou Byna, Suren Tang, Houjun Dong, Bin Zheng, Mai Iowa State Univ Ames IA 50011 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781450391993

Data provenance, or data lineage, describes the life cycle of data. In scientific workflows on HPC systems, scientists often seek diverse provenance (e.g., origins of data products, usage patterns of datasets). Unfortunately, existing provenance solutions cannot address the challenges due to their incompatible provenance models and/or system implementations. In this paper, we analyze three representative scientific workflows in collaboration with the domain scientists to identify concrete provenance needs. Based on the first-hand analysis, we propose a provenance framework called PROV-IO, which includes an I/O-centric provenance model for describing scientific data and the associated I/O operations and environments precisely. Moreover, we build a prototype of PROV-IO to enable end-to-end provenance support on real HPC systems with little manual effort. The PROV-IO framework provides flexibility in selecting various classes of provenance. Our experiments with realistic workflows show that PROV-IO can address the provenance needs of the domain scientists effectively with reasonable performance (e.g., less than 3.5% tracking overhead for most experiments). Moreover, PROV-IO outperforms a state-of-the-art system (i.e., ProvLake) in our experiments.

关键词： Data Provenance Lineage Scientific Data Workflows High Performance computing FAIR principles Explainability Trustworthiness

来源：评论

学校读者我要写书评

暂无评论

On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures 36

On Implementing SWMR Registers from SWSR Registers in System...

引用

36th International symposium on distributed computing, DISC 2022

作者： Hu, Xing Toueg, Sam Department of Computer Science University of Toronto Canada

ISBN: (纸本)9783959772556

The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport's pioneering work [14], this problem has been extensively studied in the context of asynchronous processes with crash failures. In this paper, we investigate this problem in the context of Byzantine process failures, with and without process signatures. In particular, we first show a strong impossibility result, namely, that there is no wait-free linearizable implementation of a 1-writer n-reader register from atomic 1-writer (n - 1)-reader registers. In fact, this impossibility result holds even if all the processes except the writer are given atomic 1-writer n-reader registers, and even if we assume that the writer can only crash and at most one reader is subject to Byzantine failures. In light of this impossibility result, we give two register implementations. The first one implements a 1-writer n-reader register from atomic 1-writer 1-reader registers. This implementation is linearizable (under any combination of Byzantine process failures), but it is wait-free only under the assumption that the writer is correct or no reader is Byzantine - thus matching the impossibility result. The second implementation assumes process signatures;it is wait-free and linearizable under any number and combination of Byzantine process failures. © Xing Hu and Sam Toueg.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

On Interplanetary and Relativistic distributed computing 25

On Interplanetary and Relativistic Distributed Computing

引用

proceedings of the acm symposium on principles of distributed computing

作者： Siddhartha Visveswara Jayanti Department of Computer Science Dartmouth College Hanover New Hampshire USA

ISBN: (纸本)9798400718854

Interplanetary distributed systems, such as the Interplanetary Internet, and the Global Positioning System (GPS) are subject to the effects of Einstein's theory of relativity. In this paper, we study relativistic distributed systems, which are subject to the relativity of simultaneity. We formulate a unified computational model for relativistic and classical distributed systems and study the relationship between properties of distributed algorithms deployed on the two types of systems. Classical executions are totally ordered in time, whereas the steps of a relativistic execution are only partially ordered by the relation of relativistic causality. We relate these two physics-dependent execution types through a third—purely mathematical—notion of a computational execution, which partially orders steps by the relation of computational causality. We relate relativistic, classical, and computational executions of distributed algorithms through a central theorem, which states that the following are equivalent for any distributed algorithm A: (1) A satisfies a property P classically; (2) every relativistic execution of A satisfies P in the reference frame of every observer; and (3) every total ordering of every computational execution of A satisfies P. As a direct consequence, we prove the equivalence of the standard, relativistic, and computational formulations of linearizability. Our results show that a host of algorithms originally designed for classical distributed systems will behave consistently when deployed in relativistic, interplanetary distributed systems.

关键词： relativistic distributed computing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Graph Algorithms with Predictions 25

Brief Announcement: Distributed Graph Algorithms with Predic...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Joan Boyar Faith Ellen Kim S. Larsen Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark Department of Computer Science University of Toronto Toronto Ontario Canada

ISBN: (纸本)9798400718854

We initiate the study of distributed graph algorithms with predictions in synchronous message passing systems. Each node in the graph is given a prediction, which is some extra information about the problem instance that may be incorrect. The better the prediction, the fewer rounds the algorithm should perform. We present a framework for evaluating distributed graph algorithms with predictions and some methods for transforming existing algorithms without predictions to effectively use predictions. Our approach is illustrated using the Maximal Independent Set problem.

关键词： algorithms with predictions

来源：评论

学校读者我要写书评

暂无评论

distributed Construction of Lightweight Spanners for Unit Ball Graphs 36

Distributed Construction of Lightweight Spanners for Unit Ba...

引用

36th International symposium on distributed computing, DISC 2022

作者： Eppstein, David Khodabandeh, Hadi Department of Computer Science University of California IrvineCA United States

ISBN: (纸本)9783959772556

Resolving an open question from 2006 [14], we prove the existence of light-weight bounded-degree spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log∗ n)-round distributed algorithm in the LOCAL model of computation, that given a unit ball graph G with n vertices and a positive constant ϵ ∗ n) rounds in the LOCAL model, but has a O(log ∆) bound on its lightness, where ∆ is the ratio of the length of the longest edge to the length of the shortest edge in the unit ball graph. Next, we adjust our algorithm to work in the CONGEST model, without changing its round complexity, hence proposing the first spanner construction for unit ball graphs in the CONGEST model of computation. We further study the problem in the two dimensional Euclidean plane and we provide a construction with similar properties that has a constant average number of edge intersections per node. Lastly, we provide experimental results that confirm our theoretical bounds, and show an efficient performance from our distributed algorithm compared to the best known centralized construction. © David Eppstein and Hadi Khodabandeh.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Stochastic Coordination in Heterogeneous Load Balancing Systems 21

Stochastic Coordination in Heterogeneous Load Balancing Syst...

引用

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

作者： Goren, Guy Vargaftik, Shay Moses, Yoram Technion Haifa Israel VMware Res Herzliyya Israel

ISBN: (纸本)9781450385480

Current-day data centers and high-volume cloud services employ a broad set of heterogeneous servers. In such settings, client requests typically arrive at multiple entry points, and dispatching them to servers is an urgent distributed systems problem. This paper presents an efficient solution to the load balancing problem in such systems that improves on and overcomes problems of previous solutions. The load balancing problem is formulated as a stochastic optimization problem, and an efficient algorithmic solution is obtained based on a subtle mathematical analysis of the problem. Finally, extensive evaluation of the solution on simulated data shows that it outperforms previous solutions. Moreover, the resulting dispatching policy can be computed very efficiently, making the solution practically viable.

关键词： distributed load balancing Heterogeneous load balancing Stochastically coordinated dispatching Parallel server model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：