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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,074 篇 工学
- 1,045 篇 计算机科学与技术...
- 459 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 76 篇 控制科学与工程
- 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...
88 篇 distributed algo...
79 篇 distributed comp...
31 篇 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
19 篇 message passing
18 篇 distributed grap...
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 ...
7 篇 ben gurion univ ...
6 篇 cispa helmholtz ...
6 篇 national univers...
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

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,356 篇 英文
6 篇 其他
1 篇 中文

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

共 1363 条记录，以下是21-30 订阅

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

详细简洁

排序：

Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model 24

Brief Announcement: Understanding Read-Write Wait-Free Cover...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Losa, Giuliano Gafni, Eli Stellar Development Foundation San FranciscoCA United States University of California Los Angeles Los AngelesCA United States

ISBN: (纸本)9798400706684

In the fully-anonymous (shared-memory) model, inspired by a biological setting, processors have no identifiers and memory locations are anonymous, meaning there is no pre-existing agreement among processors on any naming of the memory locations. In this work, we ask fundamental questions about the fully-anonymous model in the hope to obtain a better understanding of the role of naming and anonymity in distributed ***, we ask what it means to solve a task under processor anonymity. With tasks such as renaming, the traditional notion obviously does not apply. Instead of restricting ourselves to colorless tasks, we propose using the notion of group solvability, which allows transferring any task to processor-anonymous ***, the difficulty with anonymity is that processors can hardly avoid covering and then overwriting each other's writes, erasing information written by their predecessors. To get to the bottom of this phenomenon, we ask what system configurations are stable when processors keep reading and writing ad infinitum. Resolving this question leads us to a wait-free solution to the snapshot task, which then allows us to solve renaming and obstruction-free consensus. © 2024 Association for computing Machinery. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: What CanWe Compute in a Single Round of the Congested Clique? 23

Brief Announcement: What CanWe Compute in a Single Round of ...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Robinson, Peter Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA

ISBN: (纸本)9798400701214

We show that any one-round algorithm that computes a minimum spanning tree (MST) in the unicast congested clique must use a link bandwidth of Omega( log(3) n) bits in the worst case. Consequently, computing an MST under the standard assumption of O (log n)-size messages requires at least 2 rounds. This is the first round complexity lower bound in the unicast congested clique for a problem where the output size is small, i.e., O (n log n) bits. Our lower bound holds as long as every edge of the MST is output by an incident node. To the best of our knowledge, all prior lower bounds for the unicast congested clique either considered problems with large output sizes (e.g., subgraph enumeration) or required every node to learn the entire output.

关键词： Congested clique distributed graph algorithm lower bound

来源：评论

学校读者我要写书评

暂无评论

A Near-Optimal Low-Energy Deterministic distributed SSSP with Ramifications on Congestion and APSP 24

A Near-Optimal Low-Energy Deterministic Distributed SSSP wit...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Ghaffari, Mohsen Trygub, Anton Mit CambridgeMA United States

ISBN: (纸本)9798400706684

We present a low-energy deterministic distributed algorithm that computes exact Single-Source Shortest Paths (SSSP) in near-optimal time: it runs in Õ(n) rounds and each node is awake during only poly(log n) rounds. When a node is not awake, it performs no computations or communications and spends no *** general approach we take along the way to this result can be viewed as a novel adaptation of Dijkstra's classic approach to SSSP, which makes it suitable for the distributed setting. Notice that Dijkstra's algorithm itself is not efficient in the distributed setting due to its need for repeatedly computing the minimum-distance unvisited node in the entire network. Our adapted approach has other implications, as we outline *** a step toward the above end-result, we obtain a simple deterministic algorithm for exact SSSP with near-optimal time and message complexities of Õ(n) and Õ(m), in which each edge communicates only poly(log n) messages. Therefore, one can simultaneously run n instances of it for n sources, using a simple random delay scheduling. That computes All Pairs Shortest Paths (APSP) in the near-optimal time complexity of Õ(n). This algorithm matches the complexity of the recent APSP algorithm of Bernstein and Nanongkai [STOC 2019] using a completely different method (and one that is more modular, in the sense that the SSSPs are solved independently). It also takes a step toward resolving the open problem on a deterministic Õ(n)-time APSP, as the only randomness used now is in the scheduling. © 2024 Association for computing Machinery. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Population Protocols Decide Double-exponential Thresholds 23

Brief Announcement: Population Protocols Decide Double-expon...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Czerner, Philipp Tech Univ Munich Munich Germany

ISBN: (纸本)9798400701214

Population protocols are a model of distributed computation in which finite-state agents interact randomly in pairs. A protocol decides for any initial configuration whether it satisfies a fixed property, specified as a predicate on the set of configurations. A family of protocols deciding predicates phi(n) is succinct if it uses O(|phi(n)|) states, where phi n is encoded as quantifier-free Presburger formula with coefficients in binary. (All predicates decidable by population protocols can be encoded in this manner.) While it is known that succinct protocols exist for all predicates, it is open whether protocols with O (|phi(n)|) states exist for any family of predicates phi(n). We answer this affirmatively, by constructing protocols with O( log |phi(n)|) states for some family of threshold predicates phi(n) (x) double left right arrow x >= k(n), with k1, k2,.. is an element of N. (In other words, protocols with O(n) states that decide x >= k for a k >= 2(2n)) This matches a known lower bound. Moreover, our construction is the first that is not 1-aware, making it robust against some types of errors.

关键词： distributed computing population protocols space complexity

来源：评论

学校读者我要写书评

暂无评论

Deterministic Fault-Tolerant distributed computing in Linear Time and Communication 23

Deterministic Fault-Tolerant Distributed Computing in Linear...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Chlebus, Bogdan S. Kowalski, Dariusz R. Olkowski, Jan Augusta Univ Augusta GA 30912 USA Univ Maryland Baltimore MD 21201 USA

ISBN: (纸本)9798400701214

We develop deterministic algorithms for the problems of consensus, gossiping and checkpointing with nodes prone to failing. distributed systems are modeled as synchronous complete networks. Failures are represented either as crashes or Byzantine faults with authentication. The algorithmic goal is to have both linear running time and linear amount of communication for as large an upper bound t on the number of faults as possible, with respect to the number of nodes n. For crash failures, these bounds of optimality are t = O (n/log n) for consensus and t = O (n/log(2) n) for gossiping and checkpointing. For the model of Byzantine faults with authentication, we show how to reach consensus in both linear running time and communication for t = O(root n). We show how to implement the consensus algorithm for crash failures in the single-port model such as to preserve the range of t for which both the running time and communication are optimal. We prove a lower bound Omega(l +log n) on the running time of algorithms for each of the considered problems.

关键词： crash failure Byzantine fault authentication consensus check-pointing gossiping Ramanujan graph lower bound

来源：评论

学校读者我要写书评

暂无评论

38th International symposium on distributed computing, DISC 2024

38th International Symposium on Distributed Computing, DISC ...

引用

38th International symposium on distributed computing, DISC 2024

ISBN: (纸本)9783959773522

The proceedings contain 55 papers. The topics discussed include: fully local succinct distributed arguments;a knowledge-based analysis of intersection protocols;byzantine resilient distributed computing on external data;almost optimal algorithms for token collision in anonymous networks;asynchronous fault-tolerant distributed proper coloring of graphs;hyperproperty-preserving register specifications;vertical atomic broadcast and passive replication;what cannot be implemented on weak memory?;faster cycle detection in the congested clique;efficient signature-free validated agreement;convex consensus with asynchronous fallback;a simple computability theorem for colorless tasks in submodels of the iterated immediate snapshot;and on the limits of information spread by memory-less agents.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Complexity of distributed Approximation of Packing and Covering Integer Linear Programs 23

The Complexity of Distributed Approximation of Packing and C...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Chang, Yi-Jun Li, Zeyong Natl Univ Singapore Singapore Singapore Natl Univ Singapore CQT Singapore Singapore

ISBN: (纸本)9798400701214

In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of distributed computing that succeeds with probability 1 - 1/poly(n). Specifically, we show how to compute an (is an element of,O(logn/is an element of)) low-diameter decomposition in O(log(3) (1/is an element of) log n/is an element of) rounds. Further developing our techniques, we show new distributed algorithms for approximating general packing and covering integer linear programs in the LOCAL model. For packing problems, our algorithm finds an (1 - epsilon)-approximate solution in O(log(3) (1/epsilon) logn/epsilon) rounds with probability 1 - 1/poly(n). For covering problems, our algorithm finds an ( 1+epsilon)-approximate solution in O ((log logn+log(1/epsilon))(3) logn/epsilon) rounds with probability 1 - 1/poly(n). These results improve upon the previous O (log(3) n/epsilon) -round algorithm by Ghaffari, Kuhn, and Maus [STOC 2017] which is based on network decompositions. Our algorithms are near-optimal for many fundamental combinatorial graph optimization problems in the LOCAL model, such as minimum vertex cover and minimum dominating set, as their ( 1 +/-epsilon)-approximate solutions require Omega (logn/epsilon) rounds to compute.

关键词： distributed approximation low-diameter decomposition LOCAL model

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Massively Parallel Ruling Set Made Deterministic 24

Brief Announcement: Massively Parallel Ruling Set Made Deter...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Giliberti, Jeff Parsaeian, Zahra University of Maryland United States University of Freiburg Germany

ISBN: (纸本)9798400706684

We study the deterministic complexity of the 2-Ruling Set problem in the model of Massively Parallel Computation (MPC) with linear and strongly sublinear local *** MPC: We present a constant-round deterministic algorithm for the 2-Ruling Set problem that matches the randomized round complexity recently settled by Cambus, Kuhn, Pai, and Uitto [DISC'23], and improves upon the deterministic O(log log n)-round algorithm by Pai and Pemmaraju [PODC'22]. Our main ingredient is a simpler analysis of CKPU's algorithm based solely on bounded independence, which makes its efficient derandomization *** MPC: We present a deterministic algorithm that computes a 2-Ruling Set in [EQUATION] rounds deterministically. Notably, this is the first deterministic ruling set algorithm with sublogarithmic round complexity, improving on the O(log δ+log log∗n)-round complexity that stems from the deterministic MIS algorithm of Czumaj, Davies, and Parter [TALG'21]. Our result is based on a simple and fast randomness-efficient construction that achieves the same sparsification as that of the randomized [EQUATION]-round LOCAL algorithm by Kothapalli and Pemmaraju [FSTTCS'12]. © 2024 Association for computing Machinery. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed MIS with Low Energy and Time Complexities 23

Distributed MIS with Low Energy and Time Complexities

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Ghaffari, Mohsen Portmann, Julian MIT Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9798400701214

We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy complexity substantially. These algorithms work in the standard CONGEST model of distributed message passing with O (log n) bit messages. The time complexity measures the number of rounds in the algorithm. The energy complexity measures the number of rounds each node is awake;during other rounds, the node sleeps and cannot perform any computation or communications. Our first algorithm has an energy complexity of O (log log n) and a time complexity of O ( log(2) n). Our second algorithm is faster but slightly less energy-efficient: it achieves an energy complexity of O (log(2) log n) and a time complexity of O (log n center dot log log n center dot log* n). Thus, this algorithm nearly matches the O (log n) time complexity of the state-of-the-art MIS algorithms while significantly reducing their energy complexity from O (log n) to O ( log(2) log n).

关键词： Maximal Independent Set MIS sleeping model worst-case energy complexity energy complexity awake complexity round complexity energy-efficiency distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding 23

Brief Announcement: CausalEC: A Causally Consistent Data Sto...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Cadambe, Viveck R. Lyu, Shihang Penn State Univ University Pk PA 16802 USA Google Software Engineer Mountain View CA 94043 USA

ISBN: (纸本)9798400701214

Current causally consistent data storage algorithms use partial or full replication to ensure data access to clients over a distributed setting. We develop, for the first time, an erasure coding based algorithm called CausalEC that ensures causal consistency for a collection of read-write objects stored in a distributed set of nodes over an asynchronous message passing system. CausalEC can use an arbitrary linear erasure code for data storage, and ensures liveness, fault-tolerance and storage properties prescribed by the erasure code. Unlike previous consistent erasure coding based algorithms, CausalEC is compatible with cross-object erasure coding, where nodes encode values across multiple objects. Every write operation in CausalEC is "local", that is, a server performs only local actions before returning to a client that issued a write operation. A read operation to an object can be returned by a server on contacting a small subset of other servers so long as the underlying erasure code allows for the object to be decoded from that subset.

关键词： Causal Consistency distributed Storage Erasure Coding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：