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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

116 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

91 篇 工学
- 90 篇 计算机科学与技术...
- 64 篇 软件工程
- 15 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 电气工程
- 2 篇 仪器科学与技术
- 2 篇 电子科学与技术（可...
- 2 篇 网络空间安全
- 1 篇 光学工程
- 1 篇 生物医学工程（可授...
38 篇 理学
- 36 篇 数学
- 15 篇 统计学（可授理学、...
- 4 篇 物理学
10 篇 管理学
- 7 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学

主题

40 篇 distributed comp...
8 篇 computer systems...
4 篇 distributed comp...
3 篇 distributed algo...
3 篇 randomized algor...
2 篇 computer science
2 篇 spanner
2 篇 database systems
2 篇 game-theoretic m...
2 篇 distributed algo...
2 篇 mobile agents
2 篇 algorithms
2 篇 consensus
2 篇 price of anarchy
2 篇 computer program...
2 篇 scheduling
2 篇 computer network...
2 篇 cryptography
2 篇 nash equilibrium
2 篇 sensor networks

机构

3 篇 irisa campus bea...
2 篇 irisa rennes ced...
2 篇 department of co...
2 篇 eth zurich
2 篇 mitre corporatio...
2 篇 boston college
2 篇 at&t bell lab mu...
2 篇 ibm san jose res...
1 篇 georgia institut...
1 篇 yale university ...
1 篇 university of ot...
1 篇 dept. of electri...
1 篇 sch. of elec./co...
1 篇 diag university ...
1 篇 school of comput...
1 篇 weizmann inst sc...
1 篇 university of co...
1 篇 univ of californ...
1 篇 department of ma...
1 篇 science and tech...

作者

4 篇 raynal michel
3 篇 kutten shay
2 篇 peleg david
2 篇 todinca ioan
2 篇 alex a. shvartsm...
2 篇 rogert wattenhof...
2 篇 fabian kuhn
2 篇 tixeuil sébastie...
2 篇 anon
2 篇 mohan c.
2 篇 michel raynal
2 篇 helary jean-mich...
2 篇 gafni eli
2 篇 isard michael
2 篇 lynch nancy
2 篇 dolev danny
2 篇 achour mostefaou...
2 篇 aspnes james
2 篇 fraigniaud pierr...
2 篇 nancy lynch

语言

118 篇 英文
1 篇 其他

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

共 119 条记录，以下是1-10 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of dangling pointer error for C/C++ programs 2

Efficient detection of dangling pointer error for C/C++ prog...

引用

2nd annual International Conference on Information System and Artificial Intelligence, ISAI 2017

作者： Zhang, Wenzhe Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server and Storage Technology College of Computer National University of Defense Technology Changsha China

Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory accesses unmonitored, our method could reduce the memory monitoring overhead and thus achieves better performance over previous methods. Experiments show that our method could achieve an average speed up of 9% over previous compiler instrumentation based method and more than 50% over previous page protection based method. © Published under licence by IOP Publishing Ltd.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Optimal mobile byzantine fault tolerant distributed storage: [Extended Abstract] 16

Optimal mobile byzantine fault tolerant distributed storage:...

引用

35th ACM symposium on principles of distributed computing, PODC 2016

作者： Bonomi, Silvia Del Pozzo, Antonella Potop-Butucaru, Maria Tixeuil, Sébastien DIAG University of Rome la Sapienza Rome Italy Sorbonne Universités UPMC LIP6-CNRS 7606 Paris France

ISBN: (纸本)9781450339643

We present an optimal emulation of a server based regular read/write storage in a synchronous round-free messagepassing system that is subject to mobile Byzantine failures and prove that the problem is impossible to solve in asynchronous settings. In a system with n servers implementing a regular register, our construction tolerates faults (or attacks) that can be abstracted by agents that are moved (in an arbitrary and unforeseen manner) by a computationally unbounded adversary from a server to another in order to deviate the server's computation. When a server is infected by an adversarial agent, it behaves arbitrarily until the adversary decides to "move" the agent to another server. We investigate the case where the movements of the mobile Byzantine agents are decided by the adversary and are completely decoupled from the message communication delay. Our emulation spans two awareness models: servers with and without self-diagnosis mechanism. In the first case servers are aware that the mobile Byzantine agent has left and hence they can stop running the protocol until they recover a correct state while in the second case, servers are not aware of their faulty state and continue to run the protocol using an incorrect local state. Our results, proven optimal with respect to the threshold of the tolerated mobile Byzantine faults in the first model, are significantly different from the round-based synchronous models. Another interesting side result of our study is that, contrary to the round-based synchronous consensus implementation for systems prone to mobile Byzantine faults, our storage emulation does not rely on the necessity of a core of correct processes all along the computation. That is, every server in the system can be compromised by the mobile Byzantine agents at some point in the computation. This leads to another interesting conclusion: storage is easier than consensus in synchronous settings, when the system is hit by mobile Byzantine failures. © 2016

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

No compromises: distributed transactions with consistency, availability, and performance 15

No compromises: distributed transactions with consistency, a...

引用

25th ACM symposium on Operating Systems principles (SOSP)

作者： Dragojevic, Aleksandar Narayanan, Dushyanth Nightingale, Edmund B. Renzelmann, Matthew Shamis, Alex Badam, Anirudh Castro, Miguel Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450338349

Transactions with strong consistency and high availability simplify building and reasoning about distributed systems. However, previous implementations performed poorly. This forced system designers to avoid transactions completely, to weaken consistency guarantees, or to provide single-machine transactions that require programmers to partition their data. In this paper, we show that there is no need to compromise in modern data centers. We show that a main memory distributed computing platform called FaRM can provide distributed transactions with strict serializability, high performance, durability, and high availability. FaRM achieves a peak throughput of 140 million TATP transactions per second on 90 machines with a 4.9 TB database, and it recovers from a failure in less than 50 ms. Key to achieving these results was the design of new transaction, replication, and recovery protocols from first principles to leverage commodity networks with RDMA and a new, inexpensive approach to providing non-volatile DRAM.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

distributed House-Hunting in Ant Colonies 15

Distributed House-Hunting in Ant Colonies

引用

34th annual ACM symposium on principles of distributed computing (PODC)

作者： Ghaffari, Mohsen Musco, Cameron Radeva, Tsvetomira Lynch, Nancy MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450336178

We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony's nest becomes unsuitable due to size constraints or damage, the colony relocates to a new nest. The task of identifying and evaluating the quality of potential new nests is distributed among all ants. They must additionally reach consensus on a final nest choice and transport the full colony to this single new nest. Our goal is to use tools and techniques from distributed computing theory in order to gain insight into the house-hunting process. We develop a formal model for the house-hunting problem inspired by the behavior of the Temnothorax genus of ants. We then show a Omega(log n) lower bound on the time for all n ants to agree on one of k candidate nests. We also present two algorithms that solve the house-hunting problem in our model. The first algorithm solves the problem in optimal O(log n) time but exhibits some features not characteristic of natural ant behavior. The second algorithm runs in O(k log n) time and uses an extremely simple and natural rule for each ant to decide on the new nest.

关键词： distributed algorithms randomized algorithms social insect colonies biology-inspired algorithms house-hunting Temnothorax ants

来源：评论

学校读者我要写书评

暂无评论

computing Weak Consistency in Polynomial Time

Computing Weak Consistency in Polynomial Time

引用

34th annual ACM symposium on principles of distributed computing (PODC)

作者： Golab, Wojciech Li, Xiaozhou (Steve) Lopez-Ortiz, Alejandro Nishimura, Naomi Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Google Inc Mountain View CA USA Univ Waterloo Sch Comp Sci Waterloo ON Canada

ISBN: (纸本)9781450336178

The k-atomicity property can be used to describe the consistency of data operations in large distributed storage systems. The weak consistency guarantees offered by such systems are seen as a necessary compromise in view of Brewer's CAP principle. The k-atomicity property requires that every read operation obtains a value that is at most k updates (writes) old, and becomes a useful way to quantify weak consistency if k is treated as a variable that can be computed from a history of operations. Specifically, the value of k quantifies how far the history deviates from Lamport's atomicity property for read/write registers. We address the problem of computing k indirectly by solving the k-atomicity verification problem (k-AV): given a history of read/write operations and a positive integer k, decide whether the history is k-atomic. Gibbons and Korach showed that in general this problem is NP-complete when k = 1, and hence not solvable in polynomial time unless P = NP. In this paper we present two algorithms that solve the k-AV problem for any k >= 2 in special cases. Similarly to known solutions for k = 1 and k = 2, both algorithms assume that all the values written to a given object are distinct. The first algorithm places an additional restriction on the structure of the input history and solves k-AV in O(n(2) +n center dot k log k) time. The second algorithm does not place any additional restrictions on the input but is efficient only when k is small and when concurrency among write operations is limited. Its time complexity is O(n(2)) if both k and our particular measure of write concurrency are bounded by constants.

关键词： Consistency atomicity verification distributed storage

来源：评论

学校读者我要写书评

暂无评论

Sparrow: distributed, Low Latency Scheduling 13

Sparrow: Distributed, Low Latency Scheduling

引用

24th ACM symposium on Operating Systems principles (SOSP)

作者： Ousterhout, Kay Wendell, Patrick Zaharia, Matei Stoica, Ion Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9781450323888

Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. Scheduling highly parallel jobs that complete in hundreds of milliseconds poses a major challenge for task schedulers, which will need to schedulemillions of tasks per second on appropriate machines while offering millisecond-level latency and high availability. We demonstrate that a decentralized, randomized sampling approach provides near-optimal performance while avoiding the throughput and availability limitations of a centralized design. We implement and deploy our scheduler, Sparrow, on a 110-machine cluster and demonstrate that Sparrow performs within 12% of an ideal scheduler.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: Deterministic self-stabilizing leader election with O(loglog n)-bits

Brief announcement: Deterministic self-stabilizing leader el...

引用

2013 ACM symposium on principles of distributed computing, PODC 2013

作者： Blin, Lélia Tixeuil, Sébastien Université d'Evry Val d'Essonne LIP6-CNRS UMR 7606 France UPMC Sorbonne Universités LIP6-CNRS UMR 7606 Institut Universitaire de France France

ISBN: (纸本)9781450320658

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. Leader election is a fundamental building block in distributed computing, enabling to distinguish a unique node, in order to, e.g., execute particular actions. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of ω(log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(nlog 2 n) time. Our protocol has several attractive features that make it suitable for practical purposes. First, the communication model matches the one that is expected by existing compilers for real networks. second, the size of the ring (or any upper bound for this size) needs not to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption besides a weak fair scheduler is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time, neither it does regarding minimal assumptions about the framework for our algorithm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：