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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,536 篇 期刊文献
736 篇 会议
13 篇 学位论文
3 册 图书

馆藏范围

2,288 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,922 篇 工学
- 1,493 篇 计算机科学与技术...
- 534 篇 电气工程
- 292 篇 软件工程
- 139 篇 信息与通信工程
- 108 篇 控制科学与工程
- 62 篇 机械工程
- 57 篇 电子科学与技术（可...
- 53 篇 力学（可授工学、理...
- 41 篇 航空宇航科学与技...
- 30 篇 材料科学与工程（可...
- 29 篇 仪器科学与技术
- 25 篇 动力工程及工程热...
- 18 篇 土木工程
- 15 篇 测绘科学与技术
- 14 篇 化学工程与技术
- 14 篇 石油与天然气工程
- 10 篇 生物医学工程（可授...
- 10 篇 网络空间安全
687 篇 理学
- 494 篇 数学
- 121 篇 物理学
- 44 篇 化学
- 29 篇 地球物理学
- 25 篇 生物学
- 18 篇 统计学（可授理学、...
- 17 篇 系统科学
167 篇 管理学
- 154 篇 管理科学与工程(可...
- 10 篇 工商管理
- 10 篇 图书情报与档案管...
31 篇 医学
- 24 篇 临床医学
9 篇 经济学
- 8 篇 应用经济学
8 篇 农学
4 篇 教育学
2 篇 艺术学
1 篇 法学

主题

2,288 篇 parallel algorit...
96 篇 gpu
53 篇 cuda
50 篇 domain decomposi...
42 篇 finite element
42 篇 image processing
38 篇 mapreduce
35 篇 mpi
33 篇 parallel algorit...
29 篇 hypercube
26 篇 optimization
26 篇 navier-stokes eq...
25 篇 sorting
25 篇 time complexity
24 篇 data mining
23 篇 openmp
22 篇 graphics process...
20 篇 load balancing
20 篇 parallel computi...
20 篇 selection

机构

20 篇 southwest univ s...
13 篇 natl taiwan univ...
12 篇 guizhou normal u...
10 篇 georgia state un...
8 篇 hunan univ coll ...
7 篇 griffith univ sc...
7 篇 beihang univ sch...
6 篇 virginia tech de...
6 篇 beihang univ sta...
6 篇 suny coll new pa...
6 篇 china univ geosc...
5 篇 nanyang technol ...
5 篇 soochow univ sch...
5 篇 iowa state univ ...
5 篇 natl univ def te...
5 篇 guangxi teachers...
5 篇 univ texas dept ...
5 篇 natl taiwan univ...
5 篇 univ naples fede...
5 篇 natl univ def te...

作者

32 篇 shang yueqiang
22 篇 horng sj
16 篇 zheng bo
13 篇 li kenli
13 篇 shen h
12 篇 chung kl
11 篇 bahig hazem m.
11 篇 akl sg
10 篇 ito yasuaki
10 篇 pan y
10 篇 liu jie
10 篇 nakano koji
9 篇 mei gang
9 篇 tsai hr
8 篇 shi hc
7 篇 bozejko wojciech
7 篇 kao tw
7 篇 wang wei
7 篇 li keqin
7 篇 zapata el

语言

2,088 篇 英文
168 篇 其他
31 篇 中文
1 篇 法文
1 篇 俄文

检索条件"主题词=Parallel algorithm"

共 2288 条记录，以下是221-230 订阅

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

详细简洁

排序：

A parallel algorithm of Kirchhoff Pre-stack Depth Migration Based on GPU 1

引用

14th International Conference on algorithms and Architectures for parallel Processing (ICA3PP)

作者： Wang, Yida Li, Chao Tian, Yang Yan, Haihua Zhao, Changhai Zhang, Jianlei Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111940;9783319111933

Kirchhoff pre-stack depth migration (KPSDM) algorithm, as one of the most widely used migration algorithms, plays an important part in getting the real image of the earth. However, this program takes considerable time due to its high computational cost;hence the working efficiency of the oil industry is affected. The general purpose Graphic Processing Unit (GPU) and the Compute Unified Device Architecture (CUDA) developed by NVIDIA have provided a new solution to this problem. In this study, we have proposed a parallel algorithm of the Kirchhoff pre-stack depth migration and an optimization strategy based on the CUDA technology. Our experiments indicate that for large data computations, the accelerated algorithm achieves a speedup of 8 similar to 15 times compared with NVIDIA GPU.

关键词： Kirchhoff pre-stack depth migration GPU CUDA parallel algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

The Communication-Overlapped Hybrid Decomposition parallel algorithm for Multi-Scale Fluid Simulations 19

The Communication-Overlapped Hybrid Decomposition Parallel A...

引用

48th International Conference on parallel Processing (ICPP)

作者： Liu, Yi Guo, Xiao-Wei Li, Chao Yang, Canqun Gan, Xinbiao Zhang, Peng Wang, Yi Zhao, Ran Fan, Sijiang Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp State Key Lab High Performance Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781450362955

The MCDPar (parallel algorithm for multi-scale simulations based on Mesh and BCF Decomposition) algorithm significantly reduced the execution time and improved the parallel scalability for the multi-scale fluid simulations. However, the performance bottleneck still exists for extremely large-scale parallel simulations. In this paper, we designed a communication-overlapped hybrid decomposition parallel algorithm to improve the performance of the original MCDPar on large-scale clusters. Through non-blocking communication and code scheduling, the communication overhead between the master and slave groups have been overlapped with the computation of more microscopic configuration fields for the master process. Thus the parallel efficiency and scalability of the multi-scale solver could be improved on large-scale parallel simulations. In the test case with the number of configuration fields N-BCF = 1000 and mesh cells N-cell = 64000, the communication percentage between the corresponding master and slave processes is reduced by 39.71%. In the test case with N-BCF = 3000 and N-cell = 64000, the time cost of the fastest execution is reduced by 31.13% using the communication-overlapped algorithm, which offers a better parallel scaling on 256 cores compared to original 128 cores.

关键词： Brownian configuration fields communication-overlapped parallel algorithm hybrid decomposition multi-scale fluid simulations

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for H.264/AVC deblocking filter based on limited error propagation effect

A parallel algorithm for H.264/AVC deblocking filter based o...

引用

IEEE International Conference on Multimedia and Expo (ICME 2007)

作者： Yang, Shu-Sian Wang, Simg-Wen Wu, Ja-Ling Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10764 Taiwan

ISBN: (纸本)9781424410163

In this paper, we propose a parallel algorithm for H.264/AVC deblocking filter which is scalable to the number of processors. Unlike the conventional approach, which is limited by the independent data units, the designed algorithm allows issuing dependent data units concurrently to decrease the penalty from synchronization of data units. For the general-purpose dual-core processors, experimental results show that our method speeds up 1.72 and 1.39 times as compared with optimized sequential method and the well-known wavefront parallelizing method, respectively.

关键词： video coding H.264/AVC deblocking filter SIMD parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Rescue Robot Navigation parallel algorithm in Grid Computing Environment

Rescue Robot Navigation Parallel Algorithm in Grid Computing...

引用

International Conference on Advanced Materials and Information Technology Processing (AMITP 2011)

作者： Wang, Wei Shan, Xinjian Jia, Shenjie Inst Disaster Prevent Sci & Technol Dept Instrument Beijing Peoples R China China Earthquake Adm Inst Geol Beijing Peoples R China

ISBN: (纸本)9783037851579

In a disaster field, to obtain the optimal path in unknown environment,a rescue robot needs to build an environment map. Sensors mounted on the robots cooperate to monitor the environment, the information of the disaster field is collected by the sonsors of different robots, all signal from sensors (mounted on all robots and signal form GPS) are sent to the bakeside parllel processors with wireless network. A grid computing environment serves as the backside parallel processors with Globus Toolkit, the grid computing processor process all the signals and construct the global map to help robot for navigation path *** rescue robot get control signal from the grid computing processor with wireless network,thus, the robot is not necessary to be sophisticated. New computing methods are given for parallel algorithm on grid *** experiments show that the method is more practical and helps the path planning problem to be solved more efficiently, the advantages of large seale computing on grid are shown.

关键词： grid computing globus Toolkit rescue robot wireless network parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Experimental checking of fault susceptibility in a parallel algorithm

Experimental checking of fault susceptibility in a parallel ...

引用

International Conference on parallel Computing in Electrical Engineering (PAR ELEC 2002)

作者： Derezinska, A Sosnowski, J Warsaw Univ Technol Inst Comp Sci PL-00665 Warsaw Poland

ISBN: (纸本)0769517307;0769517315

The paper deals with the problem of analyzing fault, susceptibility of a parallel algorithm designed for multiprocessor array (MIMD structure). This algorithm realizes quite complex communication protocol in the system. We present an original methodology of the analysis based on the use of software implemented fault injector. The considered algorithm is modeled as a multithreaded application. The experiment set up an I results are presented and commented The performed experiments proved relatively high natural robustness of the analyzed algorithm and showed further possibilities of its improvement.

关键词： parallel algorithm fault injection multithreaded application processor array

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for finding the (k, l)-center of tree networks

An efficient parallel algorithm for finding the (<i>k</i>, <...

引用

18th IASTED International Conference on parallel and Distributed Computing and Systems

作者： Wang, Deqiang Li, Yuanhui Wang, Yan Wang, Kelun Dalian Maritime Univ Naut Sci & Technol Inst Dalian 116026 Peoples R China Northwest A & F Univ Sci Dept Yangling 712100 Peoples R China Dalian Maritime Univ Dept Math Dalian 116026 Peoples R China

ISBN: (纸本)9780889866386

This paper research on how to select a subtree with exactly k leaves and a diameter of at most 1, which minimizes the distance from the farthest vertex to the subtree. We call such a subtree (k, l)-center of a tree network. In this paper, an efficient parallel algorithm is proposed for finding a (k, l)-center of a tree network. This algorithm performs on the EREW PRAM in O(log n) time using O(n) work.

关键词： tree center parallel algorithm EREW PRAM

来源：评论

学校读者我要写书评

暂无评论

New parallel algorithm for the Calculation of Importance Measures 10th

New Parallel Algorithm for the Calculation of Importance Mea...

引用

10th International Conference on Dependability and Complex Systems (DepCoS-RELCOMEX)

作者： Zaitseva, Elena Levashenko, Vitaly Kvassay, Miroslav Kostolny, Jozef Univ Zilina Fac Management Sci & Informat Zilina 01026 Slovakia

ISBN: (纸本)9783319192161;9783319192154

A lot of mathematical approaches are used in importance analysis, which permits to investigate influence of system component state changes on the system reliability or availability. One of these approaches is Logical Differential Calculus, in particular Direct Partial Boolean Derivatives. A new algorithm for the calculation of Importance Measures with application of Direct Partial Boolean Derivatives is proposed in this paper. This algorithm is developed based on parallel procedures.

关键词： Importance measures Direct Partial Boolean Derivatives matrix procedures parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A Technique of Workload Distribution Based on parallel algorithm Structure Ontology 1

引用

3rd Conference on Computational Methods in Systems and Software (CoMeSySo)

作者： Klimenko, A. B. Safronenkova, I. B. Southern Fed Univ Sci Res Inst Multiproc Comp Syst 2 Chehova St Taganrog 347928 Russia Russian Acad Sci Fed Res Ctr Southern Sci Ctr 41 Chehova St Rostov Na Donu 344006 Russia

ISBN: (数字)9783030303297

ISBN: (纸本)9783030303297;9783030303280

A workload distribution problem is quite topical nowadays. A large number of applications, which function in distributed environments, uses various techniques of a workload relocation. Yet very few studies consider the workload relocation in fog-computing environment emphasizing the increase of a search space and the distances between the computational nodes. In this paper a new workload distribution technique, based on ontological analysis of algorithm structures and the available resources is presented. The aim is to limit and reduce the search space of the workload distribution problem. Such strategy decreases the time of workload location and so decreases the time needed to solve the general computational task of application.

关键词： Ontology Workload distribution problem Workload relocation Distributed systems parallel algorithm Fog computing Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows 10

A Parallel Algorithm with the Search Space Partition for the...

引用

10th International Conference on P2P, parallel, Grid, Cloud and Internet Computing 3PGCIC

作者： Nalepa, Jakub Blocho, Miroslaw Silesian Tech Univ Akad 16 PL-44100 Gliwice Poland ABB IT PL-04713 Warsaw Poland

ISBN: (纸本)9781467394734

The pickup and delivery problem with time windows (PDPTW) is an NP-hard optimization problem of serving transportation requests using a limited number of vehicles. Its main objective is to minimize the number of delivering trucks, whereas the secondary objective is to decrease the distance traveled during the service. A feasible routing schedule must satisfy the time window, capacity and precedence constraints. In this paper, we propose to partition the search space in our parallel guided ejection search algorithm (P-GES) to minimize the fleet size in the PDPTW. The introduced techniques help decrease the convergence time of the algorithm without affecting the quality of results. An extensive experimental study (comprising nearly 52, 000 CPU hours on an SMP cluster) performed on the Li and Lim's benchmark set shows that the parallel algorithm is effective, and is able to retrieve very high-quality results. We report 10 new world's best solutions obtained using P-GES enhanced with the proposed search space partition approaches.

关键词： parallel algorithm co-operation scheme search space partition guided ejection PDPTW

来源：评论

学校读者我要写书评

暂无评论

A load balancing parallel algorithm for solving large-scale tridiagonal linear systems

A load balancing parallel algorithm for solving large-scale ...

引用

International Conference on algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI)

作者： Tian, Min Qiao, Shan Wang, Junjie Du, Wei Qilu Univ Technol Shandong Acad Sci Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Jinan Peoples R China Qilu Univ Technol Shandong Acad Sci Sch Math & Stat Jinan Peoples R China

ISBN: (数字)9781510651890

ISBN: (纸本)9781510651890;9781510651883

Solving large-scale sparse linear systems is a critical problem in scientific and engineering computing. Partial differential equations can solve problems in many fields. They can be transformed into large-scale linear systems with a series of methods, and the parallel solution of tridiagonal linear systems is one of them. The solution of linear systems is very time-consuming in most of the problems, accounting for more than half of the total time. Load balancing can reduce process time for waiting and improves computational efficiency, and it is the focus of many algorithms. The article is based on Stone's proposed recursive doubling algorithm, an improved algorithm for solving tridiagonal linear systems using the full-recursive-doubling communication model and the Mobiu transform. The improved algorithm can calculate the million-dimensional linear systems. Numerical experiments show that compared with ordinary parallel algorithms, the improved algorithm shows up to 2x improvement than the original version, and some results even show up to 3x. In addition, the load-balancing performance has been greatly improved, and the time difference of the processes is 1/7 of the original version. The improved algorithm has a good load balancing, and the running time of each process is not much different, avoiding process waiting and resource wastage.

关键词： tridiagonal linear systems parallel algorithm load balancing recursive doubling Mobius transformation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：