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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,982 篇 电气工程
- 1,383 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 535 篇 控制科学与工程
- 228 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 61 篇 安全科学与工程
1,973 篇 理学
- 1,505 篇 数学
- 245 篇 物理学
- 203 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,463 篇 管理学
- 1,205 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

检索条件"任意字段=IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 16627 条记录，以下是351-360 订阅

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

详细简洁

排序：

On the parallel Reconstruction from Pooled Data 36

On the Parallel Reconstruction from Pooled Data

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Gebhard, Oliver Hahn-Klimroth, Max Kaaser, Dominik Loick, Philipp TU Dortmund Univ Dortmund Germany Univ Hamburg Hamburg Germany Goethe Univ Frankfurt Frankfurt Germany

ISBN: (纸本)9781665481069

In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal sigma is an element of {0, 1}(n), we can query multiple entries at once and get the total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore focus on the setting where all queries are executed in parallel. For the regime where the signal is sparse such that ||s||(1) = o(n) our results are twofold: First, we propose and analyze a simple and efficient greedy reconstruction algorithm. Secondly, we derive a sharp information-theoretic threshold for the minimum number of queries required to reconstruct s with high probability. Our first result matches the performance guarantees of much more involved constructions (Karimi et al. 2019). Our second result extends a result of Alaoui et al. (2014) and Scarlett & Cevher (2017) who studied the pooled data problem for dense signals. Finally, our theoretical findings are complemented with empirical simulations. Our data not only confirm the information-theoretic thresholds but also hint at the practical applicability of our pooling scheme and the simple greedy reconstruction algorithm.

关键词： Reconstruction Sparse Signal Pooled Data Information Theory Phase Transitions

来源：评论

学校读者我要写书评

暂无评论

A Near-Memory Radix Sort Accelerator with parallel 1-bit Sorter 30

A Near-Memory Radix Sort Accelerator with Parallel 1-bit Sor...

引用

ieee 30th international symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Cho, Jihwan Maulana, Dalta Imam Jung, Wanyeong Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9781665483322

Sorting is one of the most fundamental operations for many applications. For efficient sorting, data locality can be exploited by processing subdivided data in parallel. This work presents a high-performance and area-efficient near-memory radix sort accelerator where end-to-end sorting is performed locally. With a parallel 1-bit radix sorter, it achieves high throughput by processing multiple keys per cycle. Tested with Xilinx Zynq UltraScale+ ZCU104 FPGA, the experimental result shows up to 10x performance speedup over CPU. It is highly area-efficient and can be integrated into each processing node of a distributed computing system with low area cost.

关键词： Costs Throughput distributed computing Field programmable gate arrays Sorting

来源：评论

学校读者我要写书评

暂无评论

parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection 36

Parallel Minimum Spanning Tree Algorithms via Lattice Linear...

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Alves, David R. Garg, Vijay K. Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

ISBN: (纸本)9781665497473

We show that the problem of computing the minimum spanning tree can be formulated as special case of detecting Lattice Linear Predicate (LLP). In general, formulating problems as LLP presents two main advantages: 1) Different problems are formulated under a single, general framework, which defines the problem in terms of simple local predicates that must hold for the all the elements of a lattice, making the problem (and the solution) compact and easy to understand. 2) improvements on one set of problems can be transferable to other sets of problems;3) since the problems are stated as a set of local predicates, which can be often tested with little or no synchronization it is often the case that new opportunities for parallelism present themselves. In this paper we introduce two parallel algorithms LLP-Prim and LLP-Boruvka that improve on the non-LLP counterparts in several ways. LLP-Prim reduces the number of heap operations required by Prim by allowing edges to be selected without entering the heap thus allowing for parallelism. LLP-Boruvka improves on Boruvka by reducing synchronization and thus once more improving parallelism opportunities. Our experimental evaluation shows that LLP-Prim is faster than Prim's algorithm in both single threaded and multithreaded scenarios and that it provides a good tradeoff between parallelism and efficiency at low core counts. For higher core count scenarios we show how LLP-Boruvka improves on an efficient implementation of a parallel version of Boruvka.

关键词： Minimum Spanning Tree parallel Algorithms

来源：评论

学校读者我要写书评

暂无评论

A Preliminary Study on Performance Modeling at Scale for Geophysical applications 33

A Preliminary Study on Performance Modeling at Scale for Geo...

引用

33rd Euromicro international Conference on parallel, distributed, and Network-Based processing, PDP 2025

作者： Dupros, Fabrice Jubertie, Sylvain Aochi, Hideo Intel Corporation Paris France Brgm Orléans France

ISBN: (纸本)9798331524937

Modeling the performance of real-world applications at scale is essential for designing next-generation platforms and shaping the development of future algorithms. However, accurately capturing the complexity of application execution graphs and their interaction with large-scale hardware environments remains a significant challenge. In recent years, several frameworks have been developed to tackle this issue by providing tools to simulate and analyze complex workloads on distributed systems. This paper focuses on seismic wave propagation problems as a representative use case to explore the challenges of modeling at scale. We employ the SimGrid simulation toolkit, a versatile framework for simulating distributed systems, to analyze the performance of large-scale applications. Particular emphasis is placed on the role of critical networking characteristics, such as bandwidth and topology, in influencing overall scalability and performance. © 2025 ieee.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Large Scale Reverse-time Migration Imaging Computation based on distributed Spark Cluster with GPUs 21

Efficient Large Scale Reverse-time Migration Imaging Computa...

引用

21st ieee international symposium on parallel and distributed processing with applications, 13th ieee international Conference on Big Data and Cloud Computing, 16th ieee international Conference on Social Computing and Networking and 13th international Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Wangzhang, Suhui Yang, Ruizhang Gu, Rong Li, Bo Liu, Dingjin Wang, Zhaokang Nanjing University State Key Laboratory for Novel Software Technology China Sinopec Geophysical Research Institute China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China

ISBN: (纸本)9798350329223

The reverse-time migration (RTM) imaging algorithm, which is used for complex underground structure analysis, is known as one of the current mainstream method of high-precision seismic imaging. Nowadays, as the fast development of seismic data acquisition technology, there exists large amount of seismic data. Thus, the requirement for the efficient computation of the reverse-time migration (RTM) imaging algorithms over large-scale data have been increased greatly. To address this problem, in this paper, we propose a distributed reverse-time migration imaging algorithm based on the widely-used Spark platform first. Based on that, we design and implement a RTM computation solution based on Spark and GPU with several optimizations, including pre-shuffle&caching and load balancing. We also analyze the fault tolerance capability of the proposed distributed algorithm. We evaluate the proposed methods on the typical three-dimensional wavefild benchmark dataset. Experimental results show that the performance of the Spark based reverse-time migration imaging algorithm can scale up near linearly with computing nodes. In addition, the GPU+Spark based version has significant performance improvement on execution efficiency over the Spark-based algorithm. Moreover, the proposed optimization strategies also take effect. In addition, the method proposed in this paper has been applied in the real-world environment of one of the top oil exploration companies world wide, and has achieved significant improvement under the premise of the algorithm correctness guarantee. © 2023 ieee.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

CuGraph C++ primitives: Vertex/edge-centric building blocks for parallel graph computing

CuGraph C++ primitives: Vertex/edge-centric building blocks ...

引用

2023 ieee international parallel and distributed processing symposium Workshops, IPDPSW 2023

作者： Kang, Seunghwa Hastings, Chuck Eaton, Joe Rees, Brad NVIDIA United States

ISBN: (纸本)9798350311990

Software development of high-performance graph algorithms is difficult on modern parallel computers. To simplify this task, we have designed and implemented a collection of C++ graph primitives, basic building blocks, within cuGraph to assist graph analytics software developers on parallel computers, ranging from desktops to large clusters. This graph primitives API provides a vertex/edge-centric C++ Standard Template Library (STL)-like interface, allowing users to pick a primitive algorithm, and specify desired operations on vertices and edges and how to reduce the output of such operations through C++ functors. The API implementation is responsible for executing these functors on the underlying hardware. In this case, the graph primitives are implemented to run on NVIDIA GPU systems, from a single-GPU to multi-GPUs in a distributed cluster. RAPIDS cuGraph is NVIDIA's graph analytics solution for data scientists and software integrators. Algorithms in cuGraph are either implemented using the cuGraph C++ primitives API or being migrated over to using the primitives API. The Louvain and PageRank algorithms have been tested on clusters with over 1000 GPUs. © 2023 ieee.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Why Globally Re-shuffle? Revisiting Data Shuffling in Large Scale Deep Learning 36

Why Globally Re-shuffle? Revisiting Data Shuffling in Large ...

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Nguyen, Truong Thao Trahay, Francois Domke, Jens Drozd, Aleksandr Vatai, Emil Liao, Jianwei Wahib, Mohamed Gerofi, Balazs Natl Inst Adv Ind Sci & Technol Tokyo Japan Inst Polytech Paris Telecom SudParis Paris France RIKEN Ctr Computat Sci Tokyo Japan Southwest Univ China Coll Comp & Informat Sci Chongqing Peoples R China Tokyo Inst Technol Tokyo Japan Amigawa GK Tokyo Japan

ISBN: (纸本)9781665481069

Stochastic gradient descent (SGD) is the most prevalent algorithm for training Deep Neural Networks (DNN). SGD iterates the input data set in each training epoch processing data samples in a random access fashion. Because this puts enormous pressure on the I/O subsystem, the most common approach to distributed SGD in HPC environments is to replicate the entire dataset to node local SSDs. However, due to rapidly growing data set sizes this approach has become increasingly infeasible. Surprisingly, the questions of why and to what extent random access is required have not received a lot of attention in the literature from an empirical standpoint. In this paper, we revisit data shuffling in DL workloads to investigate the viability of partitioning the dataset among workers and performing only a partial distributed exchange of samples in each training epoch. Through extensive experiments on up to 2,048 GPUs of ABCI and 4,096 compute nodes of Fugaku, we demonstrate that in practice validation accuracy of global shuffling can be maintained when carefully tuning the partial distributed exchange. We provide a solution implemented in PyTorch that enables users to control the proposed data exchange scheme.

关键词： Training Deep learning distributed processing Costs Neural networks distributed databases Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Data Access for Map Services based on R-star tree index and LSM tree 28

Spatiotemporal Data Access for Map Services based on R-star ...

引用

28th ieee international Conference on Intelligent Engineering Systems (INES)

作者： Gatial, Emil Balogh, Zoltan Dolatabadi, Sepideh Hassankhani Slovak Acad Sci Inst Informat Dept Parallel & Distributed Comp Bratislava Slovakia Slovak Acad Sci Inst Informat Dept Modelling & Control Discrete Proc Bratislava Slovakia

ISBN: (纸本)9798350367607;9798350367591

The paper proposed an approach to building a scalable service for spatiotemporal data storage to be used in applications that require searching for localized data and possibility of scaling up the storage resources. The motivation for proposing this approach was enabling the localized data being overlayed over the map, while transferring only required data and minimize the latency time. The paper describes the architecture combining the R-star tree index and Log Structured Merge (LSM) tree methods. The implementation framework based on Erlang OTP is proposed to provide a basis for sustainability and resiliency.

关键词： Spatiotemporal database R-star tree LSM tree map services

来源：评论

学校读者我要写书评

暂无评论

HPC master design: experience from Pisa 33

HPC master design: experience from Pisa

引用

33rd Euromicro international Conference on parallel, distributed, and Network-Based processing, PDP 2025

作者： Danelutto, Marco Univ. of Pisa Dept. of Computer Science Italy

ISBN: (纸本)9798331524937

HPC is a widely used term, often referred to the applications, architectures and programming models and tools targeting highly parallel machines such as those of the *** lists. Recent advances in computing hardware resources require application of HPC techniques when using much smaller machines. Indeed, proper parallel programming tools and applications are needed also to exploit parallel hardware resources in personal computers (laptops, desktops, servers). This paper outlines key challenges in designing master's degree programs in HPC and shares lessons learned from various experiences in developing and implementing such programs in Italy and Europe. © 2025 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

HTS: A Threaded Multilevel Sparse Hybrid Solver 36

HTS: A Threaded Multilevel Sparse Hybrid Solver

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Booth, Joshua Dennis Univ Alabama Huntsville AL 35899 USA

ISBN: (纸本)9781665481069

Large shared-memory many-core nodes have become the norm in scientific computing, and therefore the sparse linear solver stack must adapt to the multilevel structure that exists on these nodes. One adaption is the development of hybrid-solvers at the node level. We present HTS as a hybrid threaded solver that aims to provide a finer-grain algorithm to keep an increased number of threads actively working on these larger shared-memory environments without the overheads of message passing implementations. Additionally, HTS aims at utilizing the additional shared memory that may be available to improve performance, i.e., reducing iteration counts when used as a preconditioner and speeding up calculations. HTS is built around the Schur complement framework that many other hybrid solver packages already use. However, HTS uses a multilevel structure in dealing with the Schur complement and allows for fill-in in certain off-diagonal submatrices to allow for a faster and more accurate solve phase. These modifications allow for a tasking thread library, namely Cilk, to be used to speed up performance while still reducing peak memory by more than 20% on average compared to an optimized direct factorization method. We show that HTS can outperform the MPI-based hybrid solver ShyLU on a suite of sparse matrices by as much as 2x, and show that HTS can scale well on three-dimensional finite difference problems.

关键词： Linear algebra parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：