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

parallel techniques for physically based simulation on multi-core processor architectures

COMPUTERS & graphics-UK 2008年第1期32卷 25-40页

作者： Thomaszewski, Bernhard Pabst, Simon Blochinger, Wolfgang Univ Tubingen WSI GRIS D-72074 Tubingen Germany Univ Tubingen Symbol Computat Grp D-72074 Tubingen Germany

As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especially true for physically based simulation, which is notorious for expensive numerical methods. In this work, we explore possibilities for accelerating physically based simulation algorithms on multi-core architectures. Two components of physically based simulation represent a great potential for bottlenecks in parallelisation: implicit time integration and collision handling. From the parallelisation point of view these two components are substantially different. Implicit time integration can be treated efficiently using static problem decomposition. The linear system arising in this context is solved using a data-parallel preconditioned conjugate gradient algorithm. The collision handling stage, however, requires a different approach, due to its dynamic structure. This stage is handled using multi-threaded programming with fully dynamic task decomposition. In particular, we propose a new task splitting approach based on a reasonable estimation of work, which analyses previous simulation steps. Altogether, the combination of different parallelisation techniques leads to a concise and yet versatile framework for highly efficient physical simulation. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： physically-based simulation parallel collision detection parallel conjugate gradients multi-core processors

来源：评论

学校读者我要写书评

暂无评论

Web based collaborative visualization of distributed and parallel simulation

Web based collaborative visualization of distributed and par...

引用

1999 IEEE symposium on parallel visualization and graphics, PVGS 1999

作者： Bajaj, C. Cutchin, S. Department of Computer Sciences and TICAM University of Texas AustinTX78712 United States

ISBN: (纸本)1581132379

This paper presents an interaction model to support collaborative scientific visualization. Relevant prior work is presented to contextualize the model and its import. An implementation of the model is presented within a collaborative system that supports flexible collaborative coupling of multi-user applications. An example application is presented to demonstrate the capabilities of the model. The implementation is Web based, fully supports multi-user interfaces, uses VRML and compresed VRML for three dimensional graphic display, and is implemented in Java with CORBA support for external server access. An example experiment involving multiple users is described.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Hybrid hardware-accelerated image composition for sort-last parallel rendering on graphics clusters with commodity image compositor

Hybrid hardware-accelerated image composition for sort-last ...

引用

IEEE/SIGGRAPH symposium on Volume visualization and graphics (VolVis 2004)

作者： Nonaka, J Kukimoto, N Sakamoto, N Hazama, H Watashiba, Y Liu, XZ Ogata, M Kanazawa, M Koyamada, K Kyoto Univ Kyoto Japan

ISBN: (纸本)0780387813

Hardware-accelerated image composition for sort-last parallel rendering has received increasing attention as an effective solution to increased performance demands brought about by the recent advances in commodity graphics accelerators. So far, several different hardware solutions for alpha and depth compositing have been proposed and a few of them have become commercially available. They share impressive compositing speed and high scalability. However, the cost makes it prohibitively expensive to build a large visualization system. In this paper, we used a hardware image compositor marketed by Mitsubishi Precision Co., Ltd. (MPC) which is now available as an independent device enabling the building of our own visualization cluster. This device is based on binary compositing tree architecture, and the scalable cascade interconnection makes it possible to build a large visualization system. However, we focused on a minimal configuration PC Cluster using only one compositing device while taking cost into consideration. In order to emulate this cascade interconnection of MPC compositors, we propose and evaluate the hybrid hardware-assisted image composition method which uses the OpenGL alpha blending capability of the graphics boards for assisting the hardware image composition process. Preliminary experiments show that the use of graphics boards diminished the performance degradation when using an emulation based on image feedback through available interconnection network. We found that this proposed method becomes an important alternative for providing high performance image composition at a reasonable cost.

关键词： image compositing sort-last parallel rendering hardware-assisted cluster computing

来源：评论

学校读者我要写书评

暂无评论

Practical global illumination for interactive particle visualization

引用

COMPUTERS & graphics-UK 2008年第1期32卷 14-24页

作者： Gribble, Christlaan P. Brownlee, Carson Parker, Steven G. Grove City Coll Lab Interact Visualizat Entertainment & Mobil Dept Comp Sci Grove City PA 16217 USA Univ Utah Sci Comput & Imaging Inst Salt Lake City UT 84112 USA

Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resulting state will communicate subtle changes in the three-dimensional structure, spatial organization, and qualitative trends within a simulation as it evolves. We present two algorithms targeting upcoming, highly parallel multicore desktop systems to enable interactive navigation and exploration of large particle data sets with global illumination effects. Monte Carlo path tracing and texture mapping are used to capture computationally expensive illumination effects such as soft shadows and diffuse interreflection. The first approach is based on precomputation of luminance textures and removes expensive illumination calculations from the interactive rendering pipeline. The second approach is based on dynamic luminance texture generation and decouples interactive rendering from the computation of global illumination effects. These algorithms provide visual cues that enhance the ability to perform analysis and feature detection tasks while interrogating the data at interactive rates. We explore the performance of these algorithms and demonstrate their effectiveness using several large data sets. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： interactive particle visualization global illumination ray tracing

来源：评论

学校读者我要写书评

暂无评论

Making a Case for Green High-Performance visualization via Embedded graphics Processors 32

Making a Case for Green High-Performance Visualization via E...

引用

32nd IEEE International parallel and Distributed Processing symposium (IPDPS)

作者： Adhinarayanan, Vignesh Dutta, Bishwajit Feng, Wu-chun Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA Virginia Tech Dept Comp Sci & Elect & Comp Engn Blacksburg VA 24061 USA

ISBN: (纸本)9781538655559

This paper makes a case for using low-power embedded GPUs for the purpose of executing high-performance scientific visualization tasks. We compare the greenness (i.e., power, energy, and energy-delay product -> EDP) of an embedded GPU with a CPU for commonly encountered visualization tasks using two real-world applications: (1) Modeling for Prediction Across Scale Ocean (MPAS-O) and (2) Particular Ensembles (PE). Our preliminary results show that the low-power embedded GPU is capable of handling complex visualization tasks while consuming less than 50% of the energy consumed by a CPU server. In addition, we find that the embedded GPU outperforms the CPU with dynamic voltage-frequency scaling (DVFS) enabled in a majority of the cases.

关键词： graphics processing units Data visualization Task analysis Central Processing Unit Pipelines"

来源：评论

学校读者我要写书评

暂无评论

A PC cluster system for simultaneous interactive volumetric modeling and visualization 03

A PC cluster system for simultaneous interactive volumetric ...

引用

IEEE symposium on parallel and Large-Data visualization and graphics

作者： Muraki, S Lum, EB Ma, KL Ogata, M Liu, XZ AIST Japan University of California Davis Mitsubishi Precision Co. Ltd. Japan

ISBN: (纸本)078038122X

A number of problems are well suited for volumetric representation for both simulation and storage, however, the large amount of data that needs to be processed and rendered with these volumes makes interactive manipulation extremely challenging. In this paper, we present a scalable PC cluster system (VG cluster) designed specifically to enable simultaneous volumetric computation and visualization, using compositing hardware devices and the latest PC graphics accelerators. We demonstrate the flexibility and performance of this system with several different applications that include reaction-diffusion simulation, volumetric image processing, and vector field visualization. We also discuss how to improve the visual computing performance of this system with some load balancing techniques.

关键词： graphics hardware PC clusters parallel volume rendering reaction-diffusion patterns visual computing volume graphics volume modeling

来源：评论

学校读者我要写书评

暂无评论

Acquisition and stereoscopic visualization of three-dimensional ultrasonic breast data

引用

IEEE TRANSACTIONS ON ULTRASONICS FERROELECTRICS AND FREQUENCY CONTROL 1996年第4期43卷 576-580页

作者： Hernandez, A Basset, O Dautraix, I Magnin, IE Centre de Recherche Villeurbanne France

A motorized mechanical setup has been designed to provide a series of two-dimensional (2-D) parallel echographic slices of the breast from the regular translation of a linear phased array transducer, During the acquisition step, the breast is compressed between a plane support and a plexiglass plate to avoid breast motions. A stereoscopic computer graphic method has been developed for the visualization of such three-dimensional (3-D) ultrasonic data. Experiments on an agar gel phantom and on in vivo female breasts have been performed.

关键词： series (mathematics) visualization COMPUTER graphics Stereoscopic Human Mammary Glands phased array Breast Polymethyl Methacrylate Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications 11

GPU-based Image Compression for Efficient Compositing in Dis...

引用

IEEE 11th symposium on Large Data Analysis and visualization (LDAV)

作者： Lipinksi, Riley Moreland, Kenneth Papka, Michael E. Marrinan, Thomas Univ St Thomas St Paul MN 55105 USA Oak Ridge Natl Lab Oak Ridge TN USA Argonne Natl Lab Argonne IL 60439 USA Northern Illinois Univ De Kalb IL 60115 USA

ISBN: (纸本)9781665432832

visualizations of large-scale data sets are often created on graphics clusters that distribute the rendering task amongst many processes. When using real-time GPU-based graphics algorithms, the most time-consuming aspect of distributed rendering is typically the compositing phase - combining all partial images from each rendering process into the final visualization. Compositing requires image data to be copied off the GPU and sent over a network to other processes. While compression has been utilized in existing distributed rendering compositors to reduce the data being sent over the network, this compression tends to occur after the raw images are transferred from the GPU to main memory. In this paper, we present work that leverages OpenGL / CUDA interoperability to compress raw images on the GPU prior to transferring the data to main memory. This approach can significantly reduce the device-to-host data transfer time, thus enabling more efficient compositing of images generated by distributed rendering applications.

关键词： Computing methodologies Computer graphics Image compression Computing methodologies parallel computing methodologies parallel algorithms Massively parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed shared memory for roaming large volumes

引用

IEEE TRANSACTIONS ON visualization AND COMPUTER graphics 2006年第5期12卷 1299-1306页

作者： Castanie, Laurent Mion, Christophe Cavin, Xavier Levy, Bruno INRIA Earth Desis Nancy France INRIA ALICE Grp Nancy France

We present a cluster-based volume rendering system for roaming very large volumes. This system allows to move a gigabyte-sized probe inside a total volume of several tens or hundreds of gigabytes in real-time. While the size of the probe is limited by the total amount of texture memory on the cluster, the size of the total data set has no theoretical limit. The cluster is used as a distributed graphics processing unit that both aggregates graphics power and graphics memory. A hardware-accelerated volume renderer runs in parallel on the cluster nodes and the final image compositing is implemented using a pipelined sort-last rendering algorithm. Meanwhile, volume bricking and volume paging allow efficient data caching. On each rendering node, a distributed hierarchical cache system implements a global software-based distributed shared memory on the cluster. In case of a cache miss, this system first checks page residency on the other cluster nodes instead of directly accessing local disks. Using two Gigabit Ethernet network interfaces per node, we accelerate data fetching by a factor of 4 compared to directly accessing local disks. The system also implements asynchronous disk access and texture loading, which makes it possible to overlap data loading, volume slicing and rendering for optimal volume roaming.

关键词： large volumes volume roaming out-of-core hierarchical caching distributed shared memory hardware-accelerated volume visualization graphics hardware parallel rendering graphics cluster

来源：评论

学校读者我要写书评

暂无评论

parallel Multi-Layer Ghost Cell Generation for Distributed Unstructured Grids 7

Parallel Multi-Layer Ghost Cell Generation for Distributed U...

引用

IEEE 7th symposium on Large Data Analysis and visualization (LDAV)

作者： Patchett, John M. Nouanesengesy, Boonthanome Pouderoux, Joachim Ahrens, James Hagen, Hans TU Kaiserslautern Los Alamos Natl Lab Kaiserslautern Germany Los Alamos Natl Lab Los Angeles CA USA Kitware SAS Villeurbanne France TU Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781538606179

Ghost cells are important for distributed memory parallel operations that require neighborhood information, and are required for correctness on the boundaries of local data partitions. Ghost cells are one or more layers of grid cells surrounding the external boundary of the local partition, which are owned by other data partitions. They are used by the local partition when neighbor information is required. Finding ghost cells in structured data is trivial and can normally be done by calculating on cell indices. Obtaining ghost cells for unstructured grid data, however, is a nontrivial task. It requires an analysis of the connectivity of the grid in order to find neighbor cells. When the grid is distributed, the operation is further complicated by the need to determine which processes own the neighbor cells, and coordinating communication with them. This is a problem when operating on unstructured grid data sets that do not already have ghost cells. parallel visualization algorithms will usually assume that a cell does not exist if it is not in the local data partition. Without ghost cells, this leads to operations that need neighborhood information, such as point data interpolated from cell data, being calculated incorrectly at partition boundaries. Production visualization tools generally support the existence of ghost cells, but not their generation, especially for unstructured grids. In the literature, there is no documented algorithm for generating in parallel one or more layers of ghost cells for unstructured grid data which has already been partitioned. We present a new algorithm to compute ghost cells in parallel on distributed unstructured data sets with no global cell or point IDs. Given a partitioned data set without ghost cells, this algorithm is capable of producing any number of layers of ghost cells necessary to support parallel operations. Performance results and timing comparisons to ParaView's D3 filter are presented. A number of optimizations to th

关键词： I.3.2 [COMPUTER graphics]: graphics Systems-Distributed/network graphics G.1.0 [Mathematics of Computing]: Numerical Analysis-parallel Algorirthms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：