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

15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Frisch, Jerome Mundani, Ralf-Peter Rank, Ernst Tech Univ Munich Chair Computat Engn D-80290 Munich Germany

ISBN: (纸本)9781479930357

Computational fluid dynamics (CFD) simulations require a lot of computing resources in terms of CPU time and memory in order to compute with a reasonable physical accuracy. If only uniformly refined domains are applied, the amount of computing cells is growing rather fast if a certain small resolution is physically required. This can be remedied by applying adaptively refined grids. Unfortunately, due to the adaptive refinement procedures, errors are introduced which have to be taken into account. This paper is focussing on implementation details of the applied adaptive data structure management and a qualitative analysis of the introduced errors by analysing a Poisson problem on the given data structure, which has to be solved in every time step of a CFD analysis. Furthermore an adaptive CFD benchmark example is computed, showing the benefits of an adaptive refinement as well as measurements of parallel data distribution and performance.

关键词： parallel computation adaptive data structure message passing paradigm multi-grid-like solver concept

来源：评论

学校读者我要写书评

暂无评论

Interactive data Exploration for High-Performance Fluid Flow Computations Through Porous Media 16

Interactive Data Exploration for High-Performance Fluid Flow...

引用

16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Perovic, Nevena Frisch, Jerome Mundani, Ralf-Peter Rank, Ernst Tech Univ Munich Chair Computat Engn D-80290 Munich Germany

ISBN: (纸本)9781479984480

Huge data advent in high-performance computing (HPC) applications such as fluid flow simulations usually hinders the interactive processing and exploration of simulation results. Such an interactive data exploration not only allows scientiest to 'play' with their data but also to visualise huge (distributed) data sets in both an efficient and easy way. Therefore, we propose an HPC data exploration service based on a sliding window concept, that enables researches to access remote data (available on a supercomputer or cluster) during simulation runtime without exceeding any bandwidth limitations between the HPC back-end and the user front-end.

关键词： high-performance computing interactive data exploration adaptive data structure multi-grid-like solver concept flow through porous media

来源：评论

学校读者我要写书评

暂无评论

Implementing adaptive and Dynamic data structures using CUDA Parallelism

Implementing Adaptive and Dynamic Data Structures using CUDA...

引用

International Conference on Advances in Engineering and Technology Research (ICAETR),

作者： Sangale, Abhijit L. Devani, Urvesh Nikam, Valmik B. Meshram, B. B. Veermata Jijabai Technol Inst Dept Comp Engn & Informat Technol Mumbai Maharashtra India

ISBN: (纸本)9781479963935

Dynamic data structures are the key to many highly efficient and optimized implementations. On CPU, dynamic data structures can grow and shrink at run time by allocating and deallocating memory from a place called heap and link those blocks using pointers. adaptive data structure means changing the internal properties and structures of the data structure at run time according to requirement for various purposes, known as adaptive use of data structure. When we consider parallelism on GPUs using CUDA, there are many limitations on what can be used as data structure on GPU's global and shared memory. Generally simple arrays are handled on the GPU memory. Programmers need to find ways to present different data structures in terms of multiple arrays. In this paper, we have studied and implemented dynamic data structures & adaptive methodologies on GPU. We majorly explore the concept dynamic parallelism available in latest CUDA devices by implementing and analyzing quick sort and kernel call wise break down on latest NVIDIA's Kepler Architecture GPU. We also experimented with basic array operations on GPU by implementing minimum number finding. Implementation using CUDA results in very high performance gain.

关键词： adaptive data structure Dynamic data structure Dynamic Parallelism CUDA GPU OpenCL

来源：评论

学校读者我要写书评

暂无评论

adaptive Point Location in Planar Convex Subdivisions 26th

Adaptive Point Location in Planar Convex Subdivisions

引用

26th International Symposium on Algorithms and Computation (ISAAC)

作者： Cheng, Siu-Wing Lau, Man-Kit HKUST Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9783662489710;9783662489703

We present a planar point location structure for a convex subdivision S. Given a query sequence of length m, the total running time is O(OPT+ m log log n+ n), where n is the number of vertices in S and OPT is the minimum running time to process the same query sequence by any linear decision tree for answering planar point location queries in S. The running time includes the preprocessing time. Therefore, for m >= n, our running time is only worse than the best possible bound by O(log log n) per query, which is much smaller than the O(log n) query time offered by an worst-case optimal planar point location structure.

关键词： Point location Convex subdivision adaptive data structure

来源：评论

学校读者我要写书评

暂无评论

Measuring and Comparing the Scaling Behaviour of a High-Performance CFD Code on Different Supercomputing Infrastructures 17

Measuring and Comparing the Scaling Behaviour of a High-Perf...

引用

17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Frisch, Jerome Mundani, Ralf-Peter Rhein Westfal TH Aachen Inst Energy Efficiency & Sustainable Bldg E3D D-52074 Aachen Germany Tech Univ Munich Chair Computat Engn D-80333 Munich Germany

ISBN: (纸本)9781509004614

Parallel code design is a challenging task especially when addressing petascale systems for massive parallel processing (MPP), i.e. parallel computations on several hundreds of thousands of cores. An in-house computational fluid dynamics code, developed by our group, was designed for such high-fidelity runs in order to exhibit excellent scalability values. Basis for this code is an adaptive hierarchical data structure together with an efficient communication and (numerical) computation scheme that supports MPP. For a detailled scalability analysis, we performed several experiments on two of Germany's national supercomputers up to 140,000 processes. In this paper, we will show the results of those experiments and discuss any bottlenecks that could be observed while solving engineering-based problems such as porous media flows or thermal comfort assessments for problem sizes up to several hundred billion degrees of freedom.

关键词： high-performance computing adaptive data structure multi-grid-like solver concept speed-up measurements

来源：评论

学校读者我要写书评

暂无评论

A Semantic Web Personalizing Technique The case of bursts in web visits

A Semantic Web Personalizing Technique The case of bursts in...

引用

4th Annual IEEE International Conference on Semantic Computing (ICSC)

作者： Antoniou, Dimitris Paschou, Mersini Sourla, Efrosini Tsakalidis, Athanasios Univ Patras Comp Engn & Informat Dept Patras 26504 Greece

ISBN: (纸本)9780769541549

The explosive growth in the size and use of the World Wide Web continuously creates new great challenges and needs. The need for predicting the users' preferences in order to expedite and improve the browsing though a site can be achieved through personalizing of the websites. A personalization mechanism is based on explicit preference declarations by the user and on an iterative process of monitoring the user navigation, collecting its requests of ontological objects and storing them in its profile in order to deliver personalized content. The problem that we address is the case where few web pages become very popular for short periods of time and are accessed very frequently in a limited temporal space. Our aim is to deal with these bursts of visits and suggest these highly accessed pages to the future users that have common interests. Hence, in this paper, we propose a new web personalization technique, based on advanced data structures. The data structures that are used are the Splay tree (1) and Binary heaps (2). We describe the architecture of the technique, analyze the time and space complexity and prove its performance. In addition, we compare both theoretically and experimentally the proposed technique to another approach to verify its efficiency. Our solution achieves O(P-2) space complexity and runs in *** time, where k is the number of pages and P the number of ontologies of Web pages.

关键词： component personlization ontologies adaptive data structure

来源：评论

学校读者我要写书评

暂无评论

adaptive point location in planar convex subdivisions

引用

International Journal of Computational Geometry and Applications 2017年第1-2期27卷 3-12页

作者： Cheng, Siu-Wing Lau, Man-Kit Department of Computer Science and Engineering HKUST Hong Kong

We present a planar point location structure for a convex subdivision S. Given a query sequence of length m, the total running time is O(OPT + mloglog n + n), where n is the number of vertices in S and OPT is the minimum time required by any linear decision tree for answering planar point location queries in S to process the same query sequence. The running time includes the preprocessing time. Therefore, for m ≥ n, our running time is only worse than the best possible bound by O(loglog n) per query, which is much smaller than the O(log n) query time offered by a worst-case optimal planar point location structure. © 2017 World Scientific Publishing Company.

关键词： adaptive data structure Convex subdivision Point location

来源：评论

学校读者我要写书评

暂无评论

adaptive MULTI-GRID METHODS FOR PARALLEL CFD APPLICATIONS

引用

SCALABLE COMPUTING-PRACTICE AND EXPERIENCE 2014年第1期15卷 33-48页

作者： Frisch, Jerome Mundani, Ralf-Peter Rank, Ernst Tech Univ Munich Chair Computat Engn D-80290 Munich Germany

Computational fluid dynamic (CFD) computations are memory and time intensive and need to be executed in parallel for larger computational domains. In order to produce physical accurate solutions, adaptive grid setups have to be chosen as the memory and computing time would otherwise be too high, and results would not be obtained in a reasonable amount of time. This paper describes the usage of a multi-grid based approach for solving the pressure Poisson equation, arising during every time step of the Navier-Stokes equations. It will then highlight an analysis of errors introduced due to an adaptive setup of the domain, and show performance measurements for uniform and adaptive grid setups. Last but not least, a CFD benchmark example based on the von Karman vortex street will be presented, and the results will be discussed.

关键词： parallel computation adaptive data structure multi-grid like solver computational fluid dynamics Poisson equation message passing paradigm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：