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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

488 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

513 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

211 篇 工学
- 197 篇 计算机科学与技术...
- 98 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
55 篇 理学
- 35 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

510 篇 英文
2 篇 其他
2 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 513 条记录，以下是251-260 订阅

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

详细简洁

排序：

A Novel Elastic Resource Allocation Strategy of Virtual Cluster

A Novel Elastic Resource Allocation Strategy of Virtual Clus...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Feifei Liu Xiaoshe Dong Department of Computer Science and Technology Xi'an Jiaotong University Xi'an China

Aiming at the problem on how to effectively allocate HPC resources to improve the efficiency of system, this paper presents a novel elastic resources allocation strategy. Within the changing range the users have assigned, the strategy permits the system to dynamically adjust the resource distribution of virtual clusters so that the efficiency of the system can be improved and users' costs can be reduced. To better implement the strategy, this paper provides a detailed description about the issue of resource allocation, and then proposes a algorithm named Mixed Bin Packing Algorithm. Experimental results indicate that the Mixed Bin Packing Algorithm is more effective than the previous algorithms, especially in a large application scale background.

关键词： Resource management Virtual machining Clustering algorithms Algorithm design and analysis Greedy algorithms Linear programming Pricing

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of Top-k Queries on GPU

Performance Optimization of Top-k Queries on GPU

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Tao Luo Guang-Zhong Sun Guoliang Chen Key Laboratory on High Performance Computing University of Science and Technology Hefei Anhui China

With the development of web search engines, the concern on real-time performance of Top-k queries has attracted more and more attention. The author studies implement of classic algorithm - No Random Access Algorithm in order to optimize performance of Top-k queries on GPU. We give a novel GPU algorithm by using the features of CUDA's programming model. Experiment results show that an implementation of the algorithm on one GPU runs more than 7000 times faster than a single core implementation on a latest CPU.

关键词： Graphics processing unit Instruction sets Upper bound programming Algorithm design and analysis Optimization Vectors

来源：评论

学校读者我要写书评

暂无评论

A parallel K-Means Clustering Algorithm with MPI

A Parallel K-Means Clustering Algorithm with MPI

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Jing Zhang Gongqing Wu Xuegang Hu Shiying Li Shuilong Hao School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Clustering is one of the most popular methods for data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most popular and simplest clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, thus, how to efficiently handle of these data in an important mining task has been a challenging and significant issue. In addition, MPI (Message Passing Interface) as a programming model of message passing presents high performances, scalability and portability. Motivated by this, a parallel K-means clustering algorithm with MPI, called MKmeans, is proposed in this paper. The algorithm enables applying the clustering algorithm effectively in the parallel environment. Experimental study demonstrates that MKmeans is relatively stable and portable, and it performs with low overhead of time on large volumes of data sets.

关键词： Clustering algorithms Algorithm design and analysis Partitioning algorithms parallel processing Message passing Data mining Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Constructing Limited Voronoi Mesh in parallel Based On Multi-core Environment and Its Implementation

Constructing Limited Voronoi Mesh in Parallel Based On Multi...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Lanfang Dong Yuan Wu Meng Li Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology Hefei China

Voronoi mesh as the basic primitive in the field of computational geometry has been widely applied on solving fluidrelated problem by finite volume method. By analyzing various limited conditions for reasonable point distributions and modifying parallel data structure (doubly-connected list) for complex boundaries features in Voronoi mesh generation, considering the rapid development of multi-core processors and high performance computing, we present an efficient and feasible parallel algorithm of limited Voronoi mesh generation in standalone multi-core CPU environment. The algorithm solves the practical application of Voronoi mesh generation of large-scale points set; the experiment results show that this method improved the efficiency of the algorithm and could be widely used in various applications.

关键词： Program processors Mesh generation parallel algorithms Qualifications Merging Algorithm design and analysis Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Thread-Level parallel Generating Inter-class Test Cases

Thread-Level Parallel Generating Inter-class Test Cases

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zhong Cheng Wu Xi-hua School of Computer and Electronics and Information Guangxi University Nanning China

A complicated class-cluster is transformed into several test blocks, and these test blocks are assigned to the processing cores on multi-core computer. Each processing core executes in parallel multiple threads to handle some test blocks. The relationship among classes in each block is represented by relational pairs, and the mutation program for each relational pair is generated by applying μJava. The generated mutants and model checker Java PathFinder(JPF) are applied to create automatically counterexample, and the test cases for class-cluster are extracted by analyzing the counterexample. The experimental results show that the presented method can speed up test generation and obtain test cases with higher quality.

关键词： Testing Java Computers Multicore processing Instruction sets Algorithm design and analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A parallel Computing Procedure for the Lower and Upper Bounds on the Functionals of Solutions to PDE: Application to the J-Integral in Functionally Graded Materials

A Parallel Computing Procedure for the Lower and Upper Bound...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Z.C. Xuan Department of Computer Science Tianjin University of Technology and Education Tianjin China

A parallel computing procedure for computing the bounds on the J-integral in functionally graded materials is presented based on a Neumann element a-posteriori error bound. The finite element solution of J-integral is first obtained on a coarser finite element mesh, then a-posteriori bounding procedure based on the finite element error estimate is used to compute the lower and upper bounds on the J-integral. The computation of the error estimate is performed by solving independent elemental Neumann sub problems decomposed from the finite element model, thus the computing procedure is parallel and potential to solve large scale structural problems. An example is given in the end of paper to compute the lower and upper bounds on the J-integral of functionally graded materials.

关键词： Finite element methods Mathematical model Equations Stress Upper bound Elasticity

来源：评论

学校读者我要写书评

暂无评论

The Design and Implementation of OMPit: An OpenMP Compiler Characterized by Logs for parallel and Work-Sharing

The Design and Implementation of OMPit: An OpenMP Compiler C...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Qiuming Luo Ye Cai Chengjian Liu Chang Kong National High Performance Computing Center (NHPCC) College of Computer Science and Software Engineering Shenzhen University China

There are many tools for OpenMP benchmarking which measure the various aspects of the performance, such as the overheads of OpenMP directives and the characteristics of the whole system. But we lack some tools to show us the worksharing details when the OpenMP program finished running. The OMPit (OMPi for tutoring) is designed to provide the worksharing information during the running, which can be used for tutoring and might help debugging or tuning. The work-sharing logging includes the work assignment and the timestamps for three different work-sharing behaviors. The logging information can be output as a text files or visualized figures. The designing of OMPit is provided and the details of how to inserting the logging code into the OMPi compiler is discussed too.

关键词： Debugging programming Program processors Runtime Benchmark testing Upper bound Kernel

来源：评论

学校读者我要写书评

暂无评论

Improving parallel FDTD Method Performance Using SSE Instructions

Improving Parallel FDTD Method Performance Using SSE Instruc...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Lihong Zhang Wenhua Yu School of Information Engineering Communication University of China Beijing China Fundamentals Department Chinese People's Armed Police Force Academy Langfang Hebei China Pennslyvania State University University Park PA USA

Electromagnetic researchers are often faced with long execution time and therefore algorithmic and implementation-level optimization can dramatically increase the overall performance of electromagnetism simulation using FDTD method. In this paper, we focus on acceleration implementation of 3D parallel FDTD method by taking advantage of the extended instruction sets found in modern processors, in particular the SSE instruction set. We present a SSE version of 3D parallel FDTD Method that results in a considerable 3x speedup.

关键词： Finite difference methods Time domain analysis Three dimensional displays Computational modeling Mathematical model Educational institutions Acceleration

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm of Visualization of Reservoir Numerical Simulation Based on PEBI Grids

Parallel Algorithm of Visualization of Reservoir Numerical S...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Lanfang Dong Detang Lu Meng Li Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology Hefei China Department of Modern Mechanics University of Science and Technology Hefei China

The speed of calculating, tracking and filling the isolines has a direct impact on the performance of user interaction. In this paper, we begin with the serial algorithm of visualization and implement its parallel algorithm. First, we divide the Delaunay grids generated from the PEBI grids into several regions. Calculation, tracking of isolines and calculation of saturation are implemented in each region respectively. Then the tracking results of each region are integrated for the entire work area. The parallel examples using OpenMP on computers with dual-core/quad-core are given at the end of this paper. The experimental results show that the parallel processing can greatly reduce the time required for data processing in visualization.

关键词： Instruction sets Data visualization Computers Filling Target tracking Image color analysis Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A Test Sequence Selection Method for parallel Software Systems

A Test Sequence Selection Method for Parallel Software Syste...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Tao Sun Xinming Ye Jing Liu College of Computer Science Inner Mongolia University for the Nationalities Hohhot China

Modeling and testing for a parallel software system is very difficult, because parallel behaviors leads to system state explosion. Many testing methods are testing with a large number of redundancies. In this paper, a test sequence selection method for parallel software systems is shown. The method is based on linear behavior sequences which is preparing for testing, called LBSPT. Firstly, a formal model for software system specification is constructed based on Coloured Petri Net (CPN), called system model, and LBSPT is also modeled based on CPN, called LBSPT model. A test sequence selection method is defined on these models. The method could select all of test sequences related to LBSPT, and does not contain any redundancy. The state explode problem in software testing is solved to a certain extent. Practices show that the effect of this method is better than other methods such as random walk.

关键词： Testing Firing Redundancy Software systems Computational modeling Silicon

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：