作者:
Ma, KLNASA
Langley Res Ctr Inst Comp Applicat Sci & Engn Hampton VA 23681 USA
This paper describes work-in-progress on developing parallelvisualization strategies for 3D Adaptive Mesh Refinement (AMR) data. AMR is a simple and powerful tool for modeling many important scientific and engineerin...
详细信息
ISBN:
(纸本)0769500870
This paper describes work-in-progress on developing parallelvisualization strategies for 3D Adaptive Mesh Refinement (AMR) data. AMR is a simple and powerful tool for modeling many important scientific and engineering problems. However visualization tools for 3D AMR data are not generally available. Converting AMR data onto a uniform mesh would result in high storage requirements, and rendering the uniform-mesh data on an average graphics workstation can be painfully slow if not impossible. The adaptive nature of the embedded mesh demands sophisticated visualization calculations. In this work, we compare the performance and storage requirements of a parallel volume renderer for regular-mesh data with a new parallel renderer based on adaptive sampling. While both renderers can achieve interactive visualization, the new approach offers significant performance gains, as indicated by our experiments on the SGI/Cray T3E.
In parallel ray tracing, techniques fall into one of two camps: imageparallel techniques aim at increasing frame rate by replicating scene data across nodes and splitting the rendering work across different ranks, and...
详细信息
ISBN:
(数字)9781665491563
ISBN:
(纸本)9781665491563
In parallel ray tracing, techniques fall into one of two camps: imageparallel techniques aim at increasing frame rate by replicating scene data across nodes and splitting the rendering work across different ranks, and data-parallel techniques aim at increasing the size of the model that can be rendered by splitting the model across multiple ranks, but typically cannot scale much in frame rate. We propose and evaluate a hybrid approach that combines the advantages of both by splitting a set of N x M ranks into M islands of N ranks each and using data-parallel rendering within each island and image parallelism across islands. We discuss the integration of this concept into four wildly different parallel renderers and evaluate the efficacy of this approach based on multiple different data sets.
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical modeling) and also treating interacti...
详细信息
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical modeling) and also treating interactions with the surrounding scene (collision handling). In this paper, we present an approach to parallel cloth simulation designed for distributed memory parallel architectures, particularly clusters built of commodity components. We discuss parallel techniques for the physical modeling phase as well as for the collision handling phase which can significantly reduce the respective computation times. To deal with the very fine granularity of the physical modeling phase we apply a static data decomposition approach based on graph partitioning. In order to cope with the high irregularity of the collision handling phase we employ taskparallel techniques based on fully dynamic problem decomposition. We show how both techniques can be integrated into a robust parallel cloth simulation method which can deal with considerably complex scenes. (c) 2007 Elsevier B.V. All rights reserved.
This paper presents a parallel algorithm that can effectively extracts only the visible portion of isosurfaces. The main focus of our research is to devise a load-balanced and output-sensitive algorithm, that is, each...
详细信息
ISBN:
(纸本)0780372239
This paper presents a parallel algorithm that can effectively extracts only the visible portion of isosurfaces. The main focus of our research is to devise a load-balanced and output-sensitive algorithm, that is, each processor will generate approximately the same amount of triangles, and cells that do not contain the visible isosurface will not be visited. A novel multi-pass algorithm is proposed in the paper to achieve these goals. In the algorithm, we first use an octree data structure to rapidly skip the empty cells. An image space visibility culling technique is then used to identify the visible isosurface cells in a progressive manner. To distribute the workload, we use a binary image space partitioning method to ensure that each processor will generate approximately the same amount of triangles. Isosurface extraction and visibility update are performed in parallel to reduce the total computation time. In addition to reducing the size of output geometry and accelerating the process of isosurface extraction, the multi-pass nature of our algorithm can also be used to perform time-critical computation.
Since multicore processors are now the architectural standard and parallel computing is in the core CS curriculum, educators must create pedagogical materials and tools to help students master parallel abstractions an...
详细信息
ISBN:
(纸本)9781509036820
Since multicore processors are now the architectural standard and parallel computing is in the core CS curriculum, educators must create pedagogical materials and tools to help students master parallel abstractions and concepts. This paper describes the thread safe graphics library (TSGL), a tool by which an educator can add graphics calls to a working multithreaded program in order to make visible the underlying parallel behavior. Using TSGL, an instructor (or student) can create parallelvisualizations that clearly show the parallel patterns or techniques that a given program is using, allowing students to see the parallel behavior in near real-time as the program is running. TSGL includes many examples that illustrate its use;this paper presents a representative sample that can be used, either in a lecture or a self-paced lab format.
As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity workstations, a viable approach to simplifying such models is parallel mesh simplification algorithms. A naive approac...
详细信息
ISBN:
(纸本)078038122X
As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity workstations, a viable approach to simplifying such models is parallel mesh simplification algorithms. A naive approach that divides the model into a number of equally sized chunks and distributes them to a number of potentially heterogeneous workstations is bound to fail. In severe cases the computation becomes virtually impossible due to significant slow downs because of memory thrashing. We present a general parallel framework for simplification of very large meshes. This framework ensures a near optimal utilization of the computational resources in a cluster of workstations by providing an intelligent partitioning of the model. This partitioning ensures a high quality output, low runtime due to intelligent load balancing, and high parallel efficiency by providing total memory utilization of each machine, thus guaranteeing not to trash the virtual memory system. To test the usability of our framework we have implemented a parallel version of R-Simp [Brodsky and Watson 2000].
The proceedings contain 10 papers. The topics discussed include: precomputing sound scattering for structured surfaces;performance modeling of vl3 volume rendering on GPU-based clusters;parallel progressive mesh editi...
ISBN:
(纸本)9783905674590
The proceedings contain 10 papers. The topics discussed include: precomputing sound scattering for structured surfaces;performance modeling of vl3 volume rendering on GPU-based clusters;parallel progressive mesh editing;free-processing: transparent in situ visualization via data interception;auto-tuning complex array layouts for GPUs;finely-threaded history-based topology computation;clustered pre-convolved radiance caching;parallel methodologies for a micropolygon renderer;collaborative high-fidelity rendering over peer-to-peer networks;and a study of parallel data compression using proper orthogonal decomposition on the K computer.
The proceedings contain 12 papers. The topics discussed include: large-scale parallelvisualization of particle-based simulations using point sprites and level-of-detail;memory-efficient on-the-fly voxelization of par...
ISBN:
(纸本)9783905674811
The proceedings contain 12 papers. The topics discussed include: large-scale parallelvisualization of particle-based simulations using point sprites and level-of-detail;memory-efficient on-the-fly voxelization of particle data;visualization of 2D wave propagation by Huygens' principle;visualization showcase: general-relativistic black hole visualization;SIMD parallel ray tracing of homogeneous polyhedral grids;packet-oriented streamline tracing on modern SIMD architectures;volume rendering via data-parallel primitives;visualization of high-resolution weather model data;TOD-tree: task-overlapped direct send tree image compositing for hybrid MPI parallelism;contour tree depth images for large data visualization;out-of-core framework for QEM-based mesh simplification;and visualizing groundwater flow through karst limestone.
Prioritization of data is necessary for managing large-scale scientific data, as the scale of the data implies that there are only enough resources available to process a limited subset of the data. For example, data ...
详细信息
ISBN:
(纸本)9781479952151
Prioritization of data is necessary for managing large-scale scientific data, as the scale of the data implies that there are only enough resources available to process a limited subset of the data. For example, data prioritization is used during in situ triage to scale with bandwidth bottlenecks, and used during focus+context visualization to save time during analysis by guiding the user to important information. In this paper, we present ADR visualization, a generalized analysis framework for ranking large-scale data using Analysis -Driven Refinement (ADR), which is inspired by Adaptive Mesh Refinement (AMR). A large-scale data set is partitioned in space, time, and variable, using user-defined importance measurements for prioritization. This process creates a prioritization tree over the data set. Using this tree, selection methods can generate sparse data products for analysis, such as focus+context visualizations or sparse data sets.
The proceedings contain 10 papers. The topics discussed include: adaptive collision culling for large-scale simulations by a parallel sweep and prune algorithm;external face-list calculation with data-parallel primiti...
ISBN:
(纸本)9783038680062
The proceedings contain 10 papers. The topics discussed include: adaptive collision culling for large-scale simulations by a parallel sweep and prune algorithm;external face-list calculation with data-parallel primitives;parallel spatial splits in bounding volume hierarchies;interacting with large distributed datasets using sketch;high-performance mesh partitioning and ghost cell generation for visualization software;web-enabled server-based and distributed real-time ray-tracing;a scalable streamline generation algorithm via flux-based isocontour extraction;dynamically scheduled region-based image compositing;dynamic work packages in parallel rendering;and data mining tornado-genesis precursors.
暂无评论