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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,315 篇 会议
152 篇 期刊文献
6 册 图书

馆藏范围

4,472 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,285 篇 工学
- 3,132 篇 计算机科学与技术...
- 1,644 篇 软件工程
- 413 篇 信息与通信工程
- 373 篇 电气工程
- 227 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 35 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 65 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 170 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
62 篇 computer network...
61 篇 concurrent compu...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
50 篇 algorithms
49 篇 application soft...
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
42 篇 edge computing

机构

48 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
12 篇 univ toronto on
12 篇 georgia inst tec...
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,425 篇 英文
44 篇 其他
4 篇 中文

检索条件"任意字段=Proceedings of the ACM Symposium on Principles of Distributed Computing"

共 4473 条记录，以下是321-330 订阅

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

详细简洁

排序：

A Full-System Perspective on UPMEM Performance 1

A Full-System Perspective on UPMEM Performance

引用

1st Workshop on Disruptive Memory Systems (DIMES) Part of 29th acm symposium on Operating Systems principles (SOSP)

作者： Friesel, Birte Dreimann, Marcel Lutke Spinczyk, Olaf Univ Osnabruck Osnabruck Germany

ISBN: (纸本)9798400703003

Recently, UPMEM has introduced the first commercially available processing in memory (PIM) platform. Its key feature are DRAM memory chips with built-in RISC CPUs for in-memory data processing. Naturally, this has sparked interest in the research community, which previously was limited to PIM simulators and custom FPGA prototypes. One result of this is the PrIM benchmark suite that combines an indepth analysis of PIM performance with benchmarks that measure the speedup of PIM over processing on conventional CPUs and GPUs [10]. However, the current generation of UPMEM PIM faces limitations such as memory interleaving, and as such does not provide true in-memory computing. Applications must store data in DRAM and transfer it to/from UPMEM modules for processing, which behave just like computational offloading engines from this perspective. This paper examines the ramifications of treating them as such in comparative performance benchmarks. By extending the PrIM suite to address the challenges that computational offloading benchmarks face, we show that such a full-system perspective can drastically alter offloading recommendations, with 9 of 11 previously UPMEM-friendly benchmarks now performing best on a conventional server CPU.

关键词： Benchmarks Near-Memory computing Processing in Memory Computational Offloading

来源：评论

学校读者我要写书评

暂无评论

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors 25

Local Constant Approximation for Dominating Set on Graphs Ex...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Marthe Bonamy Cyril Gavoille Timothe Picavet Alexandra Wesolek LaBRI University of Bordeaux CNRS Bordeaux France LaBRI University of Bordeaux Bordeaux France Technische Universität Berlin Berlin Germany

ISBN: (纸本)9798400718854

We show that graphs excluding K2,t as a minor admit a f(t)-round 50-approximation deterministic distributed algorithm for Minimum Dominating Set. The result extends to Minimum Vertex Cover. Though fast and approximate distributed algorithms for such problems were already known for H-minor-free graphs, all of them have an approximation ratio depending on the size of H. To the best of our knowledge, this is the first example of a large non-trivial excluded minor leading to fast and constant-approximation distributed algorithms, where the ratio is independent of the size of H. A new key ingredient in the analysis of these distributed algorithms is the use of asymptotic dimension.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Quantum Inner Product Estimation 2022

Distributed Quantum Inner Product Estimation

引用

54th Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Anshu, Anurag Landau, Zeph Liu, Yunchao Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA Univ Calif Berkeley Dept EECS Berkeley CA USA

ISBN: (纸本)9781450392648

As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have.. copies of unknown states rho,sigma (acting on C-d) respectively. Their goal is to estimate Tr(rho sigma) up to additive error epsilon is an element of ( 0, 1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k = O(max{1/epsilon(2), root d/epsilon}) copies suffice. This achieves a savings compared to full tomography which takes Omega (d(3)) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Omega (max{1/epsilon(2), root d/epsilon}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.

关键词： Quantum property testing Cross-platform verification Shadow tomography Symmetric subspace

来源：评论

学校读者我要写书评

暂无评论

Snapgram: Matrix Multiplications Made Fun 56

Snapgram: Matrix Multiplications Made Fun

引用

56th Annual SIGCSE Technical symposium on Computer Science Education, SIGCSE TS 2025

作者： Porquet-Lupine, Joël Department of Computer Science University of California Davis Davis CA United States

ISBN: (纸本)9798400705328

This paper presents Snapgram, an innovative assignment for teaching matrix multiplications in the context of a Parallel computing course. Designed for fourth-year undergraduate at the University of California, Davis, this assignment transforms the typically mundane task of matrix multiplication into an engaging exercise by framing it as a simple recommender system for a fictional social media application. Students implement two key operations: multiplying a matrix by itself and selecting the highest values in each row of the resulting matrix. These operations are adaptable to various parallel programming paradigms, including shared-memory (pthreads, OpenMP), distributed-memory (MPI), and GPU programming (CUDA). By contextualizing matrix multiplications within a practical, relatable scenario, Snapgram significantly enhances student engagement and learning outcomes. Instructors are typically encouraged to provide scaffolding code for I/O operations, allowing students to focus on implementing the core algorithms. This paper discusses the motivation behind the creation of Snapgram, provides a detailed description of the assignment, analyzes its strengths and weaknesses, and presents student feedback. Our findings suggest that Snapgram successfully bridges the gap between theoretical concepts and practical applications in parallel computing education, leading to improved student satisfaction compared to traditional matrix multiplication assignments. The assignment material can be found at https://***/lupteach/shared/snapgram. © 2025 Copyright held by the owner/author(s).

关键词： assessment parallel computing undergraduate education

来源：评论

学校读者我要写书评

暂无评论

Lamellar: A Rust-based Asynchronous Tasking and PGAS Runtime for High Performance computing

Lamellar: A Rust-based Asynchronous Tasking and PGAS Runtime...

引用

2024 Workshops of the International Conference for High Performance computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Friese, Ryan D. Gioiosa, Roberto Cottam, Joseph Multu, Erdal Roek, Gregory Thomadakis, Polykarpos Raugas, Mark Pacific Northwest National Laboratory RichlandWA United States

ISBN: (纸本)9798350355543

The discussion around "safe"programming languages has significantly increased in recent years, and is impacting how governments, industry, and academia plan to develop current and future software products. The White House Office of the National Cyber Director released a report [1] in February 2024 calling on the technical community to work towards proactively reducing attack surfaces in cyberspace, in part, specifically by adopting memory safe programming languages. While the main discourse thus far has been focused on cybersecurity, memory safety issues are also a concern in HPC, where memory related errors can result in wasted execution time, incorrect results, etc. Legacy programming languages in HPC such as C and C++ provide freedom and flexibility with memory management, but requires the developer to guarantee safety. While it is possible to develop "un-safe"code in all programming languages, "memory-safe"languages help guarantee safety by utilizing various compile time and runtime checks and validation systemsIn this paper we introduce Lamellar, an asynchronous tasking and PGAS runtime system for HPC written in Rust, one such "memory-safe"language. We describe the entire Lamellar stack, from network interfaces to safe high-level abstractions such as distributed LamellarArrays and Active Messages. The goal of our runtime is to enable end-users to develop entirely safe Rust code in their applications, limiting the use of any "unsafe"code blocks to rigorously tested code blocks within the runtime itself. We conclude by showing comparable performance against several C, C++, and Chapel implementations of a subset of the BALE kernel suite while maintaining strong memory safety principles. © 2024 IEEE.

关键词： Asynchronous distributed computing HPC PGAS Runtime Rust Programming Language

来源：评论

学校读者我要写书评

暂无评论

Incremental Checkpointing of Large State Simulation Models with Write-Intensive Events via Memory Update Correlation on Buddy Pages 27

Incremental Checkpointing of Large State Simulation Models w...

引用

27th IEEE/acm International symposium on distributed Simulation and Real Time Applications, DS-RT 2023

作者： Marotta, Romolo Montesano, Federica Pellegrini, Alessandro Quaglia, Francesco Tor Vergata University of Rome Dicii Italy Centro Nazionale di Ricerca in High Performance Computing Big Data e Quantum Computing Italy

ISBN: (纸本)9798350337846

Checkpointing techniques for speculative parallel simulation of discrete event models have been widely studied in the literature. However, there has been a very marginal attempt to exploit operating system page-protection services, which have instead been largely exploited in the context of checkpointing for fault tolerance. In this article, we discuss how these services can effectively manage simulation models with large states and write-intensive events in zones of the state layout. In particular, we present a solution where the correlation of write operations on buddy pages in the state layout can be exploited to achieve effective incremental checkpointing support, which allows scaling down the costs of operating system services. Our solution does not require any instrumentation of the simulation application code and is usable on any Posix-compliant operating system. We also discuss its integration within the USE (Ultimate-Share-Everything) open-source speculative simulation package and report some experimental data for its assessment. © 2023 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Climate Science, Data Science and distributed computing to Build Teen Students' Positive Perceptions of CS 2022

Climate Science, Data Science and Distributed Computing to B...

引用

53rd Annual acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Grover, Shuchi Oster, Jessica Ledeczi, Akos Broll, Brian Deweese, Menton Looking Glass Ventures Austin TX 78703 USA Vanderbilt Univ Earth & Environm Sci Nashville TN USA Vanderbilt Univ Nashville TN USA Vanderbilt Univ Sch Sci & Math Nashville TN USA

ISBN: (纸本)9781450390705

Providing learners with authentic interdisciplinary experiences is one strategy to foster positive perceptions of CS as a discipline that supports a breadth of applications. We designed a high school mini course using climate science as an interdisciplinary context, since it is of interest to today's youth and provides opportunities to engage with authentic applications of computing that leverage real data to examine issues. The course was designed to engage students in climate change, data visualization, distributed computing, and motivate the use of advanced data abstractions and practices. We used NetsBlox, an extension of Snap! that makes real datasets & Web services accessible through easy-to-use blocks. A paleoclimatologist led climate science discussions and research questions with students. Post-survey responses to questions probing insights students gained shed light on the positive impact on students' perceptions of CS through this interdisciplinary experience, and how it expanded their horizons for future STEM inquiry using data and computing. We share curricular details for use in high schools and takeaways to help promote rich programming experiences that improve students' perceptions of computing.

关键词： perceptions of computing data science interdisciplinary learning climate change k-12 computer science

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Sparse Allreduce for distributed Deep Learning 22

Near-Optimal Sparse Allreduce for Distributed Deep Learning

引用

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

作者： Li, Shigang Hoefler, Torsten Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781450392044

Communication overhead is one of the major obstacles to train large deep learning models at scale. Gradient sparsification is a promising technique to reduce the communication volume. However, it is very challenging to obtain real performance improvement because of (1) the difficulty of achieving an scalable and efficient sparse allreduce algorithm and (2) the sparsification overhead. This paper proposes Ok-Topk, a scheme for distributed training with sparse gradients. Ok-Topk integrates a novel sparse allreduce algorithm (less than 6k communication volume which is asymptotically optimal) with the decentralized parallel Stochastic Gradient Descent (SGD) optimizer, and its convergence is proved. To reduce the sparsification overhead, Ok-Topk efficiently selects the top-k gradient values according to an estimated threshold. Evaluations are conducted on the Piz Daint supercomputer with neural network models from different deep learning domains. Empirical results show that Ok-Topk achieves similar model accuracy to dense allreduce. Compared with the optimized dense and the state-of-the-art sparse allreduces, Ok-Topk is more scalable and significantly improves training throughput (e.g., 3.29x-12.95x improvement for BERT on 256 GPUs).

关键词： distributed deep learning allreduce gradient sparsification data parallelism

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed Replacement Paths 25

Optimal Distributed Replacement Paths

引用

proceedings of the acm symposium on principles of distributed computing

作者： Yi-Jun Chang Yanyu Chen Dipan Dey Gopinath Mishra Hung Thuan Nguyen Bryce Sanchez National University of Singapore Singapore Singapore Tata Institute of Fundamental Research Mumbai India

ISBN: (纸本)9798400718854

We study the replacement paths problem in the CONGEST model of distributed computing. Given an s-t shortest path P, the goal is to compute, for every edge e in P, the shortest-path distance from s to t avoiding e. For unweighted directed graphs, we establish the tight randomized round complexity bound for this problem as [EQUATION] by showing matching upper and lower bounds. Our upper bound extends to (1 + ϵ)-approximation for weighted directed graphs. Our lower bound applies even to the second simple shortest path problem, which asks only for the smallest replacement path length. These results improve upon the very recent work of Manoharan and Ramachandran (SIROCCO 2024), who showed a lower bound of [EQUATION] and an upper bound of [EQUATION], where hst is the number of hops in the given s-t shortest path P.

关键词： CONGEST

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: What's Live? Understanding distributed Consensus 21

Brief Announcement: What's Live? Understanding Distributed C...

引用

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

作者： Chand, Saksham Liu, Yanhong A. SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Apple Inc Cupertino CA 95014 USA

ISBN: (纸本)9781450385480

distributed consensus algorithms such as Paxos have been studied extensively. Many different liveness properties and assumptions have been stated for them, but there are no systematic comparisons for better understanding of these properties. This paper systematically studies and compares different liveness properties stated for over 30 prominent consensus algorithms and variants. We introduced a precise high-level language and formally specified these properties in the language. We then create a hierarchy of liveness properties combining two hierarchies of the assumptions used and a hierarchy of the assertions made, and compare the strengths and weaknesses of algorithms that ensure these properties. Our formal specifications and systematic comparisons led to the discovery of a range of problems in various stated liveness properties. We also developed TLA+ specifications of these liveness properties, and we used model checking of execution steps to illustrate liveness patterns for Paxos.

关键词： distributed consensus liveness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：