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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

740 篇 会议
41 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

607 篇 工学
- 593 篇 计算机科学与技术...
- 344 篇 软件工程
- 93 篇 信息与通信工程
- 67 篇 控制科学与工程
- 64 篇 电气工程
- 40 篇 网络空间安全
- 12 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 化学工程与技术
- 3 篇 光学工程
- 3 篇 材料科学与工程（可...
- 3 篇 农业工程
- 2 篇 建筑学
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
234 篇 理学
- 218 篇 数学
- 61 篇 统计学（可授理学、...
- 12 篇 物理学
- 6 篇 系统科学
- 4 篇 化学
- 3 篇 大气科学
- 3 篇 生物学
48 篇 管理学
- 28 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 18 篇 工商管理
10 篇 经济学
- 10 篇 应用经济学
4 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

224 篇 distributed comp...
35 篇 distributed algo...
26 篇 distributed comp...
25 篇 computer systems...
17 篇 algorithms
15 篇 consensus
15 篇 distributed syst...
14 篇 fault tolerance
12 篇 distributed algo...
11 篇 computer network...
10 篇 message passing
10 篇 approximation al...
9 篇 self-stabilizati...
9 篇 shared memory
8 篇 cloud computing
8 篇 randomized algor...
6 篇 parallel algorit...
6 篇 computation theo...
6 篇 coloring
6 篇 sensor networks

机构

7 篇 ben gurion univ ...
5 篇 technion
5 篇 department of co...
4 篇 technion haifa
4 篇 college of compu...
4 篇 department of co...
4 篇 eth comp engn & ...
4 篇 yale univ dept c...
3 篇 univ of californ...
3 篇 univ of toronto ...
3 篇 computer enginee...
3 篇 cispa helmholtz ...
3 篇 yale university
3 篇 university of fr...
3 篇 technion israel ...
3 篇 hebrew univ jeru...
3 篇 mit cambridge ma...
3 篇 irisa rennes
3 篇 eth zurich
3 篇 cnrs university ...

作者

13 篇 kuhn fabian
13 篇 awerbuch baruch
13 篇 raynal michel
12 篇 peleg david
12 篇 kutten shay
11 篇 toueg sam
11 篇 patt-shamir boaz
11 篇 wattenhofer roge...
10 篇 guerraoui rachid
10 篇 gafni eli
10 篇 dolev danny
9 篇 elkin michael
9 篇 rajsbaum sergio
9 篇 attiya hagit
8 篇 khandekar rohit
8 篇 pandurangan gopa...
8 篇 aspnes james
8 篇 fraigniaud pierr...
7 篇 korman amos
7 篇 herlihy maurice

语言

774 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"

共 781 条记录，以下是11-20 订阅

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

详细简洁

排序：

computing Minimum Weight Cycle in the CONGEST Model 24

Computing Minimum Weight Cycle in the CONGEST Model

引用

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

作者： Manoharan, Vignesh Ramachandran, Vijaya The University of Texas at Austin AustinTX United States

ISBN: (纸本)9798400706684

Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in a graph G = (V, E). This is a fundamental graph problem with classical sequential algorithms that run in Õ(n3) and Õ(mn) time† where n = |V| and m = |E|. In recent years this problem has received significant attention in the context of fine-grained sequential complexity [3, 50] as well as in the design of faster sequential approximation algorithms [13, 26, 32, 33], though not much is known in the distributed CONGEST *** present near-optimal ω(n) CONGEST lower bounds on the round complexity of computing exact and (2 - ϵ)-approximate MWC in undirected weighted graphs and in directed graphs even if unweighted. We complement these lower bounds with sublinear-round algorithms for computing 2-approximation of MWC. Our algorithms use a variety of techniques in non-trivial ways, such as in our approximate directed unweighted MWC algorithm that efficiently computes BFS from all vertices restricted to certain implicitly computed neighborhoods in sublinear rounds, and in our weighted approximation algorithms that use unweighted MWC algorithms on scaled graphs combined with a fast and streamlined method for computing multiple source approximate SSSP. © 2024 Association for computing Machinery. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

COMPSO: Optimizing Gradient Compression for distributed Training with Second-Order Optimizers 25

COMPSO: Optimizing Gradient Compression for Distributed Trai...

引用

30th symposium on principles and Practice of Parallel Programming

作者： Sun, Baixi Liu, Weijin Pauloski, J. Gregory Tian, Jiannan Jia, Jinda Wang, Daoce Zhang, Boyuan Zheng, Mingkai Di, Sheng Jin, Sian Zhang, Zhao Yu, Xiaodong Iskra, Kamil A. Beckman, Pete Tan, Guangming Tao, Dingwen Indiana Univ Bloomington IN USA Stevens Inst Technol Hoboken NJ USA Univ Chicago Chicago IL USA Rutgers State Univ New Brunswick NJ USA Argonne Natl Lab Lemont IL USA Temple Univ Philadelphia PA USA Northwestern Univ Evanston IL USA Univ Chinese Acad Sci Beijing Peoples R China

ISBN: (纸本)9798400714436

Second-order optimization methods have been developed to enhance convergence and generalization in deep neural network (DNN) training compared to first-order methods like Stochastic Gradient Descent (SGD). However, these methods face challenges in distributed settings due to high communication overhead. Gradient compression, a technique commonly used to accelerate communication for first-order approaches, often results in low communication reduction ratios, decreased model accuracy, and/or high compression overhead when applied to second-order methods. To address these limitations, we introduce a novel gradient compression method for second-order optimizers called COMPSO. This method effectively reduces communication costs while preserving the advantages of second-order optimization. COMPSO employs stochastic rounding to maintain accuracy and filters out minor gradients to improve compression ratios. Additionally, we develop GPU optimizations to minimize compression overhead and performance modeling to ensure end-to-end performance gains across various systems. Evaluation of COMPSO on different DNN models shows that it achieves a compression ratio of 22.1x, reduces communication time by 14.2x, and improves overall performance by 1.9x, all without any drop in model accuracy.

关键词： Deep learning distributed training second-order optimization K-FAC data compression

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PODC 2023 - proceedings of the 2023 acm symposium on principles of distributed computing

PODC 2023 - Proceedings of the 2023 ACM Symposium on Princip...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2023

ISBN: (纸本)9798400701214

The proceedings contain 44 papers. The topics discussed include: a near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states;fast convergence of k-opinion undecided state dynamics in the population protocol model;brief announcement: efficient collaborative tree exploration with breadth-first depth-next;brief announcement: population protocols decide double-exponential thresholds;the complexity of distributed approximation of packing and covering integer linear programs;efficient distributed decomposition and routing algorithms in minor-free networks and their applications;brief announcement: distributed construction of near-optimal compact routing schemes for planar graphs;brief announcement: the Laplacian paradigm in deterministic congested clique;asynchronous wait-free runtime verification and enforcement of linearizability;and asynchronous wait-free runtime verification and enforcement of linearizability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

POSTER: Pattern-Aware Sparse Communication for Scalable Recommendation Model Training 24

POSTER: Pattern-Aware Sparse Communication for Scalable Reco...

引用

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

作者： He, Jiaao Chen, Shengqi Zhai, Jidong Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9798400704352

Recommendation models are an important category of deep learning models whose size is growing enormous. They consist of a sparse part with TBs of memory footprint and a dense part that demands PFLOPs of computing capability to train. Unfortunately, the high sparse communication cost to re-organize data for different parallel strategies of the two parts impedes the scalability in training. Based on observations of sparse access patterns, we design a two-fold fine-grained parallel strategy to accelerate sparse communication. A performance model is built to select an optimal set of items that are replicated across all GPUs so that all-to-all communication volume is reduced, while keeping memory consumption acceptable. The all-to-all overhead is further reduced by parallel scheduling techniques. In our evaluation on 32 GPUs over real-world datasets, 2.16- 16.8x end-to-end speedup is achieved over the baselines.

关键词： distributed Deep Learning Parallelism

来源：评论

学校读者我要写书评

暂无评论

On the Power of Quantum distributed Proofs 24

On the Power of Quantum Distributed Proofs

引用

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

作者： Hasegawa, Atsuya Kundu, Srijita Nishimura, Harumichi The University of Tokyo Japan The Institute for Quantum Computing University of Waterloo Canada Nagoya University Japan

ISBN: (纸本)9798400706684

Quantum nondeterministic distributed computing was recently introduced as dQMA (distributed quantum Merlin-Arthur) protocols by Fraigniaud, Le Gall, Nishimura and Paz (ITCS 2021). In dQMA protocols, with the help of quantum proofs and local communication, nodes on a network verify some global property of the network. Fraigniaud et al. showed that, when the network size is small, there exists an exponential separation in proof size between distributed classical and quantum verification protocols, for the equality problem, where the verifiers check if all the data owned by a subset of them are identical. In this paper, we further investigate and characterize the power of the dQMA protocols for various decision ***, we give a more efficient dQMA protocol for the equality problem with a simpler analysis. This is done by adding a symmetrization step on each node and exploiting properties of the permutation test, which is a generalization of the SWAP test. We also show a quantum advantage for the equality problem on path networks still persists even when the network size is large, by considering "relay points"between extreme ***, we show that even in a general network, there exist efficient dQMA protocols for the ranking verification problem, the Hamming distance problem, and more problems that derive from efficient quantum one-way communication protocols. third, in a line network, we construct an efficient dQMA protocol for any problem that has an efficient two-party QMA communication ***, we obtain the first lower bounds on the proof and communication cost of dQMA protocols. To prove a lower bound on the equality problem, we show any dQMA protocol with an entangled proof between nodes can be simulated with a dQMA protocol with a separable proof between nodes by using a QMA communication-complete problem introduced by Raz and Shpilka (CCC 2004). © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Model Checking on Graphs of Bounded Treedepth 24

Brief Announcement: Distributed Model Checking on Graphs of ...

引用

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

作者： Fomin, Fedor V. Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Todinca, Ioan University of Bergen Bergen Norway Université Paris Cité CNRS Paris France Universidad Adolfo Ibañez Santiago Chile Universidad de Chile Santiago Chile Université d'Orléans Insa Cvl Orléans France

ISBN: (纸本)9798400706684

We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding distributed model-checking. Various optimization problems on graphs are expressible in MSO. Examples include determining whether a graph G has a clique of size k, whether it admits a coloring with k colors, whether it contains a graph H as a subgraph or minor, or whether terminal vertices in G could be connected via vertex-disjoint paths. Our meta-theorem significantly enhances the work of Bousquet et al. [PODC 2022], which was focused on distributed certification of MSO on graphs with bounded treedepth. Moreover, our results can be extended to solving optimization and counting problems expressible in MSO, in graphs of bounded treedepth. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Content-Oblivious Leader Election on Rings 24

Brief Announcement: Content-Oblivious Leader Election on Rin...

引用

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

作者： Frei, Fabian Gelles, Ran Ghazy, Ahmed Nolin, Alexandre Cispa Helmholtz Center for Information Security Saarbrücken Germany Bar-Ilan University Ramat Gan Israel

ISBN: (纸本)9798400706684

In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, Cohen, Gelles, and Sela (distributed computing, 2023) showed how to perform arbitrary computations in a content-oblivious way in 2-edge connected networks but only if the network has a distinguished node (called root) to initiate the *** goal is to remove this assumption, which was conjectured to be necessary. Achieving this goal essentially reduces to performing a content-oblivious leader election since an elected leader can then serve as the root required to perform arbitrary content-oblivious computations. We focus on ring networks, which are the simplest 2-edge connected graphs. On oriented rings, we obtain a leader election algorithm with message complexity O(n · IDmax), where IDmax is the maximal assigned ID. As it turns out, this dependency on IDmax is inherent: we show a lower bound of ω(n log(IDmax/n)) messages for content-oblivious leader election algorithms. We also extend our results to non-oriented rings, where nodes cannot tell which channel leads to which neighbor. In this case, however, the algorithm does not terminate but only reaches quiescence. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：