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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds 23

Brief Announcement: Improved, Partially-Tight Multiplicity Q...

引用

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

作者： Anh Tran Talmage, Edward Bucknell Univ Lewisburg PA 17837 USA

ISBN: (纸本)9798400701214

A multiplicity queue is a concurrently-defined data type which relaxes the conditions of a linearizable FIFO queue by allowing concurrent Dequeue instances to return the same value. It would seem that this should allow faster message-passing implementations, as processes should not need to wait as long to learn about concurrent operations and previous work has shown that multiplicity queues are computationally less complex than the unrelaxed version. Intriguingly, recentwork has shown that there is, in fact, little possible speedup versus an unrelaxed queue. Seeking to understand this difference between intuition and real behavior, we increase the lower bound for uniform algorithms. Further, we outline a path toward building proofs for even higher lower bounds, hypothesizing that the worst-case time to Dequeue approaches maximum message delay, which is similar to the time required for an unrelaxed Dequeue We also give an upper bound for a special case to show that our bounds are tight at that point. To achieve our lower bounds, we use extended shifting arguments, which have been rarely used but allow larger lower bounds than traditional shifting arguments. We use these in series of inductive indistinguishability proofs which allow us to extend our proofs beyond the usual limitations of shifting arguments. This proof structure is an interesting contribution independently of the main result, as developing new lower bound proof techniques may have many uses in future work.

关键词： distributed Data Structures ADTs Lower Bounds Shifting Arguments Multiplicity Queues

来源：评论

学校读者我要写书评

暂无评论

System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models 24

System Optimizations for Enabling Training of Extreme Long S...

引用

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

作者： Jacobs, Sam Ade Tanaka, Masahiro Zhang, Chengming Zhang, Minjia Aminadabi, Reza Yazdani Song, Shuaiwen Leon Rajbhandari, Samyam He, Yuxiong Microsoft Inc Redmond United States

ISBN: (纸本)9798400706684

Computation in a typical Transformer-based large language model (LLM) can be characterized by batch size, hidden dimension, number of layers, and sequence length. Until now, system works for accelerating LLM training have focused on the first three dimensions: data parallelism for batch size, tensor parallelism for hidden size, and pipeline parallelism for model depth or layers. These widely studied forms of parallelism are not targeted or optimized for long sequence Transformer models. Given practical application needs for long sequence LLM, renewed attentions are being drawn to sequence parallelism. However, existing works in sequence parallelism are constrained by memory-communication inefficiency, limiting their scalability to long sequence large models. In this work, we introduce Ulysses, a novel, portable, and effective methodology for enabling highly efficient and scalable LLM training with extremely long sequence length. Ulysses at its core partitions input data along the sequence dimension and employs an efficient all-to-all collective communication for attention computation. Theoretical communication analysis shows that, whereas other methods incur communication overhead as sequence length increases, Ulysses maintains constant communication volume when sequence length and compute devices are increased proportionally. Furthermore, experimental evaluations show that Ulysses scales to more than 1 million context length and trains 2.5x faster with 4x longer sequence length than the existing method SOTA baseline. © 2024 Association for computing Machinery. All rights reserved.

关键词： AI/ML long context LLM HPC distributed training

来源：评论

学校读者我要写书评

暂无评论

The Computational Power of distributed Shared-Memory Models with Bounded-Size Registers 24

The Computational Power of Distributed Shared-Memory Models ...

引用

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

作者： Delporte-Gallet, Carole Fauconnier, Hugues Fraigniaud, Pierre Rajsbaum, Sergio Travers, Corentin IRIF University Paris Cité CNRS Paris France Irif and Instituto de Matemàticas Unam Mexico City Mexico Lis University Aix-Marseille CNRS Marseille France

ISBN: (纸本)9798400706684

The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (Jacm 1999) provided a topological characterization of the tasks that are wait-free solvable by processes communicating through writing and reading shared registers. This characterization assumes the use of full-information protocols, in which each time a process writes in the shared memory, it communicates everything it learned since the beginning of the execution. Thus, each register in the shared memory is of unbounded size. Whether unbounded size registers are unavoidable for the model of computation to be universal is the central question studied in this paper. More generally, when at most t out of n processes can crash, is the model with bounded size registers universal?We show that when 1 ≤ t 2, there exists a task that cannot be solved by n processes communicating via registers of size f(n) bits, but is solvable by n processes using unbounded registers. The case n = 2, t = 1, where 1-resilient computing and wait-free computing coincide, does not display the same behavior. We show that any task solvable by 2 processes in the wait-free shared-memory model with unbounded-size registers can be solved by 2 processes in the wait-free shared-memory model with constant size ***, we consider the iterated shared memory model, which has played a crucial role since Herlihy and Shavit's characterization. We show that 1-bit registers (per iteration) are sufficient for solving wait-free any task that is solvable by a full-information wait-free protocol. Therefore, while the wait-free read/write shared-memory model is known to be computationally equivalent to the iterated model, this equivalence only holds if registers are unbounded. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to acm.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications 23

Efficient Distributed Decomposition and Routing Algorithms i...

引用

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

作者： Chang, Yi-Jun Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9798400701214

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, where brute-force information gathering can be done efficiently. Chang and Su [PODC 2022] showed that any high-conductance network excluding a fixed minor contains a high-degree vertex upsilon(star), so the entire graph topology can be gathered to upsilon(star) efficiently in the CONGEST model using expander routing. Therefore, in networks excluding a fixed minor, many problems that can be solved efficiently in LOCAL via low-diameter decomposition can also be solved efficiently in CONGEST via expander decomposition. In this work, we show improved decomposition and routing algorithms for networks excluding a fixed minor. We define an (is an element of,D, T)-decomposition of G = (V,E) as a partition of.. into clusters of diameter at most D with at most is an element of |E| inter-cluster edges such that information gathering in each cluster can be done in T rounds in parallel. We show that an (is an element of,D, T)-decomposition with D = O (is an element of(-1)) and T = min {2(O (log2 1/is an element of)) center dot O(log Delta), poly(is an element of(-1), log Delta)} can be computed deterministically in O (is an element of(- 1) log*n) + min {2(O (log2 1/is an element of)) center dot O(log Delta), poly(is an element of(-1), log Delta)} rounds in networks excluding a fixed minor in the CONGEST model. Our algorithm has a wide range of applications, including the following results in CONGEST. center dot A (1 -is an element of)-approximate maximum independent set in a network excluding a fixed minor can be computed deterministically in O (is an element of(-1) log*n) + poly(is an element of(-1)) rounds, nearly matching the Omega(is an element of(-1) log*n) lower bound of Lenzen and Wattenhofer [DISC 2008]. center dot Property testing of any additive minor-close

关键词： distributed approximation expander decomposition property testing

来源：评论

学校读者我要写书评

暂无评论

Even-Cycle Detection in the Randomized and Quantum CONGEST Model 24

Even-Cycle Detection in the Randomized and Quantum CONGEST M...

引用

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

作者： Fraigniaud, Pierre Luce, Maël Magniez, Frederic Todinca, Ioan Université Paris Cité CNRS IRIF Paris France Université d'Orléans INSA-Centre Val de Loire LIFO Orléans France

ISBN: (纸本)9798400706684

We show that, for every k ≥ 2, C2k-freeness can be decided in O(n1 - 1/k) rounds in the CONGEST model by a randomized Monte-Carlo distributed algorithm with one-sided error probability 1/3. This matches the best round-complexities of previously known algorithms for k ϵ {2, 3, 4, 5} by Drucker et al. [PODC'14] and Censor-Hillel et al. [DISC'20], but improves the complexities of the known algorithms for k > 5 by Eden et al. [DISC'19], which were essentially of the form Õ (n1 - 2/k2). Our algorithm uses colored BFS-explorations with threshold, but with an original global approach that enables to overcome a recent impossibility result by Fraigniaud et al. [SIROCCO'23] about using colored BFS-exploration with local threshold for detecting *** also show how to quantize our algorithm for achieving a round-complexity Õ(n1/2 - 1/2k) in the quantum setting for deciding C2k freeness. Furthermore, this allows us to improve the known quantum complexities of the simpler problem of detecting cycles of length at most 2k by van Apeldoorn and de Vos [PODC'22]. Our quantization is in two steps. First, the congestion of our randomized algorithm is reduced, to the cost of reducing its success probability too. Second, the success probability is boosted using a new quantum framework derived from sequential algorithms, namely Monte-Carlo quantum amplification. © 2024 Association for computing Machinery. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations 23

Brief Announcement: Breaking the f+1 Barrier: Executing Paym...

引用

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

作者： Bazzi, Rida Tucci-Piergiovanni, Sara Arizona State Univ Tempe AZ 85287 USA Univ Paris Saclay CEA List Palaiseau France

ISBN: (纸本)9798400701214

We consider the problem of validating payment transactions in an asynchronous system in which up to f validators are subject to Byzantine failures under the control of an adaptive adversary. It was shown that this problem can be solved without consensus by using byzantine quorum systems - requiring full-quorum validation, i.e. at least 2f + 1 validations per transaction. We show that it is possible to validate transactions in parallel with less than f validations per transaction if each transaction spends no more that a small fraction of an initial balance. Our solution relies on (k(1), k(2))-quorum systems, a novel class of quorum systems that we introduce in this paper. Under an adaptive adversary, these systems can be used to allow k(1) transactions to be validated and prevent more than k(2)' > k(2) transactions from being validated, the difference k(2)' - k(2) being dependent on the quorum system's validation slack, which we define in this paper. Using (k(1), k(2))-quorum systems, a payer can execute multiple partial spending transactions to spend a portion of its initial balance with less than full quorum validation - less than f validations per transaction - then reclaim any remaining funds using one fully validated transaction, which we call a settlement transaction.

关键词： distributed Systems Blockchain Quorums Fault Tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient Bounded Timestamping from Standard Synchronization Primitives 23

Efficient Bounded Timestamping from Standard Synchronization...

引用

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

作者： Bashari, Benyamin Jamadi, Ali Woelfel, Philipp Univ Calgary Calgary AB Canada

ISBN: (纸本)9798400701214

Bounded timestamps [10, 20] allow a temporal ordering of events in executions of concurrent algorithms. They are a fundamental and well studied building block used in many shared memory algorithms. A concurrent timestamp system keeps track of.. timestamps, which is usually greater or equal to the number of processes in the system, n. A process may, at any point, obtain a new timestamp, and later determine a total order of all process's most recent timestamps. Known timestamp algorithms do not scale well in the number of processes. Getting a new timestamp takes at least a linear number of steps, and a lower bound by Israeli and Li [20] implies that each timestamp needs to be represented by at least Omega(m) bits. We introduce a slightly different semantics for timestamping, where there is no fixed timestamp value associated with an event. A process can execute operation updateTS() to update its latest timestamp, associating it with the (linearization) point of that operation, and isEarlier(p,q) to determine the temporal order of the latest updateTS() operations executed by processes p and q. Since no static timestamp value is returned by updateTS(), the lower bound of Israeli and Li does not apply. We present efficient linearizable and wait-free implementations of these methods using a single bounded fetch-and-add object and O(n(2)) bounded compare-and-swap objects, which are available on standard hardware. The step complexity of each method call is constant, and base objects need only store O (log n) bits.

关键词： timestamping shared memory concurrency distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs 38

Decentralized Distributed Graph Coloring II: Degree+1-Colori...

引用

38th International symposium on distributed computing, DISC 2024

作者： Flin, Maxime Halldórsson, Magnús M. Nolin, Alexandre Reykjavík University Iceland CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9783959773522

Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph H to be colored is locally embedded within the communication graph G. Besides generalizing classical distributed graph coloring (where H = G), this captures other previously studied settings, including cluster graphs and power graphs. We find that the complexity of coloring a virtual graph depends linearly on the edge congestion of its embedding. The main question of interest is how fast we can color virtual graphs of constant congestion. We find that, surprisingly, these graphs can be colored nearly as fast as ordinary graphs. Namely, we give a O(log4 log n)-round algorithm for the deg+1-coloring problem, where each node is assigned more colors than its degree. This can be viewed as a case where a distributed graph problem can be solved even when the operation of each node is decentralized. © Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Simpler and More General distributed Coloring Based on Simple List Defective Coloring Algorithms 24

Brief Announcement: Simpler and More General Distributed Col...

引用

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

作者： Fuchs, Marc Kuhn, Fabian University of Freiburg Germany

ISBN: (纸本)9798400706684

In this paper, we give list coloring variants of simple iterative defective coloring algorithms. Formally, in a list defective coloring instance, each node v of a graph is given a list Lv of colors and a list of allowed defects dv(x) for the colors. Each node v needs to be colored with a color x ϵ Lv such that at most dv(x) neighbors (or outneighbors) of v also pick the same color *** a defect parameter d, it is known that by making two sweeps in opposite order over the nodes of an edge-oriented graph with maximum outdegree β, one can compute a coloring with O(β2/d2) colors such that every node has at most d outneighbors of the same color. We generalize this and show that if all nodes have lists of size p2 and ĝv : ςxϵLv(dv(x) + 1) > p · β, we can make two sweeps of the nodes such that at the end, each node v has chosen a color x ϵ Lv for which at most dv(x) outneighbors of v are colored with color x. Our algorithm is simpler and computationally significantly more efficient than existing algorithms for similar list defective coloring problems. We show that the above result can in particular be used to obtain an alternative [EQUATION]-round algorithm for the (Δ+ 1)-coloring problem in the CONGEST *** neighborhood independence θ of a graph is the maximum number of pairwise non-adjacent neighbors of some node of the graph. Notable examples of graphs of bounded neighborhood independence are the line graphs of bounded-rank hypergraphs. It is well known that by doing a single sweep over the nodes of a graph of neighborhood independence θ, one can compute a d-defective coloring with O(θ · δ/d) colors. We extend this approach to the list defective coloring setting and use it to obtain a recursive (Δ+ 1)-coloring algorithm with a round complexity that is parameterized by the neighborhood independence θ. In particular, if θ = O(1), we get an (log δ)O(log log δ) + O(log∗n)-round algorithm to compute a (Δ+ 1)-coloring. The algorithm generalizes an algorithm from [Balliu

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

distributed Self-Stabilizing MIS with Few States and Weak Communication 23

Distributed Self-Stabilizing MIS with Few States and Weak Co...

引用

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

作者： Giakkoupis, George Ziccardi, Isabella Univ Rennes Inria CNRS IRISA Rennes France Bocconi Univ Milan Italy

ISBN: (纸本)9798400701214

We study a simple random process that computes a maximal independent set (MIS) on a general n-vertex graph. Each vertex has a binary state, black or white, where black indicates inclusion into the MIS. The vertex states are arbitrary initially, and are updated in parallel: In each round, every vertex whose state is "inconsistent" with its neighbors, i.e., it is black and has a black neighbor, or it is white and all neighbors are white, changes its state with probability 1/2. The process stabilizes with probability 1 on any graph, and the resulting set of black vertices is an MIS. We show that the expected stabilization time is O(log n) on certain graph families, such as cliques and graphs of bounded arboricity. Our main result is that the process stabilizes in poly(log n) rounds w.h.p. on G(n,p) random graphs, for 0 <= p <= poly(log n) . n(-1/2) or p >= 1/poly(log n). Further, we propose an extension of this process, with larger but still constant vertex state space, which stabilizes in poly(log n) rounds on G(n,p) w.h.p., for all 1 <= p <= 1. Both processes readily translate into distributed/parallel MIS algorithms, which are self-stabilizing, use constant space (and constant random bits per round), and assume restricted communication as in the beeping or the synchronous stone age models. To the best of our knowledge, no previously known MIS algorithm is self-stabilizing, uses constant space and constant randomness, and stabilizes in poly(log n) rounds on G(n,p) random graphs.

关键词： maximal independent set parallel/distributed algorithms self-stabilizing algorithms beeping model

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：