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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,157 篇 会议
72 篇 期刊文献
65 册 图书

馆藏范围

3,293 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,338 篇 工学
- 2,058 篇 计算机科学与技术...
- 1,036 篇 软件工程
- 414 篇 电气工程
- 326 篇 信息与通信工程
- 310 篇 电子科学与技术（可...
- 112 篇 控制科学与工程
- 69 篇 机械工程
- 67 篇 光学工程
- 67 篇 生物工程
- 62 篇 生物医学工程（可授...
- 35 篇 动力工程及工程热...
- 33 篇 仪器科学与技术
- 32 篇 建筑学
- 30 篇 材料科学与工程（可...
- 29 篇 化学工程与技术
- 25 篇 土木工程
- 21 篇 力学（可授工学、理...
721 篇 理学
- 482 篇 数学
- 174 篇 物理学
- 79 篇 生物学
- 65 篇 系统科学
- 60 篇 统计学（可授理学、...
- 36 篇 化学
246 篇 管理学
- 158 篇 管理科学与工程(可...
- 102 篇 图书情报与档案管...
- 70 篇 工商管理
63 篇 医学
- 53 篇 临床医学
- 21 篇 基础医学(可授医学...
22 篇 农学
- 19 篇 作物学
21 篇 法学
- 19 篇 社会学
15 篇 经济学
12 篇 文学
11 篇 教育学
4 篇 军事学

主题

327 篇 parallel process...
204 篇 graphics process...
203 篇 computer archite...
157 篇 parallel archite...
136 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
76 篇 signal processin...
72 篇 parallel program...
71 篇 field programmab...
68 篇 instruction sets
68 篇 multicore proces...
67 篇 parallel computi...
65 篇 algorithm design...
58 篇 throughput
57 篇 gpu

机构

9 篇 college of compu...
9 篇 natl univ def te...
8 篇 carleton univ sc...
8 篇 national laborat...
6 篇 hosei univ dept ...
6 篇 inria rennes
6 篇 st francis xavie...
5 篇 chinese acad sci...
5 篇 univ aizu dept c...
5 篇 polish japanese ...
5 篇 computer science...
5 篇 college of compu...
5 篇 city university ...
4 篇 shanghai jiao to...
4 篇 charles univ pra...
4 篇 rwth aachen univ...
4 篇 hainan internati...
4 篇 department of co...
4 篇 university of ch...
4 篇 universidad carl...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
8 篇 dongarra jack
7 篇 liu jie
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 hannig frank
6 篇 li dongsheng
6 篇 teich juergen
6 篇 li chao
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 krulis martin
5 篇 zhang lei
5 篇 ito yasuaki
5 篇 li kenli
5 篇 wanlei zhou
5 篇 tudruj marek

语言

3,230 篇 英文
53 篇 其他
15 篇 中文

检索条件"任意字段=5th International Conference on Algorithms and Architectures for Parallel Processing"

共 3294 条记录，以下是1961-1970 订阅

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

详细简洁

排序：

Real-Time Linux Framework for Designing parallel Mobile Robotic Applications

Real-Time Linux Framework for Designing Parallel Mobile Robo...

引用

10th international conference on algorithms and architectures for parallel processing

作者： Aracil, Joan Dominguez, Carlos Hassan, Houcine Crespo, Alfons Univ Politecn Valencia Dept Comp Engn DISCA E-46071 Valencia Spain

ISBN: (纸本)9783642131356

A real-time emotional architecture (RTEA) for building parallel robotic applications is presented. RTEA allows the application developer to focus in the design and implementation of the agent processes, because the architecture itself solves, in an autonomous way the decision about the attention to be paid to each of these processes. From the functional point of view, an RTEA selects and adapts its objectives depending on its physical (actuators) and its mental (processing) capabilities. this characteristic makes the architecture a useful solution in such applications that have to deal with several simultaneous tasks, that has real-time constraints, and where the objectives are defined in a flexible way. From the viewpoint of the design and development of applications, RTEA defines its different entities as independent modules. this modularity facilitates the programmer the development of each part of the project. To control the processing capacity of the agent and to guarantee the fulfilment of the temporal constraints of the processes. RTEA has been implemented in a real-time kernel (rt-linux). Mobile robot Experiments have been carried out to show how emotional system influence the mental organisation of the robot when it performs navigational tasks under different environmental conditions.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Bit-(parallelism)²: Getting to the Next Level of parallelism

Bit-(Parallelism)<SUP>2</SUP>: Getting to the Next Level of ...

引用

5th international conference on Fun with algorithms

作者： Cantone, Domenico Faro, Simone Giaquinta, Emanuele Univ Catania Dipartimento Matemat & Informat I-95124 Catania Italy

ISBN: (纸本)9783642131219

We investigate the problem of getting to a higher instruction-level parallelism in string matching algorithms. In particular, starting from an algorithm based on bit-parallelism, we propose two flexible approaches for boosting it with a higher level of parallelism. these approaches are general enough to be applied to other bit-parallel algorithms. It turns out that higher levels of parallelism lead to more efficient solutions in practical cases, as demonstrated by an extensive experimentation.

关键词： string matching bit parallelism text processing design and analysis of algorithms instruction-level parallelism

来源：评论

学校读者我要写书评

暂无评论

parallel and Distributed Programming 16th

Parallel and Distributed Programming

引用

16th international Euro-Par conference on parallel processing

作者： Kielmann, thilo Clematis, Andrea Gorlatch, Sergei Lastovetsky, Alexey Vrije Univ Amsterdam Netherlands

ISBN: (纸本)9783642152900

Developing parallel or distributed applications is a hard task and it requires advanced algorithms, realistic modeling, efficient design tools, high-level programming abstractions, high-performance implementations, and experimental evaluation. Ongoing research in this field emphasizes the design and development of correct, high-performance, portable, and scalable parallel programs. Related to these central needs, important work addresses methods for reusability, performance prediction, large-scale deployment, self-adaptivity, and fault-tolerance. Given the rich history in this field, practical applicability of proposed methods, models, algorithms, or techniques is a key requirement for timely research. this topic is focusing on parallel and distributed programming in general, except for work specifically targeting multicore architectures, which has matured to becoming a Euro-Par topic of its own. © 2010, Springer-Verlag Berlin Heidelberg.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Scalable Co-clustering algorithms

Scalable Co-clustering Algorithms

引用

10th international conference on algorithms and architectures for parallel processing

作者： Kwon, Bongjune Cho, Hyuk Univ Texas Austin Biomed Engn Austin TX 78712 USA Sam Houston State Univ Comp Sci Huntsville TX 77340 USA

ISBN: (纸本)9783642131189

Co-clustering has been extensively used in varied applications because of its potential to discover latent local patterns that are otherwise unapparent by usual unsupervised algorithms such as k-means. Recently, a unified view of co-clustering algorithms, called Bregman co-clustering (BCC), provides a general framework that even contains several existing co-clustering algorithms, thus we expect to have more applications of this framework to varied data types. However, the amount of data collected from real-life application domains easily grows too big to fit in the main memory of a single processor machine. Accordingly, enhancing the scalability of BCC can be a critical challenge in practice. To address this and eventually enhance its potential for rapid deployment to wider applications with larger data, we parallelize all the twelve co-clustering algorithms in the BCC framework using message passing interface (MPI). In addition, we validate their scalability on eleven synthetic datasets as well as one real-life dataset, where we demonstrate their speedup performance in terms of varied parameter settings.

关键词： Co-clustering Message Passing Interface Distributed Co-clustering Scalable Co-clustering parallel Co-clustering

来源：评论

学校读者我要写书评

暂无评论

Mapping OpenMP concepts to the stream programming model

Mapping OpenMP concepts to the stream programming model

引用

international conference on Computer Science and Education

作者： Tang, Tao Lin, Yisong Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424460052

OpenMP is a widely used parallel programming model on traditional multi-core processors. Generally, OpenMP is used to develop fine-grained parallelism through a multithread model. Stream programming model is a new kind of parallel programming model for stream architectures. OpenMP bears a resemblance to the stream programming model at some level. the transformation between the two models has attracted much attention from the research community, since it is the foundation of porting programs between the two architectures. Most related researches focus on the efficiency of porting existing parallel programs to the new architectures such as GPUs. Very few of these studies, however, focus on the portative problem systematically, namely, what kind of parallel programs can be or should be transplanted into stream programs and mapped to run on the stream processors. In this paper, we study the mapping relationship of parallel mechanism in OpenMP to the stream programming model, and point out those parallel mechanisms in OpenMP that are infeasible or undesirable for stream programs. By analyzing two typical benchmarks, we draw the conclusion that a majority of scientific applications are suitable to be mapped to the stream programming model. Our conclusion effectively validates the idea of accelerating scientific applications with the stream processors. ©2010 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of parallel algorithms for Asynchronous Cellular Automata Simulation on Different Computer architectures

Comparative Study of Parallel Algorithms for Asynchronous Ce...

引用

9th international conference on Cellular Automata for Research and Industry

作者： Kalgin, Konstantin RAS SB Inst Computat Math & Math Geophys Moscow Russia

ISBN: (纸本)9783642159787

Overview and experimental comparative study of parallel algorithms of asynchronous cellular at simulation is presented. the algorithms are tested for the model of physicochemical process of surface CO + O-2 reaction over the supported Pd nanoparticles on different parallel computers. For testing we use shared memory computers, distributed memory computers (i.e. clusters), and graphical processing unit. Characterization of these algorithms in respect of methods of parallelism maintenance is given.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated Tuning in parallel Sorting on Multi-core architectures

Automated Tuning in Parallel Sorting on Multi-core Architect...

引用

16th international Euro-Par conference on parallel processing

作者： Lin, Haibo Li, Chao Wang, Qian Zhao, Yi Pan, Ninghe Zhuang, Xiaotong Shao, Ling IBM Res Beijing Beijing Peoples R China Univ Massachusetts Boston MA USA Beijing Inst Technol Beijing Peoples R China IBM Syst & Technol Grp Beijing Peoples R China IBM Watson Res Ctr Yorktown Hts NY USA

ISBN: (纸本)9783642152764

Empirical search is an emerging strategy used in systems like ATLAS, FFTW and SPIRAL to find the parameter values of the implementation that deliver near-optimal performance for a particular machine. However, this approach has only proven successful for scientific kernels or serial symbolic sorting. Even commercial libraries like Intel MKL or IBM ESSL do not include parallel version of sorting routines. In this paper we study empirical search in the generation of parallel sorting routines for multi-core systems. parallel sorting presents new challenges that the relative performance of the algorithms depends not only on the characteristics of the architectures and input data, but also on the data partitioning schemes and thread interactions. We have studied parallel sorting algorithms including quick sort, cache-conscious radix sort, multi-way merge sort, sample sort and quick-radix sort, and have built a sorting library using empirical search and artificial neural network. Our results show that this sorting library could generate the best parallel sorting algorithms for different input sets on both x86 and SPARC multi-core architectures, with a peak speedup of 2.2x and 3.9x, respectively.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

A New parallel Method of Smith-Waterman Algorithm on a Heterogeneous Platform

A New Parallel Method of Smith-Waterman Algorithm on a Heter...

引用

10th international conference on algorithms and architectures for parallel processing

作者： Chen, Bo Xu, Yun Yang, Jiaoyun Jiang, Haitao Univ Sci & Technol China Dept Comp Sci Key Lab High Performance Comp Hefei Anhui Peoples R China

ISBN: (纸本)9783642131189

Smith-Waterman algorithm is a classic dynamic programming algorithm to solve the problem of biological sequence alignment. However, with the rapid increment of the number of DNA and protein sequences, the originally sequential algorithm is very time consuming due to there existing the same computing task computed repeatedly on large-scale data. Today's CPU (graphics processor unit) consists of hundreds of processors, so it has a more powerful computation capacity than the current multicore CPU. And as the programmability of GPU improved continuously, using it to do generous purpose computing is becoming very popular. In order to accelerate sequence alignment, previous researchers use the parallelism of the anti-diagonal of similarity matrix to parallelize the Smith-Waterman algorithm on CPU. In this paper, we design a new parallel algorithm which exploits the parallelism of the column of similarity matrix to parallelize the Smith-Waterman algorithm on a heterogeneous system based on CPU and CPU. the experiment result shows that our new parallel algorithm is more efficient than that of previous, which takes full advantage of the features of both the CPU and CPU and obtains approximately 37 times speedup compared with the sequential algorithm named OSEARCH implemented on Intel dual-core E2140 processor.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Query Optimization over parallel Relational Data Warehouses in Distributed Environments by Simultaneous Fragmentation and Allocation

Query Optimization over Parallel Relational Data Warehouses ...

引用

10th international conference on algorithms and architectures for parallel processing

作者： Bellatreche, Ladjel Cuzzocrea, Alfredo Benkrid, Soumia Univ Poitiers LISI ENSMA Futuroscope France Univ Calabria ICAR CNR Cosenza Italy ESI Natl High Sch Comp Sci Algiers Algeria

ISBN: (纸本)9783642131189

parallel database technology has already shown its efficiency in supporting high-performance Online Analytical processing (OLAP) applications. this scenario implies achieving query optimization over relational Data Warehouses (RDW) on top of which typical OLAP functionalities, such as roll-up, drill-down and aggregate query answering, can be implemented. As a result, it follows the emerging need for a comprehensive methodology able to support the design of RDW over parallel and distributed environments in all the phases, including data partitioning, fragment allocation, and data replication. Existing design approaches have an important limitation: fragmentation and allocation phases are performed in an isolated manner. In order to overcome this limitation, in this paper we propose a new methodology for designing parallel RDW over distributed environments, for query optimization purposes. the methodology is illustrated on database clusters, as a noticeable case of distributed environments. Contrary to state-of-the-art approaches where allocation is performed after fragmentation, in our approach we propose allocating fragments just during the partitioning phase. Also, a naive replication algorithm that takes into account the heterogeneous characteristics of our reference architecture is proposed.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

SV: Enhancing SIMD architectures via Combined SIMD-Vector Approach

SV: Enhancing SIMD Architectures via Combined SIMD-Vector Ap...

引用

10th international conference on algorithms and architectures for parallel processing

作者： Huang, Libo Wang, Zhiying Natl Univ Def Technol Sch Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783642131189

SIMD architectures are ubiquitous in general purpose and embedded processors to achieve future multimedia performance goals. However, limited to on chip resources and off-chip memory bandwidth, current SIMD extension only works on short sets of SIMD elements. this leads to large parallelization overhead for small loops in multimedia applications such as loop handling and address generation. this paper presents SIMD-Vector (SV) architecture to enhance SIMD parallelism exploration. It attempts to gain the benefits of both SIMD instructions and more traditional vector instructions which work on numerous values. Several instructions are extended that allows the programmer to work on large vectors of data and those large vectors are executed on a smaller SIMD hardware by a loop controller. To preserve the register file size for holding much longer vectors, we introduce a technique that the long vector references are performed on only one SIMD register in many iterations. We provide a detailed description of the SV architecture and its comparison with traditional vector architecture. We also present a quantitative analysis of the dynamic instruction size decrease and performance improvement of SV architecture.

关键词： SIMD vector performance loop

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共330页 << < 193 194 195 196 197 198 199 200 201 202 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：