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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,938 篇 会议
406 篇 期刊文献
28 册 图书

馆藏范围

11,372 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,442 篇 工学
- 5,213 篇 计算机科学与技术...
- 2,511 篇 软件工程
- 863 篇 电气工程
- 688 篇 信息与通信工程
- 350 篇 电子科学与技术（可...
- 328 篇 控制科学与工程
- 186 篇 网络空间安全
- 58 篇 机械工程
- 56 篇 生物医学工程（可授...
- 55 篇 动力工程及工程热...
- 49 篇 生物工程
- 48 篇 建筑学
- 43 篇 仪器科学与技术
- 39 篇 光学工程
- 38 篇 土木工程
- 37 篇 测绘科学与技术
- 33 篇 力学（可授工学、理...
- 32 篇 安全科学与工程
1,324 篇 理学
- 1,122 篇 数学
- 151 篇 统计学（可授理学、...
- 106 篇 物理学
- 104 篇 系统科学
- 63 篇 生物学
- 44 篇 化学
- 38 篇 地球物理学
996 篇 管理学
- 835 篇 管理科学与工程(可...
- 304 篇 工商管理
- 196 篇 图书情报与档案管...
64 篇 经济学
- 63 篇 应用经济学
34 篇 法学
- 33 篇 社会学
24 篇 医学
21 篇 农学
9 篇 教育学
4 篇 文学
1 篇 军事学

主题

1,684 篇 parallel process...
1,192 篇 concurrent compu...
1,134 篇 distributed comp...
1,041 篇 distributed proc...
996 篇 computer science
901 篇 computer archite...
823 篇 computational mo...
751 篇 application soft...
684 篇 hardware
521 篇 parallel algorit...
497 篇 parallel program...
475 篇 runtime
462 篇 algorithm design...
441 篇 processor schedu...
433 篇 graphics process...
426 篇 parallel process...
419 篇 conferences
419 篇 scalability
395 篇 libraries
366 篇 costs

机构

33 篇 ibm thomas j. wa...
31 篇 school of comput...
27 篇 college of compu...
25 篇 oak ridge nation...
23 篇 oak ridge natl l...
22 篇 pacific northwes...
22 篇 oak ridge nation...
20 篇 argonne national...
19 篇 department of co...
18 篇 georgia inst tec...
18 篇 pacific northwes...
17 篇 department of co...
17 篇 virginia tech de...
16 篇 department of co...
16 篇 department of co...
16 篇 department of co...
15 篇 school of comput...
15 篇 sandia national ...
15 篇 georgia institut...
14 篇 department of co...

作者

38 篇 jack dongarra
29 篇 dongarra jack
24 篇 bader david a.
21 篇 nakano koji
20 篇 a. choudhary
19 篇 feng wu-chun
19 篇 p. sadayappan
18 篇 zomaya albert y.
16 篇 hoefler torsten
16 篇 schulz martin
15 篇 ito yasuaki
15 篇 s.k. das
15 篇 azad ariful
15 篇 talbi el-ghazali
14 篇 gagan agrawal
14 篇 h.j. siegel
14 篇 prasad sushil k.
14 篇 david a. bader
13 篇 s. ranka
13 篇 kishore kothapal...

语言

11,324 篇 英文
31 篇 其他
17 篇 中文

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

共 11372 条记录，以下是231-240 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Exact k-way sparse matrix partitioning 36

Exact k-way sparse matrix partitioning

引用

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

作者： Jenneskens, Engelina L. Bisseling, Rob H. Univ Utrecht Math Inst Utrecht Netherlands

ISBN: (纸本)9781665497473

To minimize the communication in parallel sparse matrix-vector multiplication while maintaining load balance, we need to partition the sparse matrix optimally into k disjoint parts, which is an NP-complete problem. We present an exact algorithm based on the branch and bound (BB) method which partitions a matrix for any k, and we explore exact sparse matrix partitioning beyond bipartitioning. The algorithm has been implemented in a software package General Matrix Partitioner (GMP). We also present an integer linear programming (ILP) model for the same problem, based on a hypergraph formulation. We used both methods to determine optimal 2,3,4-way partitionings for a subset of small matrices from the SuiteSparse Matrix Collection. For k=2, BB outperforms ILP, whereas for larger k, ILP is superior. We used the results found by these exact methods for k=4 to analyse the performance of recursive bipartitioning (RB) with exact bipartitioning. For 46 matrices of the 89 matrices in our test set of matrices with less than 250 nonzeros, the communication volume determined by RB was optimal. For the other matrices, RB is able to find 4-way partitionings with communication volume close to the optimal volume.

关键词： branch-and-bound integer linear programming exact algorithm sparse matrix-vector multiplication hypergraph parallel computing

来源：评论

学校读者我要写书评

暂无评论

PARSEC: parallel Subgraph Enumeration in CUDA 36

PARSEC: PARallel Subgraph Enumeration in CUDA

引用

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

作者： Dodeja, Vibhor Almasri, Mohammad Nagi, Rakesh Xiong, Jinjun Hwu, Wen-mei Univ Illinois C3SR Urbana IL 61801 USA Univ Buffalo Buffalo NY USA Nvidia Corp Santa Clara CA USA

ISBN: (纸本)9781665481069

Subgraph enumeration is an important problem in the field of Graph Analytics with numerous applications. The problem is provably NP-complete and requires sophisticated heuristics and highly efficient implementations to be feasible on problem sizes of realistic scales. parallel solutions have shown a lot of promise on CPUs and distributed environments. Recently, GPU-based parallel solutions have also been proposed to take advantage of the massive execution resources in modern GPUs. Subgraph enumeration involves traversing a search tree for each vertex of the data graph to find matches of a query in a graph. Most GPU-based solutions traverse the tree in breadth-first manner that exploits parallelism at the cost of high memory requirement and presents a formidable challenge for processing large graphs with high-degree vertices since the memory capacity of GPUs is significantly lower than that of CPUs. In this work, we propose a novel GPU solution based on a hybrid BFS and DFS approach where the top level(s) of the search trees are traversed in a fully parallel, breadth-first manner while each subtree is traversed in a more space-efficient, depth-first manner. The depth-first traversal of subtrees requires less memory but presents more challenges for parallel execution. To overcome the less parallel nature of depth-first traversal, we exploit fine-grained parallelism in each step of the depth-first traversal of subtrees. We further identify and implement various optimizations to efficiently utilize memory and compute resources of the GPUs. We evaluate our performance in comparison with the state-of-the-art GPU and CPU implementations. We outperform the GPU and CPU implementations with a geometric mean speedup of 9.47x (up to 92.01x) and 2.37x (up to 12.70x), respectively. We also show that the proposed approach can efficiently process the graphs that previously cannot be processed by the state-of-the-art GPU solutions due to their excessive memory requirement.

关键词： distributed processing Instruction sets Memory management Graphics processing units Process control Organizations parallel processing

来源：评论

学校读者我要写书评

暂无评论

NWHy: A Framework for Hypergraph Analytics: Representations, Data structures, and Algorithms 36

NWHy: A Framework for Hypergraph Analytics: Representations,...

引用

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

作者： Liu, Xu T. Firoz, Jesun Gebremedhin, Assefaw H. Lumsdaine, Andrew Univ Washington Seattle WA 98195 USA Pacific Northwest Natl Lab Richland WA 99352 USA Washington State Univ Pullman WA 99164 USA TileDB Inc Cambridge MA USA

ISBN: (纸本)9781665497473

This paper presents NWHypergraph, (NWHy), a parallel high-performance C++ framework for both exact and approximate hypergraph analytics. NWHy provides data structures for various representations of hypergraphs and their associated graph projections (lower order approximations), including a new technique for hypergraph representation called adjoin graphs. We present a set of hypergraph algorithms for exact and approximate hypergraph analytics implemented in NWHy and demonstrate scalability and performance, operating on a variety of hypergraph representations, that is competitive with the state of the art. In addition, we propose two new queue-based algorithms for s-line graph construction, a lower-order approximation of hypergraphs, to demonstrate the effectiveness and versatility of work queue-based algorithm design. Our queue-based algorithms demonstrate similar performance to the non-queue-based algorithms for bipartite graphs.

关键词： Hypergraph analytics hypergraph representation parallel hypergraph algorithms

来源：评论

学校读者我要写书评

暂无评论

Balancing Intra-Die and Inter-Die Placement Optimization in 2.5D FPGA Architectures

Balancing Intra-Die and Inter-Die Placement Optimization in ...

引用

1st international Conference on Smart Energy Systems and Artificial Intelligence (SESAI)

作者： Raikar, Raveena Stroobandt, Dirk Univ Ghent Ghent Belgium

ISBN: (纸本)9798350364613;9798350364606

Interposer-based 2.5D FPGAs contain multiple dies interconnected through external wires, which introduce higher delay and longer wirelength compared to the interconnection network of a single die. Efficient CAD tools are needed for such architectures to strategically manage signal counts at the die boundary. In this study, we introduce a modular approach for parallel die-level placement, eliminating the need for a time-consuming global placement optimization step. Our methodology uses netlist partitioning and adds virtual anchor blocks to enable parallel die placement and facilitate inter-partition net optimization. Our method results in a multi-die placement tool 'LiquidMD'. Comparing our base multi-die placer with a state-of-the-art tool that fully globally optimizes placement shows substantial runtime improvement with improved placement quality. We also introduce a synchronization strategy for optimizing interpartition nets and assess how minimal synchronization benefits modular parallel placement. Our research results in a modular placement algorithm that strikes a favourable balance between runtime efficiency and placement quality.

关键词： 2.5D architectures Multi-die FPGA placement parallel placement Silicon Interposer

来源：评论

学校读者我要写书评

暂无评论

A Communication-efficient Collaborative Task Offloading Method Based on distributed Computing Cloud 22

A Communication-efficient Collaborative Task Offloading Meth...

引用

22nd IEEE international symposium on parallel and distributed processing with Applications, ISPA 2024

作者： Zhang, Ke Zong, Ruixing Song, Yingjie Zhou, Yong Xiao, Xiong Hunan University Changsha China

ISBN: (纸本)9798331509712

An interconnected distributed computing cloud, comprising network-linked computational nodes, facilitates the allocation of computational resources across diverse locations. The strategic offloading of computationally demanding tasks from resource-constrained nodes to proximate nodes endowed with ample resources can enhance the resource utilization within the computing cloud. Given the interdependencies among segmented tasks, improper task partitioning may engender supplementary overheads. Furthermore, the process of task offloading introduces additional communication overhead. Consequently, the judicious division of task components and the selection of appropriate offloading destinations assume paramount significance in mitigating collaborative computing complexity and communication overhead. To address these challenges, we propose a communication-efficient collaborative task offloading methodology, which entails the segmentation and offloading of computation-intensive tasks from the source node to one or more high-performance nodes to fully leverage device resources. Additionally, we devise a subtask placement strategy predicated on minimizing communication distances, whereby multiple subtasks are allocated to distinct nodes based on the calculated communication latencies between the source node and various computing nodes. Experiments demonstrate that our task offloading method exhibits the lowest overall loss. © 2024 IEEE.

关键词： distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Towards distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs 36

Towards Distributed 2-Approximation Steiner Minimal Trees in...

引用

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

作者： Reza, Tahsin Sanders, Geoffrey Pearce, Roger Lawrence Livermore Natl Lab LLNL Ctr Appl Sci Comp CASC Livermore CA 94550 USA

ISBN: (纸本)9781665481069

Given an edge-weighted graph and a set of known seed vertices of interest, a network scientist often desires to understand the graph relationships to explain connections between the seed vertices. If the size of the seed set is 2, shortest path calculations are an attractive computational kernel to explore the connections between the two vertices. When the seed set is 3 or larger (say up to 1,000s) Steiner minimal tree - min-weight acyclic connected subgraph (of the input graph) that contains all the seed vertices - is an attractive generalization of shortest weighted paths. In general, computing a Steiner minimal tree is NP-hard, but decades ago several polynomial-time algorithms were designed and proven to yield Steiner trees whose total weight is bounded within 2 times the minimal Steiner tree. Despite its rich theoretical literature, works related to parallel Steiner minimal tree computation and their scalable implementations are rather scarce. In this paper, we present a parallel 2-approximation Steiner minimal tree algorithm (with theoretical guarantees) and its MPI-based distributed implementation. In place of distance computation between all pairs of seed vertices, an expensive phase in many approximation algorithms, the solution we employ, exploits Voronoi cell computation. Also, this approach has higher parallel efficiency than others that involve minimum spanning tree computation on the entire graph. Furthermore, our distributed design exploits asynchronous processing and a message prioritization scheme to accelerate convergence of distance computation, employs techniques to avoid inefficient distributed spanning tree computation on the entire graph, and harnesses a combination of vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance of our solution using real-world graphs with up to 128 billion edges and 512 compute nodes (8K processes), show the ability to find Steiner trees with up to 10K seed ver

关键词： Steiner trees distributed processing Scalability Approximation algorithms Computational efficiency Kernel Convergence

来源：评论

学校读者我要写书评

暂无评论

QoS-awareness of Microservices with Excessive Loads via Inter-Datacenter Scheduling 36

QoS-awareness of Microservices with Excessive Loads via Inte...

引用

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

作者： Shi, Jiuchen Wang, Jiawen Fu, Kaihua Chen, Quan Zeng, Deze Guo, Minyi Shanghai Jiao Tong Univ Shanghai Peoples R China China Univ Geosci Wuhan Peoples R China

ISBN: (纸本)9781665481069

User-facing applications often experience excessive loads and are shifting towards microservice software architecture. While the local datacenter may not have enough resources to host the excessive loads, a reasonable solution is moving some microservices of the applications to remote datacenters. However, it is nontrivial to identify the appropriate migration decision, as the microservices show different characteristics, and the local datacenter also shows different resource contention situations. We therefore propose ELIS, an inter-datacenter scheduling system that ensures the required Quality-of-Service (QoS) of the microservice application with excessive loads, while minimizing the resource usage of the remote datacenter. ELIS comprises a resource manager and a reward-based microservice migrator. The resource manager finds the near-optimal resource configurations for different microservices to minimize resource usage while ensuring QoS. The microservice migrator migrates some microservices to remote datacenters when local resources cannot afford the excessive loads. Our experimental results show that ELIS ensures the required QoS of user-facing applications at excessive loads. Meanwhile, it reduces overall/remote resource usage by 13.1% and 58.1% on average, respectively.

关键词： distributed processing Costs Software architecture Microservice architectures Quality of service Performance gain Throughput

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Estimating the Impact of Communication Schemes for distributed Graph processing 21

Estimating the Impact of Communication Schemes for Distribut...

引用

21st IEEE international symposium on parallel and distributed Computing (ISPDC)

作者： Ye, Tian Kuppannagari, Sanmukh R. De Rose, Cesar A. F. Wijeratne, Sasindu Kannan, Rajgopal Prasanna, Viktor K. Univ Southern Calif Dept Comp Sci Los Angeles CA 90007 USA Pontificia Univ Catolica Rio Grande do Sul Sch Technol Porto Alegre Brazil

ISBN: (数字)9781665488020

ISBN: (纸本)9781665488020

Extreme scale graph analytics is imperative for several real-world Big Data applications with the underlying graph structure containing millions or billions of vertices and edges. Since such huge graphs cannot fit into the memory of a single computer, distributed processing of the graph is required. Several frameworks have been developed for performing graph processing on distributed systems. The frameworks focus primarily on choosing the right computation model and the partitioning scheme under the assumption that such design choices will automatically reduce the communication overheads. For any computational model and partitioning scheme, communication schemes - the data to be communicated and the virtual interconnection network among the nodes - have significant impact on the performance. To analyze this impact, in this work, we identify widely used communication schemes and estimate their performance. Analyzing the trade-offs between the number of compute nodes and communication costs of various schemes on a distributed platform by brute force experimentation can be prohibitively expensive. Thus, our performance estimation models provide an economic way to perform the analyses given the partitions and the communication scheme as input. We validate our model on a local HPC cluster as well as the cloud hosted NSF Chameleon cluster. Using our estimates as well as the actual measurements, we compare the communication schemes and provide conditions under which one scheme should be preferred over the others.

关键词： distributed Graph processing Performance Estimation Communication Schemes Cluster Computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：