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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

DroMPI: parallel Computation Over Drop Computing 24

DroMPI: Parallel Computation Over Drop Computing

引用

24th ieee/ACM international symposium on Cluster, Cloud, and Internet Computing (CCGrid)

作者： Grosu, George-Mircea Nistor, Silvia-Elena Ciobanu, Radu-Ioan Dobre, Ciprian Pop, Florin Natl Univ Sci & Technol Politehn Bucharest Bucharest Romania Natl Inst Res & Dev Informat ICI Bucharest Romania Acad Romanian Scientists Bucharest Romania

ISBN: (纸本)9798350377521;9798350377514

With the advancement of technology and the spread of multi-core systems, the need for parallelization arises and the interest in programming models is growing. At the same time, new distributed computing models have been proposed, being in fierce competition to obtain the highest possible performance. The Drop Computing Paradigm proposes the idea of decentralized computing over ad-hoc opportunistic networks of mobile and Edge devices. In this respect, the Drop Computing model does not only aim to achieve a minimum turnaround time but also to optimize other characteristics related to mobile devices, such as limited resources and opportunistic communication. Therefore, it is necessary to define a new programming model called DroMPI that intends to extend the capabilities of current parallel and distributed programming models, based on the Drop Computing paradigm. Therefore, the solution aims to develop a library that takes advantage of hardware capabilities in the interest of the Drop Computing paradigm and also provides programmers with a high-level programming interface. The library's features will be based on the Message Passing Interface (MPI) standard, which will be responsible for inter-node parallelization. The name of the library, DroMPI, is an acronym for Drop Computing and MPI. The implementation of the model will be responsible for the management of communication between nodes and for providing an Application Programming Interface (API) for the development of parallel applications in the Drop Computing paradigm.

关键词： Decentralized Computing parallel Computation Drop Computing Application Programming Interface MPI

来源：评论

学校读者我要写书评

暂无评论

Accelerating SLIDE: Exploiting Sparsity on Accelerator Architectures 36

Accelerating SLIDE: Exploiting Sparsity on Accelerator Archi...

引用

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

作者： Ko, Sho Rucker, Alexander Zhang, Yaqi Mure, Paul Olukotun, Kunle Stanford Univ Stanford CA 94305 USA SambaNova Syst Palo Alto CA USA

ISBN: (纸本)9781665497473

A significant trend in machine learning is sparsifying the training of neural networks to reduce the amount of computation required. Algorithms like Sub-LInear Deep learning Engine (SLIDE) [2] use locality-sensitive hashing (LSH) to create sparsity. These sparse training algorithms were originally developed on multi-threaded multicore CPUs. However, they are not well-studied and optimized for accelerator platforms such as GPUs and reconfigurable dataflow architectures (RDAs). In this paper, we study the different variants of the SLIDE algorithm and investigate accuracy-performance tradeoffs on CPU, GPU, and RDAs. The implementation targeting RDA outperforms the GPU by 7.5x. The performance on a limited-memory RDA is improved further by proposing a smart caching algorithm, which is 2 x faster than the baseline RDA. Furthermore, we are able to achieve another 2 x performance by putting all of the weights on-chip using an RDA with enough memory. We believe our work will pave the road for the future development of both algorithm and hardware architecture for sparse training.

关键词： Training Machine learning algorithms Multicore processing Roads Neurons Graphics processing units Random access memory

来源：评论

学校读者我要写书评

暂无评论

Current Trends in Road Traffic Network Division for distributed or parallel Road Traffic Simulation 26

Current Trends in Road Traffic Network Division for Distribu...

引用

26th ieee/ACM international symposium on distributed Simulation and Real Time applications (DS-RT)

作者： Potuzak, Tomas Univ West Bohemia Fac Sci Appl Dept Comp Sci & Engn NTIS European Ctr Excellence Plzen Czech Republic

ISBN: (数字)9781665497992

ISBN: (纸本)9781665497992

Road traffic simulation is one of the useful tools, which can help to cope with steadily increasing intensity of road traffic. A distributed or parallel computing environment can significantly speedup the simulation execution, but the road traffic network division is usually required. There are many existing methods for road traffic network division based on various approaches. However, there is a lack of surveys mapping these methods. For this reason, this paper is a survey of existing methods for road traffic network division published in last two decades. It is not a systematic review, as it does not try to answer specific scientific questions. Its purpose is to map and categorize the existing methods for road traffic network division and to summarize their common features. Such a survey can be useful as a good starting point for the related work exploration for any teams or individuals dealing with road traffic network division and distributed or parallel road traffic simulation.

关键词： road traffic network division distributed simulation parallel simulation road traffic simulation papers survey

来源：评论

学校读者我要写书评

暂无评论

Multi-Criteria Mesh Partitioning for an Explicit Temporal Adaptive, Tasl-Distribnted Finite-volume Solver

Multi-Criteria Mesh Partitioning for an Explicit Temporal Ad...

引用

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

作者： Lasserre, Alice Couteyen-Carpaye, Jean-Marie Guermouche, Abdou Namyst, Raymond Inria Le Chesnay Rocquencourt France Airbus CRT Toulouse France Univ Bordeaux Bordeaux France

ISBN: (纸本)9798350364613;9798350364606

The aerospace industry is one of the largest users of numerical simulation, which is an essential tool in the field of aerodynamic engineering, where many fluid dynamics simulations are involved. In order to obtain the most accurate solutions, some of these simulations use unstructured finite volume solvers that cope with irregular meshes by using explicit time-adaptive integration methods. Modern parallel implementations of these solvers rely on task-based runtime systems to perform fine-grained load balancing and to avoid unnecessary synchronizations. Although such implementations greatly improve performance compared to a classical fork-join MPI+OpenMP variants, it remains a challenge to keep all cores busy throughout the simulation loop. In this article, we first investigate the origins of this lack of parallelism. We emphasize that the irregular structure of the task graph plays a major role in the inefficiency of the computation distribution. Our main contribution is to improve the shape of the task graph by using a new mesh partitioning strategy. The originality of our approach is to take the temporal level of mesh cells into account during the mesh partitioning phase. We evaluate our approach by integrating our solution in an ArianeGroup production code used by Airbus. We show that our partitioning method leads to a more balanced task graph. The resulting task scheduling is up to two times faster for meshes ranging from 200,000 to 12,000,000 components.

关键词： scheduling DAG task-based applications heterogeneous systems

来源：评论

学校读者我要写书评

暂无评论

TFIDF Text Keyword Mining Method Based on Hadoop distributed Platform Under Massive Data 2

TFIDF Text Keyword Mining Method Based on Hadoop Distributed...

引用

2nd ieee international Conference on Image processing and Computer applications, ICIPCA 2024

作者： Dai, Zheng Zhao, Xinping Cui, Bingtao Shandong University of Science and Technology Qingdao China

ISBN: (纸本)9798350360240

Keyword extraction is an important part of text mining. Keywords extracted from text can explore the theme of the whole text and be further applied to text recommendation or text search. Under the wave of big data, the traditional text keyword extraction algorithm frequently appears in the low efficiency of the training and testing process on a single machine. Based on this, this paper proposes the TFIDF text classification algorithm based on the distributed platform of Hadoop, and gives the specific process of the algorithm implementation. The parallel TFIDF text classification algorithm considering the position of words in the document is implemented by MapReduce programming model, and compared with the traditional serial algorithm, the experiment is carried out in single machine and cluster mode. Experiments show that the proposed method improves the performance of the algorithm significantly, and can realize efficient information extraction at high speed in the face of massive data. © 2024 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Economical Electricity Supplement for Mobile Collectors in Large-Scale Multitask WSNs 21

Economical Electricity Supplement for Mobile Collectors in L...

引用

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

作者： Zhai, Xin Xu, Lijie Zhang, Jialei Wang, Kun Xu, Jia Xu, Bei Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9798350329223

For large-scale multitask wireless sensor networks (LSM-WSNs), the traditional data collection mode could suffer low energy-efficiency on data transmission, since the large-scale multitask scenarios could result in much higher packet collision probability, especially for harsh environments. Mobile data collection is an efficient data acquisition way to prolong network lifetime for LSM-WSNs. However, the mobile collectors could suffer electricity shortage problem, since the limited battery capacity of any mobile collector could not afford the energy consumption of its long-distance movement and massive data collection in large-scale multitask scenarios. Deploying wireless chargers to supplement the energy of mobile collectors is a feasible solution to electricity shortage problem, but will incur extra charger deployment cost. In this paper, we focus on the problem that how to optimize such charger deployment cost, which is NP-hard. By transforming it into minimum-cost submodular cover problem, we devise an efficient approximation algorithm with a provable approximation ratio. The extensive simulation results reveal that our solution always outperforms the other solutions under whatever configurations. © 2023 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An On-the-Fly Method to Exchange Vector Clocks in distributed-Memory Programs 36

An On-the-Fly Method to Exchange Vector Clocks in Distribute...

引用

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

作者： Schwitanski, Simon Tomski, Felix Protze, Joachim Terboven, Christian Mueller, Matthias S. Rhein Westfal TH Aachen IT Ctr Aachen Germany

ISBN: (纸本)9781665497473

Vector clocks are logical timestamps used in correctness tools to analyze the happened-before relation between events in parallel program executions. In particular, race detectors use them to find concurrent conflicting memory accesses, and replay tools use them to reproduce or find alternative execution paths. To record the happened-before relation with vector clocks, tool developers have to consider the different synchronization concepts of a programming model, e.g., barriers, locks, or message exchanges. Especially in distributed-memory programs, various concepts result in explicit and implicit synchronization between processes. Previously implemented vector clock exchanges are often specific to a single programming model, and a translation to other programming models is not trivial. Consequently, analyses relying on the vector clock exchange remain model-specific. This paper proposes an abstraction layer for on-the-fly vector clock exchanges for distributed-memory programs. Based on the programming models MPI, OpenSHMEM, and GASPI, we define common synchronization primitives and explain how model-specific procedures map to our model-agnostic abstraction layer. The exchange model is general enough also to support synchronization concepts of other parallel programming models. We present our implementation of the vector clock abstraction layer based on the Generic Tool Infrastructure with translators for MPI and OpenSHMEM. In an overhead study using the SPEC MPI 2007 benchmarks, the slowdown of the implemented vector clock exchange ranges from 1.1x to 12.6x for runs with up to 768 processes.

关键词： Vector clock distributed memory synchronization correctness tools MPI OpenSHMEM GASPI

来源：评论

学校读者我要写书评

暂无评论

Multi-View Learning for parallelism Discovery of Sequential Programs 36

Multi-View Learning for Parallelism Discovery of Sequential ...

引用

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

作者： Chen, Le Mahmud, Quazi Ishtiaque Jannesari, Ali Iowa State Univ Dept Comp Sci Ames IA 50011 USA

ISBN: (纸本)9781665497473

Identifying suitable parallelizable regions in sequential programs is a crucial task for performance optimizations. Traditional methods like static and dynamic analysis have flaws like insufficient accuracy or high overhead runtime. Recent studies are more interested in applying machine learning techniques to this topic. The crux of parallelism discovery with machine learning is to generate meaningful code representations. One promising route is to exploit the dependence graph through Graph Neural Networks (GNNS). In this paper, a novel multi-view framework is proposed to automatically detect potential parallelism opportunities. Sequential programs are first represented by program execution graphs encompassing both semantic and structural information. Then two independent views are defined: namely, a structural pattern view and a node feature view. In the structural view, local graph structural patterns are captured via random anonymous walks and then fed into a Graph Convolutional Network (GCN). The node features, both dynamic and static, are fed into another GCN in the node feature view. In addition, a multi-view model is designed to unify the node features and the structural features for parallelism detection. Our approach achieves comparable state-of-the-art performance on parallel region classification with an accuracy up to 92.6% when evaluated with popular parallel computing benchmarks.

关键词： machine learning artificial intelligence parallel program language

来源：评论

学校读者我要写书评

暂无评论

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph processing on GPU 36

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Gra...

引用

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

作者： Chen, Jou-An Sung, Hsin-Hsuan Shen, Xipeng Tallent, Nathan Barker, Kevin Li, Ang North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA Pacific Northwest Natl Lab Richland WA 99352 USA

ISBN: (纸本)9781665481069

In a general graph data structure like an adjacency matrix, when edges are homogeneous, the connectivity of two nodes can be sufficiently represented using a single bit. This insight has, however, not yet been adequately exploited by the existing matrix-centric graph processing frameworks. This work fills the void by systematically exploring the bit-level representation of graphs and the corresponding optimizations to the graph operations. It proposes a two-level representation named Bit-Block Compressed Sparse Row (B2SR) and presents a series of optimizations to the graph operations on B2SR by leveraging the intrinsics of modern GPUs. Evaluations on NVIDIA Pascal and Volta GPUs show that the optimizations bring up to 40x and 6555x for essential GraphBLAS kernels SpMV and SpGEMM, respectively, making GraphBLAS-based BFS accelerate up to 433x, SSSP, PR, and CC up to 35x, and TC up to 52x.

关键词： distributed processing Graphics processing units Linear algebra Performance gain parallel processing Data structures Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

distributed Multi-GPU Community Detection on Exascale Computing Platforms

Distributed Multi-GPU Community Detection on Exascale Comput...

引用

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

作者： Sattar, Naw Safrin Lu, Hao Wang, Feiyi Halappanavar, Mahantesh Oak Ridge Natl Lab Oak Ridge TN 37830 USA Pacific Northwest Natl Lab Richland WA 99352 USA

ISBN: (纸本)9798350364613;9798350364606

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (distributed parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve an optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively, the performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

关键词： multi-GPU Louvain community detection clustering hybrid HIP MPI

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：