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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

50 篇 会议
6 册 图书

馆藏范围

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

日期分布

学科分类号

43 篇 工学
- 39 篇 计算机科学与技术...
- 31 篇 软件工程
- 5 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 电气工程
- 3 篇 生物工程
- 1 篇 光学工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 水利工程
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
12 篇 理学
- 10 篇 数学
- 3 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

4 篇 software enginee...
4 篇 computer communi...
4 篇 parallel program...
4 篇 algorithm analys...
3 篇 database managem...
3 篇 parallel computi...
3 篇 high performance...
2 篇 parallel encodin...
2 篇 parallel process...
2 篇 dynamic programm...
2 篇 congresses.
2 篇 parallel algorit...
2 篇 maximum likeliho...
2 篇 hevc
1 篇 multi-frontal me...
1 篇 biology computin...
1 篇 datalog
1 篇 parallel algorit...
1 篇 mumps
1 篇 eigenvalues and ...

机构

3 篇 city university ...
2 篇 advanced institu...
2 篇 computer network...
2 篇 guangdong key la...
2 篇 hainan internati...
2 篇 beihang universi...
2 篇 school of comput...
2 篇 key laboratory o...
2 篇 key laboratory o...
2 篇 deakin universit...
2 篇 university of br...
2 篇 hainan internati...
2 篇 department of co...
2 篇 natural language...
1 篇 dalian maritime ...
1 篇 univ mostaganem ...
1 篇 national key lab...
1 篇 barcelona superc...
1 篇 moe key lab mach...
1 篇 aalto university...

作者

3 篇 wanlei zhou
3 篇 gao yutong
2 篇 chu chiawei
2 篇 liu wenjian
2 篇 zhiyang li
2 篇 geyong min
2 篇 chaomurilige
2 篇 guo ao
2 篇 pinol pablo
2 篇 michael hobbs
2 篇 guo jianxiong
2 篇 wenyu qu
2 篇 liu xuan
2 篇 lopez-granado ot...
2 篇 ivan stojmenovic
2 篇 migallon hector
2 篇 xian-he sun
2 篇 tingting yang
2 篇 yulei wu
2 篇 lei liu

语言

54 篇 英文
2 篇 中文

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

共 56 条记录，以下是21-30 订阅

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

详细简洁

排序：

Improving Hash Distributed A* for Shared Memory architectures Using Abstraction 16th

Improving Hash Distributed A* for Shared Memory Architecture...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Sanz, Victoria De Giusti, Armando Naiouf, Marcelo Natl Univ La Plata Sch Comp Sci III LIDI La Plata Argentina Minist Sci Technol & Product Innovat CONICET Buenos Aires DF Argentina

ISBN: (纸本)9783319495835;9783319495828

the A* algorithm is generally used to solve combinatorial optimization problems, but it requires high computing power and a large amount of memory, hence, efficient parallel A* algorithms are needed. In this sense, Hash Distributed A* (HDA*) parallelizes A* by applying a decentralized strategy and a hash-based node distribution scheme. However, this distribution scheme results in frequent node transfers among processors. In this paper, we present Optimized AHDA*, a version of HDA* for shared memory architectures, that uses an abstraction-based node distribution scheme and a technique to group several nodes before transferring them to the corresponding thread. Both methods reduce the amount of node transfers and mitigate communication and contention. We assess the effect of each technique on algorithm performance. Finally, we evaluate the scalability of the proposed algorithm, when it is run on a multicore machine, using the 15-puzzle as a case study.

关键词： HDA* for shared memory architectures Abstraction-based node distribution scheme Hash-based node distribution scheme Scalability Combinatorial optimization problems

来源：评论

学校读者我要写书评

暂无评论

Towards parallel CFD Computation for the ADAPT Framework 16th

Towards Parallel CFD Computation for the ADAPT Framework

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Kissami, Imad Cerin, Christophe Benkhaldoun, Fayssal Scarella, Gilles Univ Paris 13 LIPN Ave Jean Baptiste Clement F-93430 Villetaneuse France Univ Paris 13 LAGA 99 Ave Jean Baptiste Clement F-93430 Villetaneuse France

ISBN: (纸本)9783319495835;9783319495828

In order to run Computational Fluid Dynamics (CFD) codes on large scale infrastructures, parallel computing has to be used because of the computational intensive nature of the problems. In this paper we investigate the ADAPT platform where we couple flow Partial Differential Equations and a Poisson equation. this leads to a linear system which we solve using direct methods. the implementation deals with the MUMPS parallel multi-frontal direct solver and mesh partitioning methods using METIS to improve the performance of the framework. We also investigate, in this paper, how the mesh partitioning methods are able to optimize the mesh cell distribution for the ADAPT solver. the experience gained in this paper facilitates the move to a Service Oriented view of ADAPT as future work.

关键词： Unstructured mesh Mesh partitioning parallel direct solver Multi-frontal method MUMPS METIS Multi-physics Multi-scale and multilevel algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Query processing on a parallel Database Cluster Node 16th

Energy-Aware Query Processing on a Parallel Database Cluster...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Roukh, Amine Bellatreche, Ladjel Tziritas, Nikos Ordonez, Carlos Univ Mostaganem Mostaganem Algeria Univ Poitiers LIAS ISAE ENSMA Poitiers France Chinese Acad Sci Shenzhen Peoples R China Univ Houston Houston TX USA

ISBN: (纸本)9783319495835;9783319495828

In the last few years, we have been seeing a significant increase in research about the energy efficiency of hardware and software components in both centralized and parallel platforms. In data centers, DBMSs are one of the major energy consumers, in which, a large amount of data is queried by complex queries running daily. Having green nodes is a pre-condition to design an energy-aware parallel database cluster. Generally, the most existing DBMSs focus on high-performance during query optimization phase, while usually ignoring the energy consumption of the queries. In this paper, we propose a methodology, supported by a tool called EnerQuery, that makes nodes of parallel database clusters saving energy when optimizing queries. To show its effectiveness, we implement our proposal on the top of PostgreSQL DBMS query optimizer. A mathematical cost model based on a machine learning technique is defined and used to estimate the energy consumption of SQL queries.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Shared Memory Tile-Based vs Hybrid Memory GOP-Based parallel algorithms for HEVC Encoder 16th

Shared Memory Tile-Based vs Hybrid Memory GOP-Based Parallel...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Migallon, Hector Lopez-Granado, Otoniel Galiano, Vicente Pinol, Pablo Malumbres, Manuel P. Miguel Hernandez Univ Dept Phys & Comp Architecture Avda Univ S-N Alicante 03202 Spain

ISBN: (纸本)9783319495835;9783319495828

After the emergence of the new High Efficiency Video Coding standard, several strategies have been followed in order to take advantage of the parallel features available in it. Many of the parallelization approaches in the literature have been performed in the decoder side, aiming at achieving real-time decoding. However, the most complex part of the HEVC codec is the encoding side. In this paper, we perform a comparative analysis of two parallelization proposals. One of them is based on tiles, employing shared memory architectures and the other one is based on Groups Of Pictures, employing distributed shared memory architectures. the results show that good speed-ups are obtained for the tile-based proposal, especially for high resolution video sequences, but the scalability decreases for low resolution video sequences. the GOP-based proposal outperforms the tile-based proposal when the number of processes increases. this benefit grows up when low resolution video sequences are compressed.

关键词： HEVC Video coding parallel encoding Shared memory Distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Creating Distributed Execution Plans with BobolangNG 16th

Creating Distributed Execution Plans with BobolangNG

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Bednarek, David Krulis, Martin Yaghob, Jakub Zavoral, Filip Charles Univ Prague Fac Math & Phys Parallel Architectures Algorithms Applicat Res Gr Malostranske Nam 25 Prague Czech Republic

ISBN: (纸本)9783319495835;9783319495828

Execution plans constitute the traditional interface between DBMS front-ends and back-ends;similar networks of interconnected operators are found also outside database systems. Tasks like adapting execution plans for distributed or heterogeneous runtime environments require a plan transformation mechanism which is simple enough to produce predictable results while general enough to express advanced communication schemes required for instance in skew-resistant partitioning. In this paper, we describe the BobolangNG language designed to express execution plans as well as their transformations, based on hierarchical models known from many environments but enhanced with a novel compile-time mechanism of component multiplication. Compared to approaches based on general graph rewriting, the plan transformation in BobolangNG is not iterative;therefore the consequences and limitations of the process are easier to understand and the development of distribution strategies and experimenting with distributed plans are easier and safer.

关键词： Execution plan Distributed computing Partitioning Distributed database Datalog Modeling language

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of OpenACC Compilers 16th

Comparative Analysis of OpenACC Compilers

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Barba, Daniel Gonzalez-Escribano, Arturo Llanos, Diego R. Univ Valladolid Dept Informat Valladolid Spain

ISBN: (纸本)9783319499567;9783319499550

OpenACC has been on development for a few years now. the OpenACC 2.5 specification was recently made public and there are some initiatives for developing full implementations of the standard to make use of accelerator capabilities. there is much to be done yet, but currently, OpenACC for GPUs is reaching a good maturity level in various implementations of the standard, using CUDA and OpenCL as backends. Nvidia is investing in this project and they have released an OpenACC Toolkit, including the PGI Compiler. there are, however, more developments out there. In this work, we analyze different available OpenACC compilers that have been developed by companies or universities during the last years. We check their performance and maturity, keeping in mind that OpenACC is designed to be used without extensive knowledge about parallel programming. Our results show that the compilers are on their way to a reasonable maturity, presenting different strengths and weaknesses.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

On a parallel Algorithm for the Determination of Multiple Optimal Solutions for the LCSS Problem 16th

On a Parallel Algorithm for the Determination of Multiple Op...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ben Mabrouk, Bchira Hasni, Hamadi Mahjoub, Zaher Univ Tunis El Manar Fac Sci Tunis Univ CampusManar 2 Tunis 2092 Tunisia Higher Sch Technol & Comp Sci Charguia 2 Tunis 2035 Tunisia

ISBN: (纸本)9783319495835;9783319495828

For particular real world combinatorial optimization problems e.g. the longest common subsequence problem (LCSSP) from Bioinformatics, determining multiple optimal solutions (DMOS) is quite useful for experts. However, for large size problems, this may be too time consuming, thus the resort to parallel computing. We address here the parallelization of an algorithm for DMOS for the LCSSP. Considering the dynamic programming algorithm solving it, we derive a generic algorithm for DMOS (A-DMOS). Since the latter is a non perfect DO-loop nest, we adopt a three-step approach. the first consists in transforming the A-DMOS into a perfect nest. the second consists in choosing the granularity and the third carries out a dependency analysis in order to determine the type of each loop i.e. either parallel or serial. the practical performances of our approach are evaluated through experimentations achieved on input benchmarks and random DNA sequences and targeting a parallel multicore machine.

关键词： Bioinformatics Combinatorial optimization problem Dependency analysis Dynamic programming Longest common subsequence Loop nest Multiple optimal solutions Multicore machine parallelization Polyhedral algorithm

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Heterogeneous Coding Architecture for HEVC 16th

GPU-Based Heterogeneous Coding Architecture for HEVC

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Cebrian-Marquez, Gabriel Migallon, Hector Luis Martinez, Jose Lopez-Granado, Otoniel Pinol, Pablo Cuenca, Pedro Univ Castilla La Mancha Albacete Res Inst Informat I3A Plz Univ 2 Albacete 02071 Spain Miguel Hernandez Univ Dept Phys & Comp Architecture Elche 03202 Spain

ISBN: (纸本)9783319495835;9783319495828

the High Efficiency Video Coding (HEVC) standard has nearly doubled the compression efficiency of prior standards. Nonetheless, this increase in coding efficiency involves a notably higher computing complexity that should be overcome in order to achieve real-time encoding. For this reason, this paper focuses on applying parallel processing techniques to the HEVC encoder with the aim of reducing significantly its computational cost without affecting the compression performance. Firstly, we propose a coarse-grained slice-based parallelization technique that is executed in a multi-core CPU, and then, with finer level of parallelism, a GPU-based motion estimation algorithm. Both techniques define a heterogeneous parallel coding architecture for HEVC. Results show that speed-ups of up to 4.06x can be obtained on a quad-core platform with low impact in coding performance.

关键词： H.265 HEVC Heterogeneous parallel encoding GPU

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Algorithm for Optimal DAG Structure Search on parallel Computer with Torus Network 16th

Efficient Parallel Algorithm for Optimal DAG Structure Searc...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Honda, Hirokazu Tamada, Yoshinori Suda, Reiji Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138656 Japan

ISBN: (纸本)9783319495835;9783319495828

the optimal directed acyclic graph search problem constitutes searching for a DAG with a minimum score, where the score of a DAG is defined on its structure. this problem is known to be NP-hard, and the state-of-the-art algorithm requires exponential time and space. It is thus not feasible to solve large instances using a single processor. Some parallel algorithms have therefore been developed to solve larger instances. A recently proposed parallel algorithm can solve an instance of 33 vertices, and this is the largest solved size reported thus far. In the study presented in this paper, we developed a novel parallel algorithm designed specifically to operate on a parallel computer with a torus network. Our algorithm crucially exploits the torus network structure, thereby obtaining good scalability. through computational experiments, we confirmed that a run of our proposed method using up to 20,736 cores showed a parallelization efficiency of 0.94 as compared to a 1296-core run. Finally, we successfully computed an optimal DAG structure for an instance of 36 vertices, which is the largest solved size reported in the literature.

关键词： Optimal DAG structure Optimal bayesian network structure parallel algorithm Distributed algorithm Torus network

来源：评论

学校读者我要写书评

暂无评论

Light Loss-Less Data Compression, with GPU Implementation 16th

Light Loss-Less Data Compression, with GPU Implementation

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Funasaka, Shunji Nakano, Koji Ito, Yasuaki Hiroshima Univ Dept Informat Engn Kagamiyama 1-4-1 Higashihiroshima 7398527 Japan

ISBN: (纸本)9783319495835;9783319495828

there is no doubt that data compression is very important in computer engineering. However, most lossless data compression and decompression algorithms are very hard to parallelize, because they use dictionaries updated sequentially. the main contribution of this paper is to present a new lossless data compression method that we call Light Loss-Less (LLL) compression. It is designed so that decompression can be highly parallelized and run very efficiently on the GPU. this makes sense for many applications in which compressed data is read and decompressed many times and decompression performed more frequently than compression. We show optimal sequential and parallel algorithms for LLL decompression and implement them to run on Core i7-4790 CPU and GeForce GTX 1080 GPU, respectively. To show the potentiality of LLL compression method, we have evaluated the running time using five images and compared with well-known compression methods LZW and LZSS. Our GPU implementation of LLL decompression runs 91.1-176 times faster than the CPU implementation. Also, the running time on the GPU of our experiments show that LLL decompression is 2.49-9.13 times faster than LZW decompression and 4.30-14.1 times faster that LZSS decompression, although their compression ratios are comparable.

关键词： Data compression parallel algorithms GPGPU

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：