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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

268 篇 会议
18 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

231 篇 工学
- 224 篇 计算机科学与技术...
- 159 篇 软件工程
- 29 篇 信息与通信工程
- 23 篇 电气工程
- 13 篇 电子科学与技术（可...
- 12 篇 控制科学与工程
- 7 篇 生物工程
- 4 篇 机械工程
- 4 篇 冶金工程
- 4 篇 生物医学工程（可授...
- 3 篇 农业工程
- 2 篇 力学（可授工学、理...
- 2 篇 仪器科学与技术
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 1 篇 光学工程
68 篇 理学
- 56 篇 数学
- 8 篇 生物学
- 6 篇 系统科学
- 4 篇 物理学
- 3 篇 统计学（可授理学、...
- 2 篇 地球物理学
- 1 篇 化学
- 1 篇 大气科学
22 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 法学
- 4 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
1 篇 医学

主题

14 篇 parallel computi...
12 篇 algorithm analys...
10 篇 parallel program...
10 篇 parallel algorit...
9 篇 software enginee...
9 篇 computer communi...
7 篇 parallel algorit...
7 篇 parallel process...
7 篇 gpu
6 篇 parallel process...
6 篇 high performance...
5 篇 scalability
5 篇 information syst...
5 篇 mapreduce
5 篇 artificial intel...
5 篇 distributed comp...
4 篇 parallel archite...
4 篇 matrix algebra
4 篇 combinatorial op...
4 篇 management of co...

机构

7 篇 natl univ def te...
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 hainan internati...
4 篇 natl univ def te...
3 篇 seecs university...
3 篇 department of co...
3 篇 key laboratory o...
3 篇 school of inform...
3 篇 peking univ eecs...
3 篇 laboratory of di...
2 篇 advanced institu...
2 篇 college of compu...
2 篇 computer network...
2 篇 saarland informa...
2 篇 guangdong key la...
2 篇 icar-cnr and uni...
2 篇 guangdong prov k...
2 篇 heilongjiang uni...
2 篇 department of co...

作者

5 篇 wang guojun
5 篇 wanlei zhou
5 篇 liu jie
4 篇 yang xiang
4 篇 su jinshu
4 篇 nakano koji
4 篇 michael hobbs
4 篇 gao yutong
4 篇 liu xuan
4 篇 huang zhen
4 篇 wang qinglin
4 篇 wang xiaofeng
4 篇 ivan stojmenovic
4 篇 chen yifeng
4 篇 albert zomaya
4 篇 zomaya albert
3 篇 chen peixin
3 篇 zhang lei
3 篇 li kenli
3 篇 li dongsheng

语言

290 篇 英文
2 篇 中文

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

共 292 条记录，以下是91-100 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

algorithms and architectures for parallel processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Meikang Qiu

ISBN: (数字)9783030602451

ISBN: (纸本)9783030602444

this three-volume set LNCS 12452, 12453, and 12454 constitutes the proceedings of the 20th international conference on algorithms and architectures for parallel processing, ica3pp 2020, in New York City, NY, USA, in October 2020.;ica3pp is covering the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated in every aspects of daily life, the power of computing system has become increasingly critical. this conference provides a forum for academics and practitioners from countries around the world to exchange ideas for improving the efficiency, performance, reliability, security and interoperability of computing systems and applications. ica3pp 2020 focus on two broadareas of parallel and distributed computing, i.e. architectures, algorithms and networks, and systems and applications.

关键词： Computational Mathematics and Numerical Analysis theory of Computation Computer Systems Organization and Communication Networks Control Structures and Microprogramming Input/Output and Data Communications Computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

An Algorithm to Embed a Family of Node-Disjoint 3D Meshes into Locally Twisted Cubes 1

引用

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

作者： You, Lantao Han, Yuejuan Soochow Univ Suzhou Ind Pk Inst Serv Outsourcing Suzhou 215000 Peoples R China Soochow Univ Ctr Informat Dev & Management Suzhou 215000 Peoples R China

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111940;9783319111933

In this paper, embeddings of a family of 3D meshes in locally twisted cubes are studied. Let LTQ(n)(V, E) denotes the n-dimensional locally twisted cube. We find two major results in this paper:(1) For any integer n >= 4, two node-disjoint 3D meshes of size 2 x 2 x 2(n-3) can be embedded into LTQ(n) with dilation 1 and expansion 2. (2) For any integer n = 6, four node-disjoint 4x2x2(n-5) meshes can be embedded into LTQ(n) with dilation 1 and expansion 4. Further, an embedding algorithm can be constructed based on our embedding method. the obtained results are optimal in the sense that the dilations of the embeddings are 1.

关键词： Interconnection networks locally twisted cube 3D mesh embedding parallel computing

来源：评论

学校读者我要写书评

暂无评论

GPU-Accelerated Verification of the Collatz Conjecture

GPU-Accelerated Verification of the Collatz Conjecture

引用

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

作者： Honda, Takumi Ito, Yasuaki Nakano, Koji Hiroshima Univ Dept Informat Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)9783319111971;9783319111964

the main contribution of this paper is to present an implementation that performs the exhaustive search to verify the Collatz conjecture using a GPU. Consider the following operation on an arbitrary positive number: if the number is even, divide it by two, and if the number is odd, triple it and add one. the Collatz conjecture asserts that, starting from any positive number m, repeated iteration of the operations eventually produces the value 1. We have implemented it on NVIDIA GeForce GTX TITAN and evaluated the performance. the experimental results show that, our GPU implementation can verify 5.01x10(11) 64-bit numbers per second, while the CPU implementation on Intel Xeon X7460 can verify 1.80 x 10(9) 64-bit numbers per second. thus, our implementation on the GPU attains a speed-up factor of 278 over the single CPU implementation.

关键词： Collatz conjecture GPGPU parallel processing Exhaustive verification

来源：评论

学校读者我要写书评

暂无评论

A Framework for Designing Autonomous parallel Data Warehouses 19th

A Framework for Designing Autonomous Parallel Data Warehouse...

引用

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

作者： Benkrid, Soumia Bellatreche, Ladjel Ecole Natl Super Informat ESI Algiers Algeria LIAS ISAE ENSMA Poitiers France

ISBN: (纸本)9783030389611;9783030389604

parallel data platforms are recognized as a key solution for processing analytical queries running on extremely large data warehouses (DWs). Deploying a DW on such platforms requires efficient data partitioning and allocation techniques. Most of these techniques assume a priori knowledge of workload. To deal with their evolution, reactive strategies are mainly used. the BI 2.0 requirements have put large batch and ad-hoc user queries at the center. Consequently, reactive-based solutions for deploying a DW in parallel platforms are not sufficient. Autonomous computing has emerged as a paradigm that allows digital objects managing themselves in accordance with high-level guidance by the means of proactive approaches. Being inspired by this paradigm, we propose in this paper, a proactive approach based on a query clustering model to deploying a DW over a parallel platform. the query clustering triggers partitioning and allocation processes by considering only evolved query groups. Intensive experiments were conducted to show the efficiency of our proposal.

关键词： Partitioning Allocation Common sub-expressions Utility maximization Autonomous system Workload clustering

来源：评论

学校读者我要写书评

暂无评论

parallel difference schemes for parabolic problems 5

Parallel difference schemes for parabolic problems

引用

5th international conference on algorithms and architectures for parallel processing, ica3pp 2002

作者： Yuan, Guangwei Shen, Longjiun Zhou, Yu-Lin Institute of Applied Physics and Computational Mathematics Laboratory of Computational Physics P. O. Box 8009 Beijing100088 China

ISBN: (纸本)0769515126

In this paper some implicit domain decomposition procedures for solving parabolic problems are proposed. In these methods, the classic implicit scheme is used in each sub-domain, and Dirichlet boundary values at the (interior) boundaries of sub-domains are just taken as the values of the difference solution at the previous time level. these implicit domain decomposition procedures are easy to be implemented on parallel computers and are called parallel difference schemes. they are proved to be stable and convergent unconditionally in discrete L∞ and H1 norms, and the convergence order is O(τ + h) though the truncation error at the sub-domain boundaries is O(1). © 2002 IEEE.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel Software Testing Sequence Generation Method Target at Full Covering Tested Behaviors 19th

Parallel Software Testing Sequence Generation Method Target ...

引用

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

作者： Sun, Tao Wan, Xiaoyun Zhong, Wenjie Guo, Xin Zhang, Ting Inner Mongolia Univ Coll Comp Sci Hohhot 100021 Inner Mongolia Peoples R China

ISBN: (纸本)9783030389611;9783030389604

parallel software system testing is very difficult because the number of states expands sharply caused by parallel behaviors. In this paper, a testing sequence generation method is proposed, target at full covering tested behaviors and related behaviors over all execution paths. Because of state spaces of parallel software systems are often large, this paper focuses on the state space subgraph, contained all firing of tested and related behaviors, of system model. Firstly, the software system is modeled with Colored Petri Net (CPN), called system model (SM), and every tested behavior or related behavior is modeled also with CPN, called Behavior Model Unit (BMU). then, the method proposes mapping operation, intersection operation, and so on to finally realize the generation of test sequence. Practices show that this method is efficient, which could achieve full coverage.

关键词： parallel software Testing sequence generation Full covering Tested behaviors Colored Petri Net (CPN)

来源：评论

学校读者我要写书评

暂无评论

Performance-Aware Data Placement in Hybrid parallel File Systems

Performance-Aware Data Placement in Hybrid Parallel File Sys...

引用

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

作者： He, Shuibing Sun, Xian-He Feng, Bo Feng, Kun Wuhan Univ Sch Comp Wuhan 430072 Hubei Peoples R China Illinois Inst Technol Dept Comp Sci Chicago IL USA

ISBN: (纸本)9783319111971;9783319111964

Hybrid parallel file systems (PFS), which consist of both HDD and SSD servers, provide a promising solution for data-intensive applications. In this study, we propose a performance-aware data placement (PADP) strategy to enable efficient data layout in hybrid PFSs. the basic idea of PADP is to dispatch data on different file servers with adaptive varied-size file stripes based on the server storage performance. By using an effective data access cost model and a linear programming optimization method, the appropriate stripe sizes for each file server are determined effectively. We have implemented PADP within OrangeFS, a widely used parallel file system in HPC domain. Experimental results of representative benchmark show that PADP can significantly improve the I/O performance of hybrid PFSs.

关键词： parallel I/O System parallel File system Solid State Drive

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：